/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.06.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:39:31,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:39:31,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:39:31,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:39:31,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:39:31,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:39:31,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:39:31,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:39:31,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:39:31,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:39:31,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:39:31,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:39:31,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:39:31,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:39:31,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:39:31,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:39:31,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:39:31,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:39:31,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:39:31,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:39:31,112 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:39:31,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:39:31,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:39:31,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:39:31,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:39:31,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:39:31,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:39:31,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:39:31,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:39:31,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:39:31,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:39:31,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:39:31,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:39:31,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:39:31,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:39:31,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:39:31,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:39:31,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:39:31,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:39:31,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:39:31,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:39:31,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:39:31,132 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:39:31,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:39:31,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:39:31,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:39:31,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:39:31,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:39:31,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:39:31,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:39:31,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:39:31,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:39:31,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:39:31,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:39:31,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:39:31,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:39:31,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:39:31,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:39:31,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:39:31,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:39:31,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:39:31,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:39:31,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:39:31,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:39:31,151 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:39:31,151 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:39:31,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:39:31,152 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:39:31,152 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-15 11:39:31,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:39:31,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:39:31,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:39:31,422 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:39:31,423 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:39:31,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.06.i.cil-2.c [2022-04-15 11:39:31,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183c4952d/00347a277e024dd78794f1cc54ce01d9/FLAGa6e3a7d27 [2022-04-15 11:39:32,072 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:39:32,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.06.i.cil-2.c [2022-04-15 11:39:32,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183c4952d/00347a277e024dd78794f1cc54ce01d9/FLAGa6e3a7d27 [2022-04-15 11:39:32,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/183c4952d/00347a277e024dd78794f1cc54ce01d9 [2022-04-15 11:39:32,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:39:32,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:39:32,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:39:32,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:39:32,334 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:39:32,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:32,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f94b9b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32, skipping insertion in model container [2022-04-15 11:39:32,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:32,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:39:32,413 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:39:32,739 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.06.i.cil-2.c[78808,78821] [2022-04-15 11:39:32,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:39:32,773 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:39:32,945 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.06.i.cil-2.c[78808,78821] [2022-04-15 11:39:32,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:39:32,970 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:39:32,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32 WrapperNode [2022-04-15 11:39:32,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:39:32,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:39:32,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:39:32,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:39:32,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:32,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:33,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:33,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:33,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:33,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:33,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:33,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:39:33,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:39:33,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:39:33,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:39:33,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (1/1) ... [2022-04-15 11:39:33,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:39:33,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:39:33,145 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-15 11:39:33,155 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-15 11:39:33,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:39:33,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:39:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:39:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:39:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:39:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:39:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:39:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:39:33,187 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:39:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:39:33,188 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:39:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:39:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:39:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:39:33,189 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:39:33,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:39:33,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:39:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:39:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:39:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:39:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:39:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:39:33,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:39:33,397 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:39:33,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:39:34,323 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:39:34,993 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:39:34,993 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:39:35,010 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:39:35,024 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:39:35,024 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:39:35,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:39:35 BoogieIcfgContainer [2022-04-15 11:39:35,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:39:35,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:39:35,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:39:35,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:39:35,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:39:32" (1/3) ... [2022-04-15 11:39:35,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84f4353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:39:35, skipping insertion in model container [2022-04-15 11:39:35,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:39:32" (2/3) ... [2022-04-15 11:39:35,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84f4353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:39:35, skipping insertion in model container [2022-04-15 11:39:35,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:39:35" (3/3) ... [2022-04-15 11:39:35,039 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2022-04-15 11:39:35,047 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:39:35,048 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:39:35,088 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:39:35,097 INFO L340 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 [2022-04-15 11:39:35,097 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:39:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 162 states have (on average 1.728395061728395) internal successors, (280), 163 states have internal predecessors, (280), 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-15 11:39:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 11:39:35,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:35,139 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:35,140 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1044787868, now seen corresponding path program 1 times [2022-04-15 11:39:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:35,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358659027] [2022-04-15 11:39:35,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:39:35,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1044787868, now seen corresponding path program 2 times [2022-04-15 11:39:35,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:35,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415693892] [2022-04-15 11:39:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:35,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:35,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:35,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {173#true} is VALID [2022-04-15 11:39:35,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 11:39:35,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #755#return; {173#true} is VALID [2022-04-15 11:39:35,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {180#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:39:35,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {173#true} is VALID [2022-04-15 11:39:35,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-15 11:39:35,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #755#return; {173#true} is VALID [2022-04-15 11:39:35,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret161 := main(); {173#true} is VALID [2022-04-15 11:39:35,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {173#true} is VALID [2022-04-15 11:39:35,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {173#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {173#true} is VALID [2022-04-15 11:39:35,865 INFO L272 TraceCheckUtils]: 7: Hoare triple {173#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {173#true} is VALID [2022-04-15 11:39:35,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,903 INFO L290 TraceCheckUtils]: 38: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:39:35,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {178#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {179#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-15 11:39:35,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {179#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {174#false} is VALID [2022-04-15 11:39:35,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {174#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {174#false} is VALID [2022-04-15 11:39:35,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {174#false} assume !(9 == ~blastFlag~0); {174#false} is VALID [2022-04-15 11:39:35,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {174#false} assume !(12 == ~blastFlag~0); {174#false} is VALID [2022-04-15 11:39:35,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {174#false} assume !(15 == ~blastFlag~0); {174#false} is VALID [2022-04-15 11:39:35,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {174#false} assume !(18 == ~blastFlag~0); {174#false} is VALID [2022-04-15 11:39:35,914 INFO L290 TraceCheckUtils]: 50: Hoare triple {174#false} assume 21 == ~blastFlag~0; {174#false} is VALID [2022-04-15 11:39:35,915 INFO L290 TraceCheckUtils]: 51: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-15 11:39:35,920 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-15 11:39:35,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:35,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415693892] [2022-04-15 11:39:35,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415693892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:35,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:35,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:35,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:35,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358659027] [2022-04-15 11:39:35,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358659027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:35,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:35,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252699137] [2022-04-15 11:39:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 11:39:35,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:35,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:36,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:36,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:36,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:36,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:36,086 INFO L87 Difference]: Start difference. First operand has 170 states, 162 states have (on average 1.728395061728395) internal successors, (280), 163 states have internal predecessors, (280), 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.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:39,975 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-15 11:39:41,593 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-15 11:39:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:43,742 INFO L93 Difference]: Finished difference Result 464 states and 794 transitions. [2022-04-15 11:39:43,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 11:39:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 794 transitions. [2022-04-15 11:39:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 794 transitions. [2022-04-15 11:39:43,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 794 transitions. [2022-04-15 11:39:44,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 794 edges. 794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:44,492 INFO L225 Difference]: With dead ends: 464 [2022-04-15 11:39:44,492 INFO L226 Difference]: Without dead ends: 283 [2022-04-15 11:39:44,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:39:44,505 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 174 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:44,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 535 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 559 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 11:39:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-15 11:39:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 194. [2022-04-15 11:39:44,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:44,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 194 states, 189 states have (on average 1.6296296296296295) internal successors, (308), 189 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:44,570 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 194 states, 189 states have (on average 1.6296296296296295) internal successors, (308), 189 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:44,571 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 194 states, 189 states have (on average 1.6296296296296295) internal successors, (308), 189 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:44,590 INFO L93 Difference]: Finished difference Result 283 states and 443 transitions. [2022-04-15 11:39:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 443 transitions. [2022-04-15 11:39:44,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:44,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:44,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 189 states have (on average 1.6296296296296295) internal successors, (308), 189 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-15 11:39:44,600 INFO L87 Difference]: Start difference. First operand has 194 states, 189 states have (on average 1.6296296296296295) internal successors, (308), 189 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-15 11:39:44,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:44,621 INFO L93 Difference]: Finished difference Result 283 states and 443 transitions. [2022-04-15 11:39:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 443 transitions. [2022-04-15 11:39:44,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:44,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:44,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:44,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 189 states have (on average 1.6296296296296295) internal successors, (308), 189 states have internal predecessors, (308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 312 transitions. [2022-04-15 11:39:44,636 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 312 transitions. Word has length 52 [2022-04-15 11:39:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:44,637 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 312 transitions. [2022-04-15 11:39:44,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:44,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 312 transitions. [2022-04-15 11:39:44,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 312 edges. 312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 312 transitions. [2022-04-15 11:39:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 11:39:44,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:44,887 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:39:44,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:39:44,887 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash -125938628, now seen corresponding path program 1 times [2022-04-15 11:39:44,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:44,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113220128] [2022-04-15 11:39:44,889 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:39:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash -125938628, now seen corresponding path program 2 times [2022-04-15 11:39:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:44,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326607725] [2022-04-15 11:39:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:45,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {2074#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2067#true} is VALID [2022-04-15 11:39:45,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {2067#true} assume true; {2067#true} is VALID [2022-04-15 11:39:45,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2067#true} {2067#true} #755#return; {2067#true} is VALID [2022-04-15 11:39:45,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {2067#true} call ULTIMATE.init(); {2074#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:39:45,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {2074#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2067#true} is VALID [2022-04-15 11:39:45,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {2067#true} assume true; {2067#true} is VALID [2022-04-15 11:39:45,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2067#true} {2067#true} #755#return; {2067#true} is VALID [2022-04-15 11:39:45,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {2067#true} call #t~ret161 := main(); {2067#true} is VALID [2022-04-15 11:39:45,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {2067#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {2067#true} is VALID [2022-04-15 11:39:45,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {2067#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2067#true} is VALID [2022-04-15 11:39:45,111 INFO L272 TraceCheckUtils]: 7: Hoare triple {2067#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2067#true} is VALID [2022-04-15 11:39:45,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {2067#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:45,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {2072#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2073#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:39:45,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {2073#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {2068#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {2068#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {2068#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {2068#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {2068#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {2068#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {2068#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,124 INFO L290 TraceCheckUtils]: 32: Hoare triple {2068#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {2068#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {2068#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {2068#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {2068#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {2068#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {2068#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {2068#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {2068#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {2068#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {2068#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {2068#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {2068#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {2068#false} is VALID [2022-04-15 11:39:45,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {2068#false} assume 8641 == #t~mem76;havoc #t~mem76; {2068#false} is VALID [2022-04-15 11:39:45,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {2068#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {2068#false} is VALID [2022-04-15 11:39:45,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {2068#false} assume !(9 == ~blastFlag~0); {2068#false} is VALID [2022-04-15 11:39:45,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {2068#false} assume !(12 == ~blastFlag~0); {2068#false} is VALID [2022-04-15 11:39:45,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {2068#false} assume !(15 == ~blastFlag~0); {2068#false} is VALID [2022-04-15 11:39:45,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {2068#false} assume !(18 == ~blastFlag~0); {2068#false} is VALID [2022-04-15 11:39:45,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {2068#false} assume 21 == ~blastFlag~0; {2068#false} is VALID [2022-04-15 11:39:45,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {2068#false} assume !false; {2068#false} is VALID [2022-04-15 11:39:45,128 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-15 11:39:45,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:45,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326607725] [2022-04-15 11:39:45,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326607725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:45,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:45,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:45,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113220128] [2022-04-15 11:39:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113220128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:45,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:45,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:45,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396601722] [2022-04-15 11:39:45,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:45,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 11:39:45,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:45,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:45,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:45,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:45,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:45,180 INFO L87 Difference]: Start difference. First operand 194 states and 312 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:47,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:52,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:39:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:53,271 INFO L93 Difference]: Finished difference Result 401 states and 646 transitions. [2022-04-15 11:39:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:39:53,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 11:39:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:39:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-04-15 11:39:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-04-15 11:39:53,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 500 transitions. [2022-04-15 11:39:53,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:53,639 INFO L225 Difference]: With dead ends: 401 [2022-04-15 11:39:53,640 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 11:39:53,641 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:39:53,642 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 22 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:39:53,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 553 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 11:39:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 11:39:53,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-04-15 11:39:53,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:39:53,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 205 states, 200 states have (on average 1.635) internal successors, (327), 200 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:53,657 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 205 states, 200 states have (on average 1.635) internal successors, (327), 200 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:53,657 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 205 states, 200 states have (on average 1.635) internal successors, (327), 200 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:53,665 INFO L93 Difference]: Finished difference Result 222 states and 352 transitions. [2022-04-15 11:39:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 352 transitions. [2022-04-15 11:39:53,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:53,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:53,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 200 states have (on average 1.635) internal successors, (327), 200 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 11:39:53,667 INFO L87 Difference]: Start difference. First operand has 205 states, 200 states have (on average 1.635) internal successors, (327), 200 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 11:39:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:39:53,675 INFO L93 Difference]: Finished difference Result 222 states and 352 transitions. [2022-04-15 11:39:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 352 transitions. [2022-04-15 11:39:53,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:39:53,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:39:53,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:39:53,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:39:53,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.635) internal successors, (327), 200 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 331 transitions. [2022-04-15 11:39:53,684 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 331 transitions. Word has length 53 [2022-04-15 11:39:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:39:53,684 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 331 transitions. [2022-04-15 11:39:53,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:39:53,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 331 transitions. [2022-04-15 11:39:53,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:39:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 331 transitions. [2022-04-15 11:39:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:39:53,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:39:53,953 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:39:53,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:39:53,953 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:39:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:39:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -119670736, now seen corresponding path program 1 times [2022-04-15 11:39:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:53,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [76200499] [2022-04-15 11:39:53,996 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:39:53,996 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:39:53,999 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:39:53,999 INFO L85 PathProgramCache]: Analyzing trace with hash -119670736, now seen corresponding path program 2 times [2022-04-15 11:39:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:39:54,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613763803] [2022-04-15 11:39:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:39:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:39:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:39:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:39:54,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {3742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3735#true} is VALID [2022-04-15 11:39:54,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {3735#true} assume true; {3735#true} is VALID [2022-04-15 11:39:54,196 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3735#true} {3735#true} #755#return; {3735#true} is VALID [2022-04-15 11:39:54,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {3735#true} call ULTIMATE.init(); {3742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:39:54,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {3742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3735#true} is VALID [2022-04-15 11:39:54,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {3735#true} assume true; {3735#true} is VALID [2022-04-15 11:39:54,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3735#true} {3735#true} #755#return; {3735#true} is VALID [2022-04-15 11:39:54,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {3735#true} call #t~ret161 := main(); {3735#true} is VALID [2022-04-15 11:39:54,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {3735#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {3735#true} is VALID [2022-04-15 11:39:54,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {3735#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3735#true} is VALID [2022-04-15 11:39:54,209 INFO L272 TraceCheckUtils]: 7: Hoare triple {3735#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3735#true} is VALID [2022-04-15 11:39:54,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {3735#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:39:54,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {3740#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3741#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-15 11:39:54,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {3741#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {3736#false} is VALID [2022-04-15 11:39:54,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {3736#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {3736#false} is VALID [2022-04-15 11:39:54,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {3736#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {3736#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {3736#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3736#false} is VALID [2022-04-15 11:39:54,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {3736#false} ~skip~0 := 0; {3736#false} is VALID [2022-04-15 11:39:54,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {3736#false} assume !false; {3736#false} is VALID [2022-04-15 11:39:54,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {3736#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {3736#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {3736#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {3736#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {3736#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {3736#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {3736#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {3736#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {3736#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {3736#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {3736#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {3736#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {3736#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {3736#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,228 INFO L290 TraceCheckUtils]: 42: Hoare triple {3736#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {3736#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {3736#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {3736#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {3736#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {3736#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {3736#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {3736#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {3736#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {3736#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {3736#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {3736#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {3736#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,230 INFO L290 TraceCheckUtils]: 55: Hoare triple {3736#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {3736#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {3736#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3736#false} is VALID [2022-04-15 11:39:54,231 INFO L290 TraceCheckUtils]: 58: Hoare triple {3736#false} assume 8641 == #t~mem76;havoc #t~mem76; {3736#false} is VALID [2022-04-15 11:39:54,231 INFO L290 TraceCheckUtils]: 59: Hoare triple {3736#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3736#false} is VALID [2022-04-15 11:39:54,232 INFO L290 TraceCheckUtils]: 60: Hoare triple {3736#false} assume !(9 == ~blastFlag~0); {3736#false} is VALID [2022-04-15 11:39:54,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {3736#false} assume !(12 == ~blastFlag~0); {3736#false} is VALID [2022-04-15 11:39:54,232 INFO L290 TraceCheckUtils]: 62: Hoare triple {3736#false} assume !(15 == ~blastFlag~0); {3736#false} is VALID [2022-04-15 11:39:54,232 INFO L290 TraceCheckUtils]: 63: Hoare triple {3736#false} assume !(18 == ~blastFlag~0); {3736#false} is VALID [2022-04-15 11:39:54,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {3736#false} assume 21 == ~blastFlag~0; {3736#false} is VALID [2022-04-15 11:39:54,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {3736#false} assume !false; {3736#false} is VALID [2022-04-15 11:39:54,234 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-15 11:39:54,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:39:54,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613763803] [2022-04-15 11:39:54,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613763803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:54,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:54,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:54,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:39:54,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [76200499] [2022-04-15 11:39:54,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [76200499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:39:54,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:39:54,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:39:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043300451] [2022-04-15 11:39:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:39:54,238 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-15 11:39:54,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:39:54,239 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-15 11:39:54,317 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-15 11:39:54,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:39:54,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:39:54,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:39:54,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:39:54,318 INFO L87 Difference]: Start difference. First operand 205 states and 331 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-15 11:40:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:00,564 INFO L93 Difference]: Finished difference Result 401 states and 645 transitions. [2022-04-15 11:40:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:00,564 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-15 11:40:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:00,564 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-15 11:40:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-04-15 11:40:00,570 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-15 11:40:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-04-15 11:40:00,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 499 transitions. [2022-04-15 11:40:00,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 499 edges. 499 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:00,972 INFO L225 Difference]: With dead ends: 401 [2022-04-15 11:40:00,972 INFO L226 Difference]: Without dead ends: 222 [2022-04-15 11:40:00,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:00,974 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 24 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:00,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 555 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 11:40:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-15 11:40:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 205. [2022-04-15 11:40:00,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:00,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 205 states, 200 states have (on average 1.63) internal successors, (326), 200 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:00,984 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 205 states, 200 states have (on average 1.63) internal successors, (326), 200 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:00,985 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 205 states, 200 states have (on average 1.63) internal successors, (326), 200 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:00,991 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2022-04-15 11:40:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 351 transitions. [2022-04-15 11:40:00,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:00,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:00,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 200 states have (on average 1.63) internal successors, (326), 200 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 11:40:00,993 INFO L87 Difference]: Start difference. First operand has 205 states, 200 states have (on average 1.63) internal successors, (326), 200 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 222 states. [2022-04-15 11:40:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:00,999 INFO L93 Difference]: Finished difference Result 222 states and 351 transitions. [2022-04-15 11:40:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 351 transitions. [2022-04-15 11:40:01,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:01,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:01,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:01,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.63) internal successors, (326), 200 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 330 transitions. [2022-04-15 11:40:01,008 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 330 transitions. Word has length 66 [2022-04-15 11:40:01,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:01,008 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 330 transitions. [2022-04-15 11:40:01,008 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:01,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 330 transitions. [2022-04-15 11:40:01,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 330 transitions. [2022-04-15 11:40:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:40:01,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:01,254 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:40:01,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:40:01,254 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:01,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2076010048, now seen corresponding path program 1 times [2022-04-15 11:40:01,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:01,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286856303] [2022-04-15 11:40:01,281 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:40:01,281 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:40:01,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2076010048, now seen corresponding path program 2 times [2022-04-15 11:40:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:01,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152711977] [2022-04-15 11:40:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:01,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:01,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {5410#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5403#true} is VALID [2022-04-15 11:40:01,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {5403#true} assume true; {5403#true} is VALID [2022-04-15 11:40:01,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5403#true} {5403#true} #755#return; {5403#true} is VALID [2022-04-15 11:40:01,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {5403#true} call ULTIMATE.init(); {5410#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:40:01,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {5410#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5403#true} is VALID [2022-04-15 11:40:01,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {5403#true} assume true; {5403#true} is VALID [2022-04-15 11:40:01,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5403#true} {5403#true} #755#return; {5403#true} is VALID [2022-04-15 11:40:01,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {5403#true} call #t~ret161 := main(); {5403#true} is VALID [2022-04-15 11:40:01,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {5403#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {5403#true} is VALID [2022-04-15 11:40:01,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {5403#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5403#true} is VALID [2022-04-15 11:40:01,433 INFO L272 TraceCheckUtils]: 7: Hoare triple {5403#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5403#true} is VALID [2022-04-15 11:40:01,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {5403#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:01,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:01,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:01,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:01,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:01,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:01,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:40:01,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {5408#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5409#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 11:40:01,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {5409#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {5404#false} is VALID [2022-04-15 11:40:01,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {5404#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {5404#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {5404#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5404#false} is VALID [2022-04-15 11:40:01,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {5404#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {5404#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {5404#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {5404#false} is VALID [2022-04-15 11:40:01,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {5404#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {5404#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {5404#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {5404#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5404#false} is VALID [2022-04-15 11:40:01,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {5404#false} ~skip~0 := 0; {5404#false} is VALID [2022-04-15 11:40:01,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {5404#false} assume !false; {5404#false} is VALID [2022-04-15 11:40:01,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {5404#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {5404#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {5404#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {5404#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {5404#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {5404#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {5404#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {5404#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,444 INFO L290 TraceCheckUtils]: 37: Hoare triple {5404#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {5404#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {5404#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {5404#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {5404#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {5404#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {5404#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {5404#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {5404#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {5404#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {5404#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {5404#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {5404#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {5404#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {5404#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {5404#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {5404#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {5404#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {5404#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {5404#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {5404#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {5404#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5404#false} is VALID [2022-04-15 11:40:01,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {5404#false} assume 8641 == #t~mem76;havoc #t~mem76; {5404#false} is VALID [2022-04-15 11:40:01,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {5404#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5404#false} is VALID [2022-04-15 11:40:01,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {5404#false} assume !(9 == ~blastFlag~0); {5404#false} is VALID [2022-04-15 11:40:01,448 INFO L290 TraceCheckUtils]: 62: Hoare triple {5404#false} assume !(12 == ~blastFlag~0); {5404#false} is VALID [2022-04-15 11:40:01,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {5404#false} assume !(15 == ~blastFlag~0); {5404#false} is VALID [2022-04-15 11:40:01,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {5404#false} assume !(18 == ~blastFlag~0); {5404#false} is VALID [2022-04-15 11:40:01,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {5404#false} assume 21 == ~blastFlag~0; {5404#false} is VALID [2022-04-15 11:40:01,459 INFO L290 TraceCheckUtils]: 66: Hoare triple {5404#false} assume !false; {5404#false} is VALID [2022-04-15 11:40:01,460 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-15 11:40:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152711977] [2022-04-15 11:40:01,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152711977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:01,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:01,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:01,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:01,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286856303] [2022-04-15 11:40:01,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286856303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:01,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:01,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797180953] [2022-04-15 11:40:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:01,461 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-15 11:40:01,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:01,462 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-15 11:40:01,520 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-15 11:40:01,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:01,522 INFO L87 Difference]: Start difference. First operand 205 states and 330 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:04,747 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-15 11:40:06,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:08,712 INFO L93 Difference]: Finished difference Result 400 states and 643 transitions. [2022-04-15 11:40:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:08,713 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-15 11:40:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:08,713 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-15 11:40:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2022-04-15 11:40:08,718 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-15 11:40:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2022-04-15 11:40:08,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 497 transitions. [2022-04-15 11:40:09,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 497 edges. 497 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:09,074 INFO L225 Difference]: With dead ends: 400 [2022-04-15 11:40:09,074 INFO L226 Difference]: Without dead ends: 221 [2022-04-15 11:40:09,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:09,075 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 28 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:09,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 557 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:40:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-15 11:40:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2022-04-15 11:40:09,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:09,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 205 states, 200 states have (on average 1.625) internal successors, (325), 200 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:09,086 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 205 states, 200 states have (on average 1.625) internal successors, (325), 200 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:09,087 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 205 states, 200 states have (on average 1.625) internal successors, (325), 200 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:09,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:09,091 INFO L93 Difference]: Finished difference Result 221 states and 349 transitions. [2022-04-15 11:40:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2022-04-15 11:40:09,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:09,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:09,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 205 states, 200 states have (on average 1.625) internal successors, (325), 200 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-15 11:40:09,094 INFO L87 Difference]: Start difference. First operand has 205 states, 200 states have (on average 1.625) internal successors, (325), 200 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 221 states. [2022-04-15 11:40:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:09,098 INFO L93 Difference]: Finished difference Result 221 states and 349 transitions. [2022-04-15 11:40:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 349 transitions. [2022-04-15 11:40:09,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:09,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:09,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:09,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 200 states have (on average 1.625) internal successors, (325), 200 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 329 transitions. [2022-04-15 11:40:09,105 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 329 transitions. Word has length 67 [2022-04-15 11:40:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:09,105 INFO L478 AbstractCegarLoop]: Abstraction has 205 states and 329 transitions. [2022-04-15 11:40:09,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:09,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 205 states and 329 transitions. [2022-04-15 11:40:09,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 329 transitions. [2022-04-15 11:40:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:40:09,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:09,382 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:40:09,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:40:09,382 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1867479892, now seen corresponding path program 1 times [2022-04-15 11:40:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:09,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [284311762] [2022-04-15 11:40:09,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:40:09,588 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:40:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash 692587737, now seen corresponding path program 1 times [2022-04-15 11:40:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:09,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982623567] [2022-04-15 11:40:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:09,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {7073#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7067#true} is VALID [2022-04-15 11:40:09,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {7067#true} assume true; {7067#true} is VALID [2022-04-15 11:40:09,756 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7067#true} {7067#true} #755#return; {7067#true} is VALID [2022-04-15 11:40:09,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {7067#true} call ULTIMATE.init(); {7073#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:40:09,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {7073#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7067#true} is VALID [2022-04-15 11:40:09,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {7067#true} assume true; {7067#true} is VALID [2022-04-15 11:40:09,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7067#true} {7067#true} #755#return; {7067#true} is VALID [2022-04-15 11:40:09,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {7067#true} call #t~ret161 := main(); {7067#true} is VALID [2022-04-15 11:40:09,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {7067#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {7067#true} is VALID [2022-04-15 11:40:09,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {7067#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7067#true} is VALID [2022-04-15 11:40:09,758 INFO L272 TraceCheckUtils]: 7: Hoare triple {7067#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7067#true} is VALID [2022-04-15 11:40:09,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {7067#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {7072#(= 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)))); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} [761] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.offset_262| |v_#memory_$Pointer$.offset_256|)) (.cse1 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse2 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse3 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse4 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse5 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse6 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse7 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse8 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse9 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse10 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse11 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse12 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|)) (.cse13 (= |v_#memory_$Pointer$.base_262| |v_#memory_$Pointer$.base_256|))) (or (and .cse0 .cse1 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_#memory_int_257| |v_#memory_int_262|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|) .cse13) (and .cse0 .cse1 .cse2 (= |v_#memory_int_262| |v_#memory_int_257|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_10| |v_ssl3_accept_#t~mem150.offset_8|) (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|) .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_262|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_10|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_10|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_12|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_6|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_16, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_262|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_262|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_8} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_257|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} [760] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,768 INFO L290 TraceCheckUtils]: 30: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,771 INFO L290 TraceCheckUtils]: 39: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,772 INFO L290 TraceCheckUtils]: 41: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,775 INFO L290 TraceCheckUtils]: 50: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(15 == ~blastFlag~0); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume !(18 == ~blastFlag~0); {7072#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:09,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {7072#(= ssl3_accept_~blastFlag~0 0)} assume 21 == ~blastFlag~0; {7068#false} is VALID [2022-04-15 11:40:09,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {7068#false} assume !false; {7068#false} is VALID [2022-04-15 11:40:09,780 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-15 11:40:09,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:09,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982623567] [2022-04-15 11:40:09,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982623567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:09,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:09,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:40:12,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:12,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [284311762] [2022-04-15 11:40:12,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [284311762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:12,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:12,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:40:12,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226292712] [2022-04-15 11:40:12,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:12,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:12,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:12,826 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-15 11:40:12,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:40:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:12,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:40:12,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:40:12,828 INFO L87 Difference]: Start difference. First operand 205 states and 329 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:19,836 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-15 11:40:21,858 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-15 11:40:25,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:25,347 INFO L93 Difference]: Finished difference Result 561 states and 915 transitions. [2022-04-15 11:40:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:40:25,347 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 679 transitions. [2022-04-15 11:40:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 679 transitions. [2022-04-15 11:40:25,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 679 transitions. [2022-04-15 11:40:25,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 679 edges. 679 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:25,887 INFO L225 Difference]: With dead ends: 561 [2022-04-15 11:40:25,887 INFO L226 Difference]: Without dead ends: 382 [2022-04-15 11:40:25,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:40:25,890 INFO L913 BasicCegarLoop]: 364 mSDtfsCounter, 152 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:25,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 1017 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 927 Invalid, 2 Unknown, 255 Unchecked, 6.2s Time] [2022-04-15 11:40:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-04-15 11:40:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 377. [2022-04-15 11:40:25,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:25,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states. Second operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:25,912 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states. Second operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:25,913 INFO L87 Difference]: Start difference. First operand 382 states. Second operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:25,924 INFO L93 Difference]: Finished difference Result 382 states and 599 transitions. [2022-04-15 11:40:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 599 transitions. [2022-04-15 11:40:25,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:25,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:25,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 382 states. [2022-04-15 11:40:25,927 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 382 states. [2022-04-15 11:40:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:25,937 INFO L93 Difference]: Finished difference Result 382 states and 599 transitions. [2022-04-15 11:40:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 599 transitions. [2022-04-15 11:40:25,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:25,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:25,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:25,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 593 transitions. [2022-04-15 11:40:25,950 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 593 transitions. Word has length 67 [2022-04-15 11:40:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:25,951 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 593 transitions. [2022-04-15 11:40:25,951 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:25,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 593 transitions. [2022-04-15 11:40:26,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 593 transitions. [2022-04-15 11:40:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 11:40:26,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:26,391 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:40:26,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:40:26,392 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:26,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 71682154, now seen corresponding path program 1 times [2022-04-15 11:40:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52865134] [2022-04-15 11:40:26,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:40:26,536 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:40:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1770380569, now seen corresponding path program 1 times [2022-04-15 11:40:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:26,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136515284] [2022-04-15 11:40:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:26,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:26,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {9731#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9725#true} is VALID [2022-04-15 11:40:26,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {9725#true} assume true; {9725#true} is VALID [2022-04-15 11:40:26,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9725#true} {9725#true} #755#return; {9725#true} is VALID [2022-04-15 11:40:26,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {9725#true} call ULTIMATE.init(); {9731#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:40:26,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {9731#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9725#true} is VALID [2022-04-15 11:40:26,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {9725#true} assume true; {9725#true} is VALID [2022-04-15 11:40:26,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9725#true} {9725#true} #755#return; {9725#true} is VALID [2022-04-15 11:40:26,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {9725#true} call #t~ret161 := main(); {9725#true} is VALID [2022-04-15 11:40:26,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {9725#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {9725#true} is VALID [2022-04-15 11:40:26,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {9725#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9725#true} is VALID [2022-04-15 11:40:26,702 INFO L272 TraceCheckUtils]: 7: Hoare triple {9725#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9725#true} is VALID [2022-04-15 11:40:26,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {9725#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {9730#(= 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)))); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} [763] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_10| |v_ssl3_accept_#t~mem88.offset_9|)) (.cse1 (= |v_#memory_$Pointer$.base_282| |v_#memory_$Pointer$.base_276|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_16| |v_ssl3_accept_#t~mem150.offset_14|)) (.cse3 (= v_ssl3_accept_~skip~0_21 v_ssl3_accept_~skip~0_20)) (.cse4 (= |v_ssl3_accept_#t~mem82_17| |v_ssl3_accept_#t~mem82_15|)) (.cse5 (= |v_ssl3_accept_#t~mem151_18| |v_ssl3_accept_#t~mem151_16|)) (.cse6 (= |v_ssl3_accept_#t~mem47_19| |v_ssl3_accept_#t~mem47_17|)) (.cse7 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_15|)) (.cse8 (= |v_ssl3_accept_#t~mem85_17| |v_ssl3_accept_#t~mem85_15|)) (.cse9 (= v_ssl3_accept_~state~0_13 v_ssl3_accept_~state~0_12)) (.cse10 (= |v_#memory_$Pointer$.offset_282| |v_#memory_$Pointer$.offset_276|)) (.cse11 (= |v_ssl3_accept_#t~mem89_10| |v_ssl3_accept_#t~mem89_9|)) (.cse12 (= |v_ssl3_accept_#t~mem150.base_16| |v_ssl3_accept_#t~mem150.base_14|)) (.cse13 (= |v_ssl3_accept_#t~mem46_11| |v_ssl3_accept_#t~mem46_10|)) (.cse14 (= |v_#memory_int_281| |v_#memory_int_276|))) (or (and .cse0 .cse1 (= |v_ssl3_accept_#t~mem88.base_9| |v_ssl3_accept_#t~mem88.base_10|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem48_15| |v_ssl3_accept_#t~mem48_17|) .cse13 (= |v_ssl3_accept_#t~mem83.base_15| |v_ssl3_accept_#t~mem83.base_17|) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem83.base_17| |v_ssl3_accept_#t~mem83.base_15|) .cse5 (= |v_ssl3_accept_#t~mem48_17| |v_ssl3_accept_#t~mem48_15|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_9|) .cse11 .cse12 .cse13 .cse14))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_282|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_17|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_17|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_17|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_19|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_11|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_21, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_281|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_282|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_13} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_15|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_15|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_15|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_16|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_9|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_15|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_17|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_20, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_9|, #memory_int=|v_#memory_int_276|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_12} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} [762] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,708 INFO L290 TraceCheckUtils]: 24: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,717 INFO L290 TraceCheckUtils]: 33: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,717 INFO L290 TraceCheckUtils]: 34: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,718 INFO L290 TraceCheckUtils]: 37: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,719 INFO L290 TraceCheckUtils]: 42: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,721 INFO L290 TraceCheckUtils]: 46: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(15 == ~blastFlag~0); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,722 INFO L290 TraceCheckUtils]: 51: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume !(18 == ~blastFlag~0); {9730#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:26,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {9730#(= ssl3_accept_~blastFlag~0 0)} assume 21 == ~blastFlag~0; {9726#false} is VALID [2022-04-15 11:40:26,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {9726#false} assume !false; {9726#false} is VALID [2022-04-15 11:40:26,724 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-15 11:40:26,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:26,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136515284] [2022-04-15 11:40:26,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136515284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:26,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:26,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:40:29,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:29,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52865134] [2022-04-15 11:40:29,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52865134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:29,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:29,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:40:29,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461394688] [2022-04-15 11:40:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:29,655 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:29,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:29,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:29,720 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-15 11:40:29,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:40:29,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:40:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:40:29,721 INFO L87 Difference]: Start difference. First operand 377 states and 593 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:33,385 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-15 11:40:35,409 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-15 11:40:38,792 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-15 11:40:40,797 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-15 11:40:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:43,306 INFO L93 Difference]: Finished difference Result 565 states and 898 transitions. [2022-04-15 11:40:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:40:43,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 657 transitions. [2022-04-15 11:40:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 657 transitions. [2022-04-15 11:40:43,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 657 transitions. [2022-04-15 11:40:43,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:43,885 INFO L225 Difference]: With dead ends: 565 [2022-04-15 11:40:43,885 INFO L226 Difference]: Without dead ends: 386 [2022-04-15 11:40:43,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:40:43,887 INFO L913 BasicCegarLoop]: 218 mSDtfsCounter, 154 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:43,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 846 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 740 Invalid, 3 Unknown, 341 Unchecked, 8.8s Time] [2022-04-15 11:40:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-04-15 11:40:43,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 377. [2022-04-15 11:40:43,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:43,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:43,902 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:43,903 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:43,913 INFO L93 Difference]: Finished difference Result 386 states and 604 transitions. [2022-04-15 11:40:43,913 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 604 transitions. [2022-04-15 11:40:43,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:43,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:43,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 386 states. [2022-04-15 11:40:43,918 INFO L87 Difference]: Start difference. First operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 386 states. [2022-04-15 11:40:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:43,928 INFO L93 Difference]: Finished difference Result 386 states and 604 transitions. [2022-04-15 11:40:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 604 transitions. [2022-04-15 11:40:43,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:43,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:43,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:43,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 372 states have internal predecessors, (589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 593 transitions. [2022-04-15 11:40:43,941 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 593 transitions. Word has length 67 [2022-04-15 11:40:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:43,942 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 593 transitions. [2022-04-15 11:40:43,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 12 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-15 11:40:43,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 377 states and 593 transitions. [2022-04-15 11:40:44,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 593 transitions. [2022-04-15 11:40:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:40:44,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:44,439 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1] [2022-04-15 11:40:44,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:40:44,439 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -134858733, now seen corresponding path program 1 times [2022-04-15 11:40:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:44,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1935865794] [2022-04-15 11:40:44,459 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:40:44,459 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:40:44,459 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:40:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash -134858733, now seen corresponding path program 2 times [2022-04-15 11:40:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:44,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489228798] [2022-04-15 11:40:44,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:44,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:44,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:44,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {12406#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12399#true} is VALID [2022-04-15 11:40:44,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {12399#true} assume true; {12399#true} is VALID [2022-04-15 11:40:44,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12399#true} {12399#true} #755#return; {12399#true} is VALID [2022-04-15 11:40:44,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {12399#true} call ULTIMATE.init(); {12406#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:40:44,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {12406#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12399#true} is VALID [2022-04-15 11:40:44,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {12399#true} assume true; {12399#true} is VALID [2022-04-15 11:40:44,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12399#true} {12399#true} #755#return; {12399#true} is VALID [2022-04-15 11:40:44,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {12399#true} call #t~ret161 := main(); {12399#true} is VALID [2022-04-15 11:40:44,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {12399#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {12399#true} is VALID [2022-04-15 11:40:44,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {12399#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12399#true} is VALID [2022-04-15 11:40:44,597 INFO L272 TraceCheckUtils]: 7: Hoare triple {12399#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12399#true} is VALID [2022-04-15 11:40:44,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {12399#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:40:44,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {12404#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12405#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-15 11:40:44,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {12405#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {12400#false} is VALID [2022-04-15 11:40:44,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {12400#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {12400#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12400#false} is VALID [2022-04-15 11:40:44,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {12400#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,604 INFO L290 TraceCheckUtils]: 21: Hoare triple {12400#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {12400#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {12400#false} is VALID [2022-04-15 11:40:44,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {12400#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {12400#false} assume 12292 != #t~mem85;havoc #t~mem85; {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {12400#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {12400#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {12400#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {12400#false} ~skip~0 := 0; {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {12400#false} assume !false; {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {12400#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {12400#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {12400#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {12400#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {12400#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {12400#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {12400#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {12400#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {12400#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 39: Hoare triple {12400#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {12400#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,606 INFO L290 TraceCheckUtils]: 41: Hoare triple {12400#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {12400#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {12400#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {12400#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {12400#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {12400#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {12400#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {12400#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {12400#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {12400#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {12400#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {12400#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {12400#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {12400#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {12400#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 56: Hoare triple {12400#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 57: Hoare triple {12400#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {12400#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {12400#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 60: Hoare triple {12400#false} assume 8641 == #t~mem76;havoc #t~mem76; {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 61: Hoare triple {12400#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 62: Hoare triple {12400#false} assume !(9 == ~blastFlag~0); {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 63: Hoare triple {12400#false} assume !(12 == ~blastFlag~0); {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 64: Hoare triple {12400#false} assume !(15 == ~blastFlag~0); {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 65: Hoare triple {12400#false} assume !(18 == ~blastFlag~0); {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 66: Hoare triple {12400#false} assume 21 == ~blastFlag~0; {12400#false} is VALID [2022-04-15 11:40:44,609 INFO L290 TraceCheckUtils]: 67: Hoare triple {12400#false} assume !false; {12400#false} is VALID [2022-04-15 11:40:44,610 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-15 11:40:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489228798] [2022-04-15 11:40:44,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489228798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:44,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:44,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:44,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:40:44,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1935865794] [2022-04-15 11:40:44,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1935865794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:44,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:44,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:40:44,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324033722] [2022-04-15 11:40:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:40:44,630 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-15 11:40:44,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:40:44,631 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-15 11:40:44,693 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-15 11:40:44,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:40:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:44,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:40:44,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:40:44,694 INFO L87 Difference]: Start difference. First operand 377 states and 593 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-15 11:40:46,734 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-15 11:40:48,739 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-15 11:40:52,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:40:54,448 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-15 11:40:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:55,907 INFO L93 Difference]: Finished difference Result 805 states and 1269 transitions. [2022-04-15 11:40:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:40:55,908 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-15 11:40:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:40:55,908 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-15 11:40:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2022-04-15 11:40:55,912 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-15 11:40:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2022-04-15 11:40:55,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 663 transitions. [2022-04-15 11:40:56,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 663 edges. 663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:56,489 INFO L225 Difference]: With dead ends: 805 [2022-04-15 11:40:56,489 INFO L226 Difference]: Without dead ends: 619 [2022-04-15 11:40:56,490 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:40:56,491 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 169 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:40:56,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 416 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 500 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-04-15 11:40:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-15 11:40:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 401. [2022-04-15 11:40:56,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:40:56,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 401 states, 396 states have (on average 1.5707070707070707) internal successors, (622), 396 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:56,510 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 401 states, 396 states have (on average 1.5707070707070707) internal successors, (622), 396 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:56,511 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 401 states, 396 states have (on average 1.5707070707070707) internal successors, (622), 396 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:56,532 INFO L93 Difference]: Finished difference Result 619 states and 962 transitions. [2022-04-15 11:40:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 962 transitions. [2022-04-15 11:40:56,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:56,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:56,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.5707070707070707) internal successors, (622), 396 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 11:40:56,535 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.5707070707070707) internal successors, (622), 396 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 619 states. [2022-04-15 11:40:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:40:56,556 INFO L93 Difference]: Finished difference Result 619 states and 962 transitions. [2022-04-15 11:40:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 962 transitions. [2022-04-15 11:40:56,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:40:56,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:40:56,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:40:56,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:40:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.5707070707070707) internal successors, (622), 396 states have internal predecessors, (622), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:40:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 626 transitions. [2022-04-15 11:40:56,571 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 626 transitions. Word has length 68 [2022-04-15 11:40:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:40:56,571 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 626 transitions. [2022-04-15 11:40:56,572 INFO L479 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-15 11:40:56,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 626 transitions. [2022-04-15 11:40:57,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:40:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 626 transitions. [2022-04-15 11:40:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:40:57,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:40:57,235 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:40:57,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:40:57,235 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:40:57,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:40:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash 564718823, now seen corresponding path program 1 times [2022-04-15 11:40:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:40:57,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740901161] [2022-04-15 11:40:57,397 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:40:57,398 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:40:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1446793895, now seen corresponding path program 1 times [2022-04-15 11:40:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:40:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43627814] [2022-04-15 11:40:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:40:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:40:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:40:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:40:57,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {16067#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16061#true} is VALID [2022-04-15 11:40:57,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {16061#true} assume true; {16061#true} is VALID [2022-04-15 11:40:57,529 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16061#true} {16061#true} #755#return; {16061#true} is VALID [2022-04-15 11:40:57,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {16061#true} call ULTIMATE.init(); {16067#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:40:57,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {16067#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16061#true} is VALID [2022-04-15 11:40:57,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {16061#true} assume true; {16061#true} is VALID [2022-04-15 11:40:57,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16061#true} {16061#true} #755#return; {16061#true} is VALID [2022-04-15 11:40:57,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {16061#true} call #t~ret161 := main(); {16061#true} is VALID [2022-04-15 11:40:57,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {16061#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {16061#true} is VALID [2022-04-15 11:40:57,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {16061#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16061#true} is VALID [2022-04-15 11:40:57,530 INFO L272 TraceCheckUtils]: 7: Hoare triple {16061#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16061#true} is VALID [2022-04-15 11:40:57,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {16061#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {16066#(= 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)))); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} [765] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.offset_323| |v_#memory_$Pointer$.offset_317|)) (.cse1 (= |v_ssl3_accept_#t~mem47_28| |v_ssl3_accept_#t~mem47_26|)) (.cse2 (= |v_ssl3_accept_#t~mem49_10| |v_ssl3_accept_#t~mem49_8|)) (.cse3 (= |v_ssl3_accept_#t~mem83.base_26| |v_ssl3_accept_#t~mem83.base_24|)) (.cse4 (= |v_ssl3_accept_#t~mem83.offset_26| |v_ssl3_accept_#t~mem83.offset_24|)) (.cse5 (= |v_ssl3_accept_#t~mem150.base_24| |v_ssl3_accept_#t~mem150.base_22|)) (.cse6 (= |v_ssl3_accept_#t~mem88.offset_15| |v_ssl3_accept_#t~mem88.offset_14|)) (.cse7 (= |v_ssl3_accept_#t~mem82_26| |v_ssl3_accept_#t~mem82_24|)) (.cse8 (= v_ssl3_accept_~skip~0_27 v_ssl3_accept_~skip~0_26)) (.cse9 (= |v_ssl3_accept_#t~mem88.base_15| |v_ssl3_accept_#t~mem88.base_14|)) (.cse10 (= |v_ssl3_accept_#t~mem89_15| |v_ssl3_accept_#t~mem89_14|)) (.cse11 (= |v_ssl3_accept_#t~mem85_26| |v_ssl3_accept_#t~mem85_24|)) (.cse12 (= |v_ssl3_accept_#t~mem150.offset_24| |v_ssl3_accept_#t~mem150.offset_22|)) (.cse13 (= |v_ssl3_accept_#t~mem151_26| |v_ssl3_accept_#t~mem151_24|)) (.cse14 (= v_ssl3_accept_~state~0_19 v_ssl3_accept_~state~0_18)) (.cse15 (= |v_ssl3_accept_#t~mem48_26| |v_ssl3_accept_#t~mem48_24|)) (.cse16 (= |v_ssl3_accept_#t~mem46_17| |v_ssl3_accept_#t~mem46_16|)) (.cse17 (= |v_#memory_$Pointer$.base_323| |v_#memory_$Pointer$.base_317|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_#memory_int_306| |v_#memory_int_311|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_#memory_int_311| |v_#memory_int_306|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_323|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_26|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_26|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_15|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_26|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_26|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_24|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_28|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_17|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_27, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_15|, #memory_int=|v_#memory_int_311|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_323|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_19} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_317|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_24|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_24|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_24|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_22|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_14|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_24|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_24|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_22|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_26|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_26, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_14|, #memory_int=|v_#memory_int_306|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_317|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} [764] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,539 INFO L290 TraceCheckUtils]: 32: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,539 INFO L290 TraceCheckUtils]: 34: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,540 INFO L290 TraceCheckUtils]: 38: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,541 INFO L290 TraceCheckUtils]: 40: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,543 INFO L290 TraceCheckUtils]: 47: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,544 INFO L290 TraceCheckUtils]: 48: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(15 == ~blastFlag~0); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,545 INFO L290 TraceCheckUtils]: 51: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume !(18 == ~blastFlag~0); {16066#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:40:57,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {16066#(= ssl3_accept_~blastFlag~0 0)} assume 21 == ~blastFlag~0; {16062#false} is VALID [2022-04-15 11:40:57,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {16062#false} assume !false; {16062#false} is VALID [2022-04-15 11:40:57,545 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-15 11:40:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:40:57,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43627814] [2022-04-15 11:40:57,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43627814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:40:57,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:40:57,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:41:00,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:00,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740901161] [2022-04-15 11:41:00,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740901161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:00,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:00,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:41:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346088770] [2022-04-15 11:41:00,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:00,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:00,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:00,688 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-15 11:41:00,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:41:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:41:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:41:00,689 INFO L87 Difference]: Start difference. First operand 401 states and 626 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:05,431 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-15 11:41:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:09,506 INFO L93 Difference]: Finished difference Result 603 states and 950 transitions. [2022-04-15 11:41:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:41:09,507 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 489 transitions. [2022-04-15 11:41:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 489 transitions. [2022-04-15 11:41:09,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 489 transitions. [2022-04-15 11:41:09,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:09,946 INFO L225 Difference]: With dead ends: 603 [2022-04-15 11:41:09,946 INFO L226 Difference]: Without dead ends: 412 [2022-04-15 11:41:09,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:41:09,947 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 9 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:41:09,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 753 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 538 Invalid, 1 Unknown, 159 Unchecked, 3.7s Time] [2022-04-15 11:41:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-04-15 11:41:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 403. [2022-04-15 11:41:09,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:41:09,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states. Second operand has 403 states, 398 states have (on average 1.57035175879397) internal successors, (625), 398 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:09,971 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states. Second operand has 403 states, 398 states have (on average 1.57035175879397) internal successors, (625), 398 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:09,973 INFO L87 Difference]: Start difference. First operand 412 states. Second operand has 403 states, 398 states have (on average 1.57035175879397) internal successors, (625), 398 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:09,984 INFO L93 Difference]: Finished difference Result 412 states and 639 transitions. [2022-04-15 11:41:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 639 transitions. [2022-04-15 11:41:09,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:09,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:09,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 403 states, 398 states have (on average 1.57035175879397) internal successors, (625), 398 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 412 states. [2022-04-15 11:41:09,987 INFO L87 Difference]: Start difference. First operand has 403 states, 398 states have (on average 1.57035175879397) internal successors, (625), 398 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 412 states. [2022-04-15 11:41:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:09,999 INFO L93 Difference]: Finished difference Result 412 states and 639 transitions. [2022-04-15 11:41:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 639 transitions. [2022-04-15 11:41:10,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:10,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:10,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:41:10,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:41:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 398 states have (on average 1.57035175879397) internal successors, (625), 398 states have internal predecessors, (625), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 629 transitions. [2022-04-15 11:41:10,014 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 629 transitions. Word has length 68 [2022-04-15 11:41:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:41:10,015 INFO L478 AbstractCegarLoop]: Abstraction has 403 states and 629 transitions. [2022-04-15 11:41:10,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:10,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 403 states and 629 transitions. [2022-04-15 11:41:10,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 629 transitions. [2022-04-15 11:41:10,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:41:10,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:41:10,870 INFO L499 BasicCegarLoop]: 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, 1, 1, 1] [2022-04-15 11:41:10,870 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:41:10,871 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:41:10,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:41:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1791086427, now seen corresponding path program 1 times [2022-04-15 11:41:10,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:10,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905120843] [2022-04-15 11:41:11,068 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:41:11,069 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:41:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -369001063, now seen corresponding path program 1 times [2022-04-15 11:41:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:41:11,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199626000] [2022-04-15 11:41:11,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:41:11,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:41:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:41:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:11,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {18922#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18916#true} is VALID [2022-04-15 11:41:11,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {18916#true} assume true; {18916#true} is VALID [2022-04-15 11:41:11,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18916#true} {18916#true} #755#return; {18916#true} is VALID [2022-04-15 11:41:11,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {18916#true} call ULTIMATE.init(); {18922#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:41:11,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {18922#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18916#true} is VALID [2022-04-15 11:41:11,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {18916#true} assume true; {18916#true} is VALID [2022-04-15 11:41:11,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18916#true} {18916#true} #755#return; {18916#true} is VALID [2022-04-15 11:41:11,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {18916#true} call #t~ret161 := main(); {18916#true} is VALID [2022-04-15 11:41:11,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {18916#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {18916#true} is VALID [2022-04-15 11:41:11,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {18916#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18916#true} is VALID [2022-04-15 11:41:11,238 INFO L272 TraceCheckUtils]: 7: Hoare triple {18916#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18916#true} is VALID [2022-04-15 11:41:11,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {18916#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {18921#(= 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)))); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} [767] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_33| |v_ssl3_accept_#t~mem82_31|)) (.cse1 (= |v_ssl3_accept_#t~mem89_20| |v_ssl3_accept_#t~mem89_19|)) (.cse2 (= |v_ssl3_accept_#t~mem85_33| |v_ssl3_accept_#t~mem85_31|)) (.cse3 (= v_ssl3_accept_~skip~0_32 v_ssl3_accept_~skip~0_31)) (.cse4 (= |v_ssl3_accept_#t~mem151_32| |v_ssl3_accept_#t~mem151_30|)) (.cse5 (= |v_#memory_$Pointer$.offset_343| |v_#memory_$Pointer$.offset_337|)) (.cse6 (= |v_ssl3_accept_#t~mem83.base_33| |v_ssl3_accept_#t~mem83.base_31|)) (.cse7 (= |v_#memory_$Pointer$.base_343| |v_#memory_$Pointer$.base_337|)) (.cse8 (= |v_ssl3_accept_#t~mem46_22| |v_ssl3_accept_#t~mem46_21|)) (.cse9 (= |v_ssl3_accept_#t~mem47_35| |v_ssl3_accept_#t~mem47_33|)) (.cse10 (= v_ssl3_accept_~state~0_24 v_ssl3_accept_~state~0_23)) (.cse11 (= |v_ssl3_accept_#t~mem83.offset_33| |v_ssl3_accept_#t~mem83.offset_31|)) (.cse12 (= |v_ssl3_accept_#t~mem48_33| |v_ssl3_accept_#t~mem48_31|))) (or (and .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem49_17| |v_ssl3_accept_#t~mem49_15|) .cse3 .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_28|) .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_28|) (= |v_#memory_int_330| |v_#memory_int_325|) .cse11 (= |v_ssl3_accept_#t~mem88.base_20| |v_ssl3_accept_#t~mem88.base_19|) .cse12 (= |v_ssl3_accept_#t~mem88.offset_20| |v_ssl3_accept_#t~mem88.offset_19|)) (and (= |v_ssl3_accept_#t~mem150.offset_28| |v_ssl3_accept_#t~mem150.offset_30|) .cse0 (= |v_#memory_int_325| |v_#memory_int_330|) .cse1 .cse2 (= |v_ssl3_accept_#t~mem150.base_28| |v_ssl3_accept_#t~mem150.base_30|) (= |v_ssl3_accept_#t~mem88.base_19| |v_ssl3_accept_#t~mem88.base_20|) .cse3 .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem88.offset_19| |v_ssl3_accept_#t~mem88.offset_20|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem49_15| |v_ssl3_accept_#t~mem49_17|) .cse12))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_343|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_33|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_33|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_30|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_20|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_33|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_33|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_35|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_22|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_32, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_20|, #memory_int=|v_#memory_int_330|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_343|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_24} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_337|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_31|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_31|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_19|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_31|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_33|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_21|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_31, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_19|, #memory_int=|v_#memory_int_325|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_19|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_337|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_23} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} [766] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,247 INFO L290 TraceCheckUtils]: 28: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,248 INFO L290 TraceCheckUtils]: 30: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,248 INFO L290 TraceCheckUtils]: 31: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,250 INFO L290 TraceCheckUtils]: 36: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,252 INFO L290 TraceCheckUtils]: 41: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,252 INFO L290 TraceCheckUtils]: 42: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,252 INFO L290 TraceCheckUtils]: 43: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,253 INFO L290 TraceCheckUtils]: 44: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,253 INFO L290 TraceCheckUtils]: 45: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,255 INFO L290 TraceCheckUtils]: 49: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,255 INFO L290 TraceCheckUtils]: 50: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(15 == ~blastFlag~0); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,255 INFO L290 TraceCheckUtils]: 51: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume !(18 == ~blastFlag~0); {18921#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:41:11,256 INFO L290 TraceCheckUtils]: 52: Hoare triple {18921#(= ssl3_accept_~blastFlag~0 0)} assume 21 == ~blastFlag~0; {18917#false} is VALID [2022-04-15 11:41:11,256 INFO L290 TraceCheckUtils]: 53: Hoare triple {18917#false} assume !false; {18917#false} is VALID [2022-04-15 11:41:11,256 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-15 11:41:11,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:41:11,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199626000] [2022-04-15 11:41:11,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199626000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:11,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:11,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:41:14,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:14,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905120843] [2022-04-15 11:41:14,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905120843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:14,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:14,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:41:14,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661445320] [2022-04-15 11:41:14,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:14,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:14,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:14,544 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-15 11:41:14,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:41:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:41:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:41:14,545 INFO L87 Difference]: Start difference. First operand 403 states and 629 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:16,882 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-15 11:41:19,605 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-15 11:41:21,610 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-15 11:41:23,634 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-15 11:41:25,655 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-15 11:41:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:28,779 INFO L93 Difference]: Finished difference Result 802 states and 1273 transitions. [2022-04-15 11:41:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:41:28,779 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 697 transitions. [2022-04-15 11:41:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 697 transitions. [2022-04-15 11:41:28,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 697 transitions. [2022-04-15 11:41:29,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 697 edges. 697 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:29,292 INFO L225 Difference]: With dead ends: 802 [2022-04-15 11:41:29,292 INFO L226 Difference]: Without dead ends: 611 [2022-04-15 11:41:29,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:41:29,293 INFO L913 BasicCegarLoop]: 206 mSDtfsCounter, 166 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 30 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:41:29,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 840 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 934 Invalid, 3 Unknown, 200 Unchecked, 10.2s Time] [2022-04-15 11:41:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-15 11:41:29,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2022-04-15 11:41:29,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:41:29,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 611 states. Second operand has 589 states, 584 states have (on average 1.5565068493150684) internal successors, (909), 584 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:29,320 INFO L74 IsIncluded]: Start isIncluded. First operand 611 states. Second operand has 589 states, 584 states have (on average 1.5565068493150684) internal successors, (909), 584 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:29,321 INFO L87 Difference]: Start difference. First operand 611 states. Second operand has 589 states, 584 states have (on average 1.5565068493150684) internal successors, (909), 584 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:29,339 INFO L93 Difference]: Finished difference Result 611 states and 940 transitions. [2022-04-15 11:41:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 940 transitions. [2022-04-15 11:41:29,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:29,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:29,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 589 states, 584 states have (on average 1.5565068493150684) internal successors, (909), 584 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 611 states. [2022-04-15 11:41:29,342 INFO L87 Difference]: Start difference. First operand has 589 states, 584 states have (on average 1.5565068493150684) internal successors, (909), 584 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 611 states. [2022-04-15 11:41:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:29,361 INFO L93 Difference]: Finished difference Result 611 states and 940 transitions. [2022-04-15 11:41:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 940 transitions. [2022-04-15 11:41:29,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:29,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:29,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:41:29,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:41:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 584 states have (on average 1.5565068493150684) internal successors, (909), 584 states have internal predecessors, (909), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 913 transitions. [2022-04-15 11:41:29,386 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 913 transitions. Word has length 68 [2022-04-15 11:41:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:41:29,386 INFO L478 AbstractCegarLoop]: Abstraction has 589 states and 913 transitions. [2022-04-15 11:41:29,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 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-15 11:41:29,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 589 states and 913 transitions. [2022-04-15 11:41:30,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 913 edges. 913 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 913 transitions. [2022-04-15 11:41:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 11:41:30,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:41:30,780 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-15 11:41:30,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:41:30,780 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:41:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:41:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1131219641, now seen corresponding path program 1 times [2022-04-15 11:41:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:30,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1732626787] [2022-04-15 11:41:30,797 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:41:30,798 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:41:30,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:41:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1131219641, now seen corresponding path program 2 times [2022-04-15 11:41:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:41:30,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545573336] [2022-04-15 11:41:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:41:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:41:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:41:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:30,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {22946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22939#true} is VALID [2022-04-15 11:41:30,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {22939#true} assume true; {22939#true} is VALID [2022-04-15 11:41:30,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22939#true} {22939#true} #755#return; {22939#true} is VALID [2022-04-15 11:41:30,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {22939#true} call ULTIMATE.init(); {22946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:41:30,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {22946#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22939#true} is VALID [2022-04-15 11:41:30,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {22939#true} assume true; {22939#true} is VALID [2022-04-15 11:41:30,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22939#true} {22939#true} #755#return; {22939#true} is VALID [2022-04-15 11:41:30,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {22939#true} call #t~ret161 := main(); {22939#true} is VALID [2022-04-15 11:41:30,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {22939#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {22939#true} is VALID [2022-04-15 11:41:30,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {22939#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L272 TraceCheckUtils]: 7: Hoare triple {22939#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {22939#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {22939#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {22939#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {22939#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {22939#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {22939#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {22939#true} assume !false; {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {22939#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {22939#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {22939#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {22939#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {22939#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {22939#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {22939#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {22939#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {22939#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {22939#true} assume 8464 == #t~mem55;havoc #t~mem55; {22939#true} is VALID [2022-04-15 11:41:30,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {22939#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {22939#true} is VALID [2022-04-15 11:41:30,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {22939#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22939#true} is VALID [2022-04-15 11:41:30,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {22939#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,989 INFO L290 TraceCheckUtils]: 50: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,990 INFO L290 TraceCheckUtils]: 52: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,991 INFO L290 TraceCheckUtils]: 54: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,991 INFO L290 TraceCheckUtils]: 55: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,992 INFO L290 TraceCheckUtils]: 57: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:41:30,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {22944#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {22945#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-15 11:41:30,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {22945#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {22940#false} is VALID [2022-04-15 11:41:30,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {22940#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22940#false} is VALID [2022-04-15 11:41:30,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {22940#false} assume !(9 == ~blastFlag~0); {22940#false} is VALID [2022-04-15 11:41:30,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {22940#false} assume !(12 == ~blastFlag~0); {22940#false} is VALID [2022-04-15 11:41:30,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {22940#false} assume !(15 == ~blastFlag~0); {22940#false} is VALID [2022-04-15 11:41:30,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {22940#false} assume !(18 == ~blastFlag~0); {22940#false} is VALID [2022-04-15 11:41:30,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {22940#false} assume 21 == ~blastFlag~0; {22940#false} is VALID [2022-04-15 11:41:30,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {22940#false} assume !false; {22940#false} is VALID [2022-04-15 11:41:30,996 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-15 11:41:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:41:30,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545573336] [2022-04-15 11:41:30,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545573336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:30,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:30,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:30,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:30,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1732626787] [2022-04-15 11:41:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1732626787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:30,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:30,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896689769] [2022-04-15 11:41:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:30,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 11:41:30,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:30,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:31,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:31,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:41:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:31,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:41:31,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:41:31,056 INFO L87 Difference]: Start difference. First operand 589 states and 913 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:40,614 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-15 11:41:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:43,376 INFO L93 Difference]: Finished difference Result 1490 states and 2302 transitions. [2022-04-15 11:41:43,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:41:43,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 11:41:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2022-04-15 11:41:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2022-04-15 11:41:43,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 662 transitions. [2022-04-15 11:41:43,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 662 edges. 662 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:43,889 INFO L225 Difference]: With dead ends: 1490 [2022-04-15 11:41:43,889 INFO L226 Difference]: Without dead ends: 927 [2022-04-15 11:41:43,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:41:43,891 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 141 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:41:43,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 446 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:41:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-04-15 11:41:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 673. [2022-04-15 11:41:43,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:41:43,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 927 states. Second operand has 673 states, 668 states have (on average 1.6077844311377245) internal successors, (1074), 668 states have internal predecessors, (1074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:43,936 INFO L74 IsIncluded]: Start isIncluded. First operand 927 states. Second operand has 673 states, 668 states have (on average 1.6077844311377245) internal successors, (1074), 668 states have internal predecessors, (1074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:43,937 INFO L87 Difference]: Start difference. First operand 927 states. Second operand has 673 states, 668 states have (on average 1.6077844311377245) internal successors, (1074), 668 states have internal predecessors, (1074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:43,977 INFO L93 Difference]: Finished difference Result 927 states and 1421 transitions. [2022-04-15 11:41:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1421 transitions. [2022-04-15 11:41:43,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:43,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:43,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 673 states, 668 states have (on average 1.6077844311377245) internal successors, (1074), 668 states have internal predecessors, (1074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 927 states. [2022-04-15 11:41:43,981 INFO L87 Difference]: Start difference. First operand has 673 states, 668 states have (on average 1.6077844311377245) internal successors, (1074), 668 states have internal predecessors, (1074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 927 states. [2022-04-15 11:41:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:44,018 INFO L93 Difference]: Finished difference Result 927 states and 1421 transitions. [2022-04-15 11:41:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1421 transitions. [2022-04-15 11:41:44,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:44,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:44,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:41:44,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:41:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 668 states have (on average 1.6077844311377245) internal successors, (1074), 668 states have internal predecessors, (1074), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1078 transitions. [2022-04-15 11:41:44,044 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1078 transitions. Word has length 70 [2022-04-15 11:41:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:41:44,045 INFO L478 AbstractCegarLoop]: Abstraction has 673 states and 1078 transitions. [2022-04-15 11:41:44,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:44,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 673 states and 1078 transitions. [2022-04-15 11:41:45,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1078 edges. 1078 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1078 transitions. [2022-04-15 11:41:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 11:41:45,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:41:45,906 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:41:45,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:41:45,907 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:41:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:41:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -344868736, now seen corresponding path program 1 times [2022-04-15 11:41:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:45,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2133356091] [2022-04-15 11:41:45,964 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:41:45,964 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:41:45,964 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:41:45,964 INFO L85 PathProgramCache]: Analyzing trace with hash -344868736, now seen corresponding path program 2 times [2022-04-15 11:41:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:41:45,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84535657] [2022-04-15 11:41:45,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:41:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:41:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:41:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:46,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {29138#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29131#true} is VALID [2022-04-15 11:41:46,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {29131#true} assume true; {29131#true} is VALID [2022-04-15 11:41:46,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29131#true} {29131#true} #755#return; {29131#true} is VALID [2022-04-15 11:41:46,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {29131#true} call ULTIMATE.init(); {29138#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:41:46,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {29138#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29131#true} is VALID [2022-04-15 11:41:46,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {29131#true} assume true; {29131#true} is VALID [2022-04-15 11:41:46,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29131#true} {29131#true} #755#return; {29131#true} is VALID [2022-04-15 11:41:46,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {29131#true} call #t~ret161 := main(); {29131#true} is VALID [2022-04-15 11:41:46,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {29131#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {29131#true} is VALID [2022-04-15 11:41:46,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {29131#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,140 INFO L272 TraceCheckUtils]: 7: Hoare triple {29131#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {29131#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {29131#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {29131#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {29131#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {29131#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {29131#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {29131#true} assume !false; {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {29131#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {29131#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {29131#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {29131#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {29131#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {29131#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {29131#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {29131#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {29131#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {29131#true} assume 8464 == #t~mem55;havoc #t~mem55; {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {29131#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {29131#true} is VALID [2022-04-15 11:41:46,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {29131#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {29131#true} is VALID [2022-04-15 11:41:46,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {29131#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,147 INFO L290 TraceCheckUtils]: 36: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,149 INFO L290 TraceCheckUtils]: 39: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,149 INFO L290 TraceCheckUtils]: 40: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,150 INFO L290 TraceCheckUtils]: 41: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:46,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {29136#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29137#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:41:46,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {29137#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,151 INFO L290 TraceCheckUtils]: 45: Hoare triple {29132#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,151 INFO L290 TraceCheckUtils]: 46: Hoare triple {29132#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,151 INFO L290 TraceCheckUtils]: 47: Hoare triple {29132#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,151 INFO L290 TraceCheckUtils]: 48: Hoare triple {29132#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,151 INFO L290 TraceCheckUtils]: 49: Hoare triple {29132#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {29132#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {29132#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {29132#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {29132#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {29132#false} assume 8448 == #t~mem68;havoc #t~mem68; {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 55: Hoare triple {29132#false} assume !(~num1~0 > 0); {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {29132#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {29132#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {29132#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {29132#false} is VALID [2022-04-15 11:41:46,152 INFO L290 TraceCheckUtils]: 59: Hoare triple {29132#false} ~skip~0 := 0; {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {29132#false} assume !false; {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {29132#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {29132#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 63: Hoare triple {29132#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {29132#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {29132#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {29132#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {29132#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 68: Hoare triple {29132#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 69: Hoare triple {29132#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,153 INFO L290 TraceCheckUtils]: 70: Hoare triple {29132#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {29132#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {29132#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {29132#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {29132#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {29132#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {29132#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {29132#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {29132#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 79: Hoare triple {29132#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,154 INFO L290 TraceCheckUtils]: 80: Hoare triple {29132#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {29132#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {29132#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {29132#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {29132#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {29132#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {29132#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {29132#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {29132#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {29132#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 90: Hoare triple {29132#false} assume 8640 == #t~mem75;havoc #t~mem75; {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 91: Hoare triple {29132#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 92: Hoare triple {29132#false} assume !(9 == ~blastFlag~0); {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 93: Hoare triple {29132#false} assume !(12 == ~blastFlag~0); {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 94: Hoare triple {29132#false} assume !(15 == ~blastFlag~0); {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 95: Hoare triple {29132#false} assume !(18 == ~blastFlag~0); {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 96: Hoare triple {29132#false} assume 21 == ~blastFlag~0; {29132#false} is VALID [2022-04-15 11:41:46,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {29132#false} assume !false; {29132#false} is VALID [2022-04-15 11:41:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 11:41:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:41:46,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84535657] [2022-04-15 11:41:46,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84535657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:46,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:46,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:46,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2133356091] [2022-04-15 11:41:46,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2133356091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:46,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:46,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:46,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139772118] [2022-04-15 11:41:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:46,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 11:41:46,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:46,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:46,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:46,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:41:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:41:46,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:41:46,237 INFO L87 Difference]: Start difference. First operand 673 states and 1078 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:48,291 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-15 11:41:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:51,307 INFO L93 Difference]: Finished difference Result 935 states and 1508 transitions. [2022-04-15 11:41:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:41:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 11:41:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-15 11:41:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-15 11:41:51,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 524 transitions. [2022-04-15 11:41:51,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:51,699 INFO L225 Difference]: With dead ends: 935 [2022-04-15 11:41:51,699 INFO L226 Difference]: Without dead ends: 716 [2022-04-15 11:41:51,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:41:51,700 INFO L913 BasicCegarLoop]: 265 mSDtfsCounter, 33 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:41:51,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 667 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 472 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 11:41:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-04-15 11:41:51,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 695. [2022-04-15 11:41:51,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:41:51,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 716 states. Second operand has 695 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 690 states have internal predecessors, (1111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:51,736 INFO L74 IsIncluded]: Start isIncluded. First operand 716 states. Second operand has 695 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 690 states have internal predecessors, (1111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:51,737 INFO L87 Difference]: Start difference. First operand 716 states. Second operand has 695 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 690 states have internal predecessors, (1111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:51,756 INFO L93 Difference]: Finished difference Result 716 states and 1142 transitions. [2022-04-15 11:41:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1142 transitions. [2022-04-15 11:41:51,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:51,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:51,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 690 states have internal predecessors, (1111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 716 states. [2022-04-15 11:41:51,760 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 690 states have internal predecessors, (1111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 716 states. [2022-04-15 11:41:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:51,783 INFO L93 Difference]: Finished difference Result 716 states and 1142 transitions. [2022-04-15 11:41:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1142 transitions. [2022-04-15 11:41:51,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:41:51,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:41:51,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:41:51,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:41:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 690 states have internal predecessors, (1111), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1115 transitions. [2022-04-15 11:41:51,815 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1115 transitions. Word has length 98 [2022-04-15 11:41:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:41:51,815 INFO L478 AbstractCegarLoop]: Abstraction has 695 states and 1115 transitions. [2022-04-15 11:41:51,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:41:51,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 695 states and 1115 transitions. [2022-04-15 11:41:54,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1115 edges. 1115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:41:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1115 transitions. [2022-04-15 11:41:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 11:41:54,315 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:41:54,315 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:41:54,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:41:54,316 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:41:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:41:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 747722650, now seen corresponding path program 1 times [2022-04-15 11:41:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:54,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144103166] [2022-04-15 11:41:54,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:41:54,384 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:41:54,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:41:54,385 INFO L85 PathProgramCache]: Analyzing trace with hash 747722650, now seen corresponding path program 2 times [2022-04-15 11:41:54,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:41:54,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996825140] [2022-04-15 11:41:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:41:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:41:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:54,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:41:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:41:54,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {33842#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33835#true} is VALID [2022-04-15 11:41:54,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {33835#true} assume true; {33835#true} is VALID [2022-04-15 11:41:54,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33835#true} {33835#true} #755#return; {33835#true} is VALID [2022-04-15 11:41:54,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {33835#true} call ULTIMATE.init(); {33842#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:41:54,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {33842#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33835#true} is VALID [2022-04-15 11:41:54,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {33835#true} assume true; {33835#true} is VALID [2022-04-15 11:41:54,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33835#true} {33835#true} #755#return; {33835#true} is VALID [2022-04-15 11:41:54,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {33835#true} call #t~ret161 := main(); {33835#true} is VALID [2022-04-15 11:41:54,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {33835#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {33835#true} is VALID [2022-04-15 11:41:54,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {33835#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,568 INFO L272 TraceCheckUtils]: 7: Hoare triple {33835#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {33835#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {33835#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {33835#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {33835#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {33835#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {33835#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {33835#true} assume !false; {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {33835#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {33835#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {33835#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {33835#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {33835#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {33835#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {33835#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {33835#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {33835#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {33835#true} assume 8464 == #t~mem55;havoc #t~mem55; {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {33835#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {33835#true} is VALID [2022-04-15 11:41:54,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {33835#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33835#true} is VALID [2022-04-15 11:41:54,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {33835#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:41:54,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {33840#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33841#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-15 11:41:54,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {33841#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {33836#false} is VALID [2022-04-15 11:41:54,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {33836#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {33836#false} is VALID [2022-04-15 11:41:54,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {33836#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 41: Hoare triple {33836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {33836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {33836#false} ~skip~0 := 0; {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {33836#false} assume !false; {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {33836#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {33836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {33836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {33836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {33836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 50: Hoare triple {33836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,578 INFO L290 TraceCheckUtils]: 51: Hoare triple {33836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 52: Hoare triple {33836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 53: Hoare triple {33836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 54: Hoare triple {33836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 55: Hoare triple {33836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {33836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 57: Hoare triple {33836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 58: Hoare triple {33836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 59: Hoare triple {33836#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {33836#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 61: Hoare triple {33836#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {33836#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 63: Hoare triple {33836#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 64: Hoare triple {33836#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 65: Hoare triple {33836#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 66: Hoare triple {33836#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 67: Hoare triple {33836#false} assume 8448 == #t~mem68;havoc #t~mem68; {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 68: Hoare triple {33836#false} assume !(~num1~0 > 0); {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 69: Hoare triple {33836#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 70: Hoare triple {33836#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 71: Hoare triple {33836#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33836#false} is VALID [2022-04-15 11:41:54,580 INFO L290 TraceCheckUtils]: 72: Hoare triple {33836#false} ~skip~0 := 0; {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 73: Hoare triple {33836#false} assume !false; {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 74: Hoare triple {33836#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 75: Hoare triple {33836#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 76: Hoare triple {33836#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 77: Hoare triple {33836#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 78: Hoare triple {33836#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 79: Hoare triple {33836#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 80: Hoare triple {33836#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 81: Hoare triple {33836#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 82: Hoare triple {33836#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,581 INFO L290 TraceCheckUtils]: 83: Hoare triple {33836#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 84: Hoare triple {33836#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 85: Hoare triple {33836#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 86: Hoare triple {33836#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 87: Hoare triple {33836#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 88: Hoare triple {33836#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 89: Hoare triple {33836#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 90: Hoare triple {33836#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 91: Hoare triple {33836#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 92: Hoare triple {33836#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,582 INFO L290 TraceCheckUtils]: 93: Hoare triple {33836#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 94: Hoare triple {33836#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 95: Hoare triple {33836#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 96: Hoare triple {33836#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 97: Hoare triple {33836#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 98: Hoare triple {33836#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 99: Hoare triple {33836#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 100: Hoare triple {33836#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 101: Hoare triple {33836#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,583 INFO L290 TraceCheckUtils]: 102: Hoare triple {33836#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 103: Hoare triple {33836#false} assume 8640 == #t~mem75;havoc #t~mem75; {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 104: Hoare triple {33836#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 105: Hoare triple {33836#false} assume !(9 == ~blastFlag~0); {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 106: Hoare triple {33836#false} assume !(12 == ~blastFlag~0); {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 107: Hoare triple {33836#false} assume !(15 == ~blastFlag~0); {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 108: Hoare triple {33836#false} assume !(18 == ~blastFlag~0); {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 109: Hoare triple {33836#false} assume 21 == ~blastFlag~0; {33836#false} is VALID [2022-04-15 11:41:54,584 INFO L290 TraceCheckUtils]: 110: Hoare triple {33836#false} assume !false; {33836#false} is VALID [2022-04-15 11:41:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:41:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:41:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996825140] [2022-04-15 11:41:54,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996825140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:54,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:54,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:54,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:41:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144103166] [2022-04-15 11:41:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144103166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:41:54,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:41:54,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:41:54,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617466426] [2022-04-15 11:41:54,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:41:54,586 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 111 [2022-04-15 11:41:54,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:41:54,587 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-15 11:41:54,681 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-15 11:41:54,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:41:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:41:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:41:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:41:54,682 INFO L87 Difference]: Start difference. First operand 695 states and 1115 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-15 11:41:56,739 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-15 11:41:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:41:59,948 INFO L93 Difference]: Finished difference Result 957 states and 1544 transitions. [2022-04-15 11:41:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:41:59,948 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 111 [2022-04-15 11:41:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:41:59,948 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-15 11:41:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2022-04-15 11:41:59,950 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-15 11:41:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 523 transitions. [2022-04-15 11:41:59,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 523 transitions. [2022-04-15 11:42:00,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:00,323 INFO L225 Difference]: With dead ends: 957 [2022-04-15 11:42:00,323 INFO L226 Difference]: Without dead ends: 716 [2022-04-15 11:42:00,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:42:00,327 INFO L913 BasicCegarLoop]: 265 mSDtfsCounter, 38 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:00,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 667 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 469 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 11:42:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2022-04-15 11:42:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 695. [2022-04-15 11:42:00,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:00,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 716 states. Second operand has 695 states, 690 states have (on average 1.608695652173913) internal successors, (1110), 690 states have internal predecessors, (1110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:00,363 INFO L74 IsIncluded]: Start isIncluded. First operand 716 states. Second operand has 695 states, 690 states have (on average 1.608695652173913) internal successors, (1110), 690 states have internal predecessors, (1110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:00,364 INFO L87 Difference]: Start difference. First operand 716 states. Second operand has 695 states, 690 states have (on average 1.608695652173913) internal successors, (1110), 690 states have internal predecessors, (1110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:00,387 INFO L93 Difference]: Finished difference Result 716 states and 1141 transitions. [2022-04-15 11:42:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1141 transitions. [2022-04-15 11:42:00,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:00,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:00,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 695 states, 690 states have (on average 1.608695652173913) internal successors, (1110), 690 states have internal predecessors, (1110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 716 states. [2022-04-15 11:42:00,390 INFO L87 Difference]: Start difference. First operand has 695 states, 690 states have (on average 1.608695652173913) internal successors, (1110), 690 states have internal predecessors, (1110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 716 states. [2022-04-15 11:42:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:00,414 INFO L93 Difference]: Finished difference Result 716 states and 1141 transitions. [2022-04-15 11:42:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1141 transitions. [2022-04-15 11:42:00,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:00,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:00,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:00,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 690 states have (on average 1.608695652173913) internal successors, (1110), 690 states have internal predecessors, (1110), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1114 transitions. [2022-04-15 11:42:00,454 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1114 transitions. Word has length 111 [2022-04-15 11:42:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:00,455 INFO L478 AbstractCegarLoop]: Abstraction has 695 states and 1114 transitions. [2022-04-15 11:42:00,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:00,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 695 states and 1114 transitions. [2022-04-15 11:42:02,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1114 edges. 1114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1114 transitions. [2022-04-15 11:42:02,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 11:42:02,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:02,504 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:02,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:42:02,504 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1136152900, now seen corresponding path program 1 times [2022-04-15 11:42:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061134667] [2022-04-15 11:42:02,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:02,575 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:02,575 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1136152900, now seen corresponding path program 2 times [2022-04-15 11:42:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:02,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636494048] [2022-04-15 11:42:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:02,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:02,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {38590#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38583#true} is VALID [2022-04-15 11:42:02,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {38583#true} assume true; {38583#true} is VALID [2022-04-15 11:42:02,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38583#true} {38583#true} #755#return; {38583#true} is VALID [2022-04-15 11:42:02,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {38583#true} call ULTIMATE.init(); {38590#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:02,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {38590#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {38583#true} is VALID [2022-04-15 11:42:02,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {38583#true} assume true; {38583#true} is VALID [2022-04-15 11:42:02,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38583#true} {38583#true} #755#return; {38583#true} is VALID [2022-04-15 11:42:02,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {38583#true} call #t~ret161 := main(); {38583#true} is VALID [2022-04-15 11:42:02,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {38583#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {38583#true} is VALID [2022-04-15 11:42:02,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {38583#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L272 TraceCheckUtils]: 7: Hoare triple {38583#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {38583#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {38583#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {38583#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {38583#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {38583#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {38583#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {38583#true} assume !false; {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {38583#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,775 INFO L290 TraceCheckUtils]: 16: Hoare triple {38583#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {38583#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {38583#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {38583#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {38583#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {38583#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {38583#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {38583#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 24: Hoare triple {38583#true} assume 8464 == #t~mem55;havoc #t~mem55; {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {38583#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {38583#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38583#true} is VALID [2022-04-15 11:42:02,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {38583#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {38583#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {38583#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {38583#true} ~skip~0 := 0; {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {38583#true} assume !false; {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 32: Hoare triple {38583#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 33: Hoare triple {38583#true} assume 12292 == #t~mem47;havoc #t~mem47; {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {38583#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {38583#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 36: Hoare triple {38583#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {38583#true} is VALID [2022-04-15 11:42:02,777 INFO L290 TraceCheckUtils]: 37: Hoare triple {38583#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,778 INFO L290 TraceCheckUtils]: 38: Hoare triple {38583#true} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,778 INFO L290 TraceCheckUtils]: 39: Hoare triple {38583#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {38583#true} is VALID [2022-04-15 11:42:02,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {38583#true} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {38583#true} is VALID [2022-04-15 11:42:02,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {38583#true} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,780 INFO L290 TraceCheckUtils]: 42: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,780 INFO L290 TraceCheckUtils]: 43: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,781 INFO L290 TraceCheckUtils]: 45: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,783 INFO L290 TraceCheckUtils]: 49: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,783 INFO L290 TraceCheckUtils]: 50: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:02,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {38588#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38589#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-15 11:42:02,784 INFO L290 TraceCheckUtils]: 52: Hoare triple {38589#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,784 INFO L290 TraceCheckUtils]: 53: Hoare triple {38584#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,784 INFO L290 TraceCheckUtils]: 54: Hoare triple {38584#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,784 INFO L290 TraceCheckUtils]: 55: Hoare triple {38584#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {38584#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {38584#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {38584#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {38584#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {38584#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {38584#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {38584#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {38584#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {38584#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {38584#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {38584#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,785 INFO L290 TraceCheckUtils]: 67: Hoare triple {38584#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {38584#false} assume 8448 == #t~mem68;havoc #t~mem68; {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 69: Hoare triple {38584#false} assume !(~num1~0 > 0); {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 70: Hoare triple {38584#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {38584#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {38584#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {38584#false} ~skip~0 := 0; {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 74: Hoare triple {38584#false} assume !false; {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {38584#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {38584#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {38584#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,786 INFO L290 TraceCheckUtils]: 78: Hoare triple {38584#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 79: Hoare triple {38584#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 80: Hoare triple {38584#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 81: Hoare triple {38584#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 82: Hoare triple {38584#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {38584#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 84: Hoare triple {38584#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {38584#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 86: Hoare triple {38584#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 87: Hoare triple {38584#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,787 INFO L290 TraceCheckUtils]: 88: Hoare triple {38584#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {38584#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 90: Hoare triple {38584#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 91: Hoare triple {38584#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 92: Hoare triple {38584#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {38584#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 94: Hoare triple {38584#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 95: Hoare triple {38584#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 96: Hoare triple {38584#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 97: Hoare triple {38584#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 98: Hoare triple {38584#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,788 INFO L290 TraceCheckUtils]: 99: Hoare triple {38584#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 100: Hoare triple {38584#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 101: Hoare triple {38584#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 102: Hoare triple {38584#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 103: Hoare triple {38584#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 104: Hoare triple {38584#false} assume 8640 == #t~mem75;havoc #t~mem75; {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 105: Hoare triple {38584#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 106: Hoare triple {38584#false} assume !(9 == ~blastFlag~0); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 107: Hoare triple {38584#false} assume !(12 == ~blastFlag~0); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 108: Hoare triple {38584#false} assume !(15 == ~blastFlag~0); {38584#false} is VALID [2022-04-15 11:42:02,789 INFO L290 TraceCheckUtils]: 109: Hoare triple {38584#false} assume !(18 == ~blastFlag~0); {38584#false} is VALID [2022-04-15 11:42:02,790 INFO L290 TraceCheckUtils]: 110: Hoare triple {38584#false} assume 21 == ~blastFlag~0; {38584#false} is VALID [2022-04-15 11:42:02,790 INFO L290 TraceCheckUtils]: 111: Hoare triple {38584#false} assume !false; {38584#false} is VALID [2022-04-15 11:42:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 11:42:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:02,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636494048] [2022-04-15 11:42:02,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636494048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:02,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:02,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:02,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061134667] [2022-04-15 11:42:02,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061134667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:02,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:02,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261039447] [2022-04-15 11:42:02,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:02,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 11:42:02,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:02,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:02,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:02,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:02,882 INFO L87 Difference]: Start difference. First operand 695 states and 1114 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:04,939 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-15 11:42:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:07,925 INFO L93 Difference]: Finished difference Result 1224 states and 1958 transitions. [2022-04-15 11:42:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:07,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 11:42:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:07,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-15 11:42:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:07,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-04-15 11:42:07,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 501 transitions. [2022-04-15 11:42:08,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 501 edges. 501 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:08,300 INFO L225 Difference]: With dead ends: 1224 [2022-04-15 11:42:08,300 INFO L226 Difference]: Without dead ends: 760 [2022-04-15 11:42:08,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:42:08,301 INFO L913 BasicCegarLoop]: 256 mSDtfsCounter, 21 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:08,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 649 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 423 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 11:42:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-15 11:42:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 727. [2022-04-15 11:42:08,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:08,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 760 states. Second operand has 727 states, 722 states have (on average 1.6066481994459834) internal successors, (1160), 722 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:08,341 INFO L74 IsIncluded]: Start isIncluded. First operand 760 states. Second operand has 727 states, 722 states have (on average 1.6066481994459834) internal successors, (1160), 722 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:08,342 INFO L87 Difference]: Start difference. First operand 760 states. Second operand has 727 states, 722 states have (on average 1.6066481994459834) internal successors, (1160), 722 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:08,367 INFO L93 Difference]: Finished difference Result 760 states and 1205 transitions. [2022-04-15 11:42:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1205 transitions. [2022-04-15 11:42:08,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:08,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:08,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 722 states have (on average 1.6066481994459834) internal successors, (1160), 722 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 760 states. [2022-04-15 11:42:08,372 INFO L87 Difference]: Start difference. First operand has 727 states, 722 states have (on average 1.6066481994459834) internal successors, (1160), 722 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 760 states. [2022-04-15 11:42:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:08,398 INFO L93 Difference]: Finished difference Result 760 states and 1205 transitions. [2022-04-15 11:42:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1205 transitions. [2022-04-15 11:42:08,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:08,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:08,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:08,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 722 states have (on average 1.6066481994459834) internal successors, (1160), 722 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1164 transitions. [2022-04-15 11:42:08,434 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1164 transitions. Word has length 112 [2022-04-15 11:42:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:08,435 INFO L478 AbstractCegarLoop]: Abstraction has 727 states and 1164 transitions. [2022-04-15 11:42:08,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:08,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 1164 transitions. [2022-04-15 11:42:10,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1164 edges. 1164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1164 transitions. [2022-04-15 11:42:10,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 11:42:10,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:10,986 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:10,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:42:10,987 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:10,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash 774704089, now seen corresponding path program 1 times [2022-04-15 11:42:10,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:10,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374590076] [2022-04-15 11:42:11,054 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:11,054 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:11,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash 774704089, now seen corresponding path program 2 times [2022-04-15 11:42:11,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:11,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890847887] [2022-04-15 11:42:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:11,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:11,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {44024#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44017#true} is VALID [2022-04-15 11:42:11,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {44017#true} assume true; {44017#true} is VALID [2022-04-15 11:42:11,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44017#true} {44017#true} #755#return; {44017#true} is VALID [2022-04-15 11:42:11,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {44017#true} call ULTIMATE.init(); {44024#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:11,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {44024#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {44017#true} is VALID [2022-04-15 11:42:11,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {44017#true} assume true; {44017#true} is VALID [2022-04-15 11:42:11,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44017#true} {44017#true} #755#return; {44017#true} is VALID [2022-04-15 11:42:11,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {44017#true} call #t~ret161 := main(); {44017#true} is VALID [2022-04-15 11:42:11,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {44017#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {44017#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L272 TraceCheckUtils]: 7: Hoare triple {44017#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {44017#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {44017#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {44017#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {44017#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {44017#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {44017#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {44017#true} assume !false; {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {44017#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {44017#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {44017#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {44017#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {44017#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {44017#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {44017#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {44017#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {44017#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {44017#true} assume 8464 == #t~mem55;havoc #t~mem55; {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {44017#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {44017#true} is VALID [2022-04-15 11:42:11,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {44017#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {44017#true} is VALID [2022-04-15 11:42:11,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {44017#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:11,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {44022#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44023#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-15 11:42:11,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {44023#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {44018#false} is VALID [2022-04-15 11:42:11,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {44018#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {44018#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {44018#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {44018#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {44018#false} ~skip~0 := 0; {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 45: Hoare triple {44018#false} assume !false; {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 46: Hoare triple {44018#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {44018#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {44018#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {44018#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 50: Hoare triple {44018#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 51: Hoare triple {44018#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 52: Hoare triple {44018#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 53: Hoare triple {44018#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 54: Hoare triple {44018#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 55: Hoare triple {44018#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 56: Hoare triple {44018#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 57: Hoare triple {44018#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 58: Hoare triple {44018#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {44018#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {44018#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {44018#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 62: Hoare triple {44018#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {44018#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {44018#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {44018#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {44018#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {44018#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {44018#false} assume 8448 == #t~mem68;havoc #t~mem68; {44018#false} is VALID [2022-04-15 11:42:11,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {44018#false} assume !(~num1~0 > 0); {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {44018#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 71: Hoare triple {44018#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {44018#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 73: Hoare triple {44018#false} ~skip~0 := 0; {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {44018#false} assume !false; {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 75: Hoare triple {44018#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {44018#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {44018#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {44018#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {44018#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 80: Hoare triple {44018#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 81: Hoare triple {44018#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {44018#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 83: Hoare triple {44018#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {44018#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {44018#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 86: Hoare triple {44018#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 87: Hoare triple {44018#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 88: Hoare triple {44018#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 89: Hoare triple {44018#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,242 INFO L290 TraceCheckUtils]: 90: Hoare triple {44018#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 91: Hoare triple {44018#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 92: Hoare triple {44018#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 93: Hoare triple {44018#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 94: Hoare triple {44018#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 95: Hoare triple {44018#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 96: Hoare triple {44018#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 97: Hoare triple {44018#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 98: Hoare triple {44018#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 99: Hoare triple {44018#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,243 INFO L290 TraceCheckUtils]: 100: Hoare triple {44018#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 101: Hoare triple {44018#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 102: Hoare triple {44018#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 103: Hoare triple {44018#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 104: Hoare triple {44018#false} assume 8640 == #t~mem75;havoc #t~mem75; {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 105: Hoare triple {44018#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 106: Hoare triple {44018#false} assume !(9 == ~blastFlag~0); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 107: Hoare triple {44018#false} assume !(12 == ~blastFlag~0); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 108: Hoare triple {44018#false} assume !(15 == ~blastFlag~0); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 109: Hoare triple {44018#false} assume !(18 == ~blastFlag~0); {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 110: Hoare triple {44018#false} assume 21 == ~blastFlag~0; {44018#false} is VALID [2022-04-15 11:42:11,244 INFO L290 TraceCheckUtils]: 111: Hoare triple {44018#false} assume !false; {44018#false} is VALID [2022-04-15 11:42:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:42:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890847887] [2022-04-15 11:42:11,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890847887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:11,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:11,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:11,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:11,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374590076] [2022-04-15 11:42:11,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374590076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:11,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:11,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006901848] [2022-04-15 11:42:11,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:11,247 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-15 11:42:11,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:11,247 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-15 11:42:11,327 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-15 11:42:11,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:11,328 INFO L87 Difference]: Start difference. First operand 727 states and 1164 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-15 11:42:14,124 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:16,131 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-15 11:42:18,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:42:20,929 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-15 11:42:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:23,893 INFO L93 Difference]: Finished difference Result 1003 states and 1615 transitions. [2022-04-15 11:42:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:23,893 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-15 11:42:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:23,893 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-15 11:42:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2022-04-15 11:42:23,895 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-15 11:42:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2022-04-15 11:42:23,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 520 transitions. [2022-04-15 11:42:24,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 520 edges. 520 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:24,262 INFO L225 Difference]: With dead ends: 1003 [2022-04-15 11:42:24,262 INFO L226 Difference]: Without dead ends: 746 [2022-04-15 11:42:24,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:42:24,263 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 36 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:24,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 665 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 463 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-04-15 11:42:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-04-15 11:42:24,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 727. [2022-04-15 11:42:24,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:24,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 746 states. Second operand has 727 states, 722 states have (on average 1.605263157894737) internal successors, (1159), 722 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:24,299 INFO L74 IsIncluded]: Start isIncluded. First operand 746 states. Second operand has 727 states, 722 states have (on average 1.605263157894737) internal successors, (1159), 722 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:24,300 INFO L87 Difference]: Start difference. First operand 746 states. Second operand has 727 states, 722 states have (on average 1.605263157894737) internal successors, (1159), 722 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:24,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:24,324 INFO L93 Difference]: Finished difference Result 746 states and 1188 transitions. [2022-04-15 11:42:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1188 transitions. [2022-04-15 11:42:24,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:24,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:24,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 722 states have (on average 1.605263157894737) internal successors, (1159), 722 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 746 states. [2022-04-15 11:42:24,328 INFO L87 Difference]: Start difference. First operand has 727 states, 722 states have (on average 1.605263157894737) internal successors, (1159), 722 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 746 states. [2022-04-15 11:42:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:24,352 INFO L93 Difference]: Finished difference Result 746 states and 1188 transitions. [2022-04-15 11:42:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1188 transitions. [2022-04-15 11:42:24,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:24,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:24,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:24,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 722 states have (on average 1.605263157894737) internal successors, (1159), 722 states have internal predecessors, (1159), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1163 transitions. [2022-04-15 11:42:24,383 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1163 transitions. Word has length 112 [2022-04-15 11:42:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:24,383 INFO L478 AbstractCegarLoop]: Abstraction has 727 states and 1163 transitions. [2022-04-15 11:42:24,383 INFO L479 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-15 11:42:24,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 1163 transitions. [2022-04-15 11:42:27,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1163 edges. 1163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1163 transitions. [2022-04-15 11:42:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 11:42:27,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:27,077 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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-15 11:42:27,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:42:27,078 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:27,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1443504504, now seen corresponding path program 1 times [2022-04-15 11:42:27,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:27,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446326366] [2022-04-15 11:42:27,155 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:27,155 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:27,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:27,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1443504504, now seen corresponding path program 2 times [2022-04-15 11:42:27,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:27,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768239058] [2022-04-15 11:42:27,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:27,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {48988#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48981#true} is VALID [2022-04-15 11:42:27,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {48981#true} assume true; {48981#true} is VALID [2022-04-15 11:42:27,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48981#true} {48981#true} #755#return; {48981#true} is VALID [2022-04-15 11:42:27,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {48981#true} call ULTIMATE.init(); {48988#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:27,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {48988#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {48981#true} is VALID [2022-04-15 11:42:27,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {48981#true} assume true; {48981#true} is VALID [2022-04-15 11:42:27,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48981#true} {48981#true} #755#return; {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {48981#true} call #t~ret161 := main(); {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {48981#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {48981#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L272 TraceCheckUtils]: 7: Hoare triple {48981#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {48981#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {48981#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {48981#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {48981#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {48981#true} is VALID [2022-04-15 11:42:27,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {48981#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {48981#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {48981#true} assume !false; {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {48981#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {48981#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {48981#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {48981#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {48981#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {48981#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {48981#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {48981#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {48981#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48981#true} is VALID [2022-04-15 11:42:27,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {48981#true} assume 8464 == #t~mem55;havoc #t~mem55; {48981#true} is VALID [2022-04-15 11:42:27,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {48981#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {48981#true} is VALID [2022-04-15 11:42:27,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {48981#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {48981#true} is VALID [2022-04-15 11:42:27,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {48981#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:27,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {48986#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48987#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-15 11:42:27,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {48987#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {48982#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {48982#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {48982#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {48982#false} ~skip~0 := 0; {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {48982#false} assume !false; {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 46: Hoare triple {48982#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 47: Hoare triple {48982#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 48: Hoare triple {48982#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {48982#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {48982#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {48982#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {48982#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {48982#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {48982#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {48982#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {48982#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {48982#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {48982#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {48982#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {48982#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {48982#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 62: Hoare triple {48982#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 63: Hoare triple {48982#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 64: Hoare triple {48982#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {48982#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {48982#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {48982#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 68: Hoare triple {48982#false} assume 8448 == #t~mem68;havoc #t~mem68; {48982#false} is VALID [2022-04-15 11:42:27,339 INFO L290 TraceCheckUtils]: 69: Hoare triple {48982#false} assume !(~num1~0 > 0); {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 70: Hoare triple {48982#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {48982#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {48982#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {48982#false} ~skip~0 := 0; {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 74: Hoare triple {48982#false} assume !false; {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 75: Hoare triple {48982#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {48982#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 77: Hoare triple {48982#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {48982#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,340 INFO L290 TraceCheckUtils]: 79: Hoare triple {48982#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 80: Hoare triple {48982#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 81: Hoare triple {48982#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {48982#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 83: Hoare triple {48982#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {48982#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {48982#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {48982#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 87: Hoare triple {48982#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 88: Hoare triple {48982#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 89: Hoare triple {48982#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,341 INFO L290 TraceCheckUtils]: 90: Hoare triple {48982#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 91: Hoare triple {48982#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 92: Hoare triple {48982#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 93: Hoare triple {48982#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 94: Hoare triple {48982#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 95: Hoare triple {48982#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 96: Hoare triple {48982#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 97: Hoare triple {48982#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 98: Hoare triple {48982#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,342 INFO L290 TraceCheckUtils]: 99: Hoare triple {48982#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 100: Hoare triple {48982#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 101: Hoare triple {48982#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 102: Hoare triple {48982#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 103: Hoare triple {48982#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 104: Hoare triple {48982#false} assume 8640 == #t~mem75;havoc #t~mem75; {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 105: Hoare triple {48982#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 106: Hoare triple {48982#false} assume !(9 == ~blastFlag~0); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 107: Hoare triple {48982#false} assume !(12 == ~blastFlag~0); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 108: Hoare triple {48982#false} assume !(15 == ~blastFlag~0); {48982#false} is VALID [2022-04-15 11:42:27,343 INFO L290 TraceCheckUtils]: 109: Hoare triple {48982#false} assume !(18 == ~blastFlag~0); {48982#false} is VALID [2022-04-15 11:42:27,344 INFO L290 TraceCheckUtils]: 110: Hoare triple {48982#false} assume 21 == ~blastFlag~0; {48982#false} is VALID [2022-04-15 11:42:27,344 INFO L290 TraceCheckUtils]: 111: Hoare triple {48982#false} assume !false; {48982#false} is VALID [2022-04-15 11:42:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:42:27,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:27,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768239058] [2022-04-15 11:42:27,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768239058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:27,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:27,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:27,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:27,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446326366] [2022-04-15 11:42:27,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446326366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:27,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:27,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:27,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206582400] [2022-04-15 11:42:27,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:27,346 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-15 11:42:27,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:27,346 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-15 11:42:27,424 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-15 11:42:27,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:27,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:27,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:27,425 INFO L87 Difference]: Start difference. First operand 727 states and 1163 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-15 11:42:35,801 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-15 11:42:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:41,258 INFO L93 Difference]: Finished difference Result 1002 states and 1612 transitions. [2022-04-15 11:42:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:42:41,258 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-15 11:42:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:41,258 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-15 11:42:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-04-15 11:42:41,261 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-15 11:42:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-04-15 11:42:41,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 518 transitions. [2022-04-15 11:42:41,614 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-15 11:42:41,642 INFO L225 Difference]: With dead ends: 1002 [2022-04-15 11:42:41,642 INFO L226 Difference]: Without dead ends: 745 [2022-04-15 11:42:41,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:42:41,643 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 34 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:41,644 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 663 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 11:42:41,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-04-15 11:42:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 727. [2022-04-15 11:42:41,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:41,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 745 states. Second operand has 727 states, 722 states have (on average 1.6038781163434903) internal successors, (1158), 722 states have internal predecessors, (1158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,678 INFO L74 IsIncluded]: Start isIncluded. First operand 745 states. Second operand has 727 states, 722 states have (on average 1.6038781163434903) internal successors, (1158), 722 states have internal predecessors, (1158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,679 INFO L87 Difference]: Start difference. First operand 745 states. Second operand has 727 states, 722 states have (on average 1.6038781163434903) internal successors, (1158), 722 states have internal predecessors, (1158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:41,703 INFO L93 Difference]: Finished difference Result 745 states and 1186 transitions. [2022-04-15 11:42:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1186 transitions. [2022-04-15 11:42:41,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:41,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:41,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 722 states have (on average 1.6038781163434903) internal successors, (1158), 722 states have internal predecessors, (1158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 745 states. [2022-04-15 11:42:41,706 INFO L87 Difference]: Start difference. First operand has 727 states, 722 states have (on average 1.6038781163434903) internal successors, (1158), 722 states have internal predecessors, (1158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 745 states. [2022-04-15 11:42:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:41,730 INFO L93 Difference]: Finished difference Result 745 states and 1186 transitions. [2022-04-15 11:42:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1186 transitions. [2022-04-15 11:42:41,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:41,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:41,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:41,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 722 states have (on average 1.6038781163434903) internal successors, (1158), 722 states have internal predecessors, (1158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1162 transitions. [2022-04-15 11:42:41,756 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1162 transitions. Word has length 112 [2022-04-15 11:42:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:41,757 INFO L478 AbstractCegarLoop]: Abstraction has 727 states and 1162 transitions. [2022-04-15 11:42:41,757 INFO L479 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-15 11:42:41,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 1162 transitions. [2022-04-15 11:42:44,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1162 edges. 1161 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1162 transitions. [2022-04-15 11:42:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 11:42:44,795 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:44,796 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:42:44,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:42:44,796 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:44,796 INFO L85 PathProgramCache]: Analyzing trace with hash 732310441, now seen corresponding path program 1 times [2022-04-15 11:42:44,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:44,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484732259] [2022-04-15 11:42:44,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:44,856 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:44,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash 732310441, now seen corresponding path program 2 times [2022-04-15 11:42:44,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:44,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718437834] [2022-04-15 11:42:44,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:45,078 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(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {53941#true} is VALID [2022-04-15 11:42:45,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {53941#true} assume true; {53941#true} is VALID [2022-04-15 11:42:45,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53941#true} {53941#true} #755#return; {53941#true} is VALID [2022-04-15 11:42:45,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {53941#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-15 11:42:45,080 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(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {53941#true} assume true; {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53941#true} {53941#true} #755#return; {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {53941#true} call #t~ret161 := main(); {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {53941#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {53941#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L272 TraceCheckUtils]: 7: Hoare triple {53941#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {53941#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {53941#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {53941#true} is VALID [2022-04-15 11:42:45,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {53941#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {53941#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {53941#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {53941#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {53941#true} assume !false; {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {53941#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {53941#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {53941#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {53941#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {53941#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {53941#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {53941#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {53941#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {53941#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {53941#true} assume 8464 == #t~mem55;havoc #t~mem55; {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {53941#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {53941#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {53941#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {53941#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {53941#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {53941#true} ~skip~0 := 0; {53941#true} is VALID [2022-04-15 11:42:45,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {53941#true} assume !false; {53941#true} is VALID [2022-04-15 11:42:45,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {53941#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {53946#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {53946#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:42:45,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {53947#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {53948#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {53948#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {53942#false} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 42: Hoare triple {53942#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {53942#false} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {53942#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {53942#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {53942#false} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 45: Hoare triple {53942#false} ~skip~0 := 0; {53942#false} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 46: Hoare triple {53942#false} assume !false; {53942#false} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 47: Hoare triple {53942#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {53942#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 49: Hoare triple {53942#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {53942#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {53942#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {53942#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 53: Hoare triple {53942#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 54: Hoare triple {53942#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 55: Hoare triple {53942#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {53942#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {53942#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {53942#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 59: Hoare triple {53942#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {53942#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {53942#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {53942#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {53942#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {53942#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {53942#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {53942#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 67: Hoare triple {53942#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {53942#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {53942#false} assume 8448 == #t~mem68;havoc #t~mem68; {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {53942#false} assume !(~num1~0 > 0); {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 71: Hoare triple {53942#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 72: Hoare triple {53942#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {53942#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 74: Hoare triple {53942#false} ~skip~0 := 0; {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 75: Hoare triple {53942#false} assume !false; {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 76: Hoare triple {53942#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 77: Hoare triple {53942#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 78: Hoare triple {53942#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,097 INFO L290 TraceCheckUtils]: 79: Hoare triple {53942#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 80: Hoare triple {53942#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {53942#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {53942#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 83: Hoare triple {53942#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 84: Hoare triple {53942#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 85: Hoare triple {53942#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 86: Hoare triple {53942#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {53942#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {53942#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {53942#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {53942#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 91: Hoare triple {53942#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {53942#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {53942#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {53942#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 95: Hoare triple {53942#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 96: Hoare triple {53942#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 97: Hoare triple {53942#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 98: Hoare triple {53942#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 99: Hoare triple {53942#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,099 INFO L290 TraceCheckUtils]: 100: Hoare triple {53942#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 101: Hoare triple {53942#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 102: Hoare triple {53942#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {53942#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {53942#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {53942#false} assume 8640 == #t~mem75;havoc #t~mem75; {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 106: Hoare triple {53942#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 107: Hoare triple {53942#false} assume !(9 == ~blastFlag~0); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 108: Hoare triple {53942#false} assume !(12 == ~blastFlag~0); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 109: Hoare triple {53942#false} assume !(15 == ~blastFlag~0); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 110: Hoare triple {53942#false} assume !(18 == ~blastFlag~0); {53942#false} is VALID [2022-04-15 11:42:45,100 INFO L290 TraceCheckUtils]: 111: Hoare triple {53942#false} assume 21 == ~blastFlag~0; {53942#false} is VALID [2022-04-15 11:42:45,101 INFO L290 TraceCheckUtils]: 112: Hoare triple {53942#false} assume !false; {53942#false} is VALID [2022-04-15 11:42:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 11:42:45,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:45,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718437834] [2022-04-15 11:42:45,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718437834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:45,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:45,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:42:45,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484732259] [2022-04-15 11:42:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484732259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:45,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:45,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:42:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673499934] [2022-04-15 11:42:45,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:45,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 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 113 [2022-04-15 11:42:45,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:45,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 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-15 11:42:45,182 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-15 11:42:45,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:42:45,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:42:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:42:45,183 INFO L87 Difference]: Start difference. First operand 727 states and 1162 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 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-15 11:42:47,257 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-15 11:42:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:50,495 INFO L93 Difference]: Finished difference Result 1241 states and 1985 transitions. [2022-04-15 11:42:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:42:50,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 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 113 [2022-04-15 11:42:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:42:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 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-15 11:42:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2022-04-15 11:42:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 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-15 11:42:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2022-04-15 11:42:50,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 471 transitions. [2022-04-15 11:42:50,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:50,834 INFO L225 Difference]: With dead ends: 1241 [2022-04-15 11:42:50,834 INFO L226 Difference]: Without dead ends: 745 [2022-04-15 11:42:50,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:42:50,835 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 3 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:42:50,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 754 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 11:42:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-04-15 11:42:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 745. [2022-04-15 11:42:50,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:42:50,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 745 states. Second operand has 745 states, 740 states have (on average 1.5945945945945945) internal successors, (1180), 740 states have internal predecessors, (1180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:50,871 INFO L74 IsIncluded]: Start isIncluded. First operand 745 states. Second operand has 745 states, 740 states have (on average 1.5945945945945945) internal successors, (1180), 740 states have internal predecessors, (1180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:50,872 INFO L87 Difference]: Start difference. First operand 745 states. Second operand has 745 states, 740 states have (on average 1.5945945945945945) internal successors, (1180), 740 states have internal predecessors, (1180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:50,896 INFO L93 Difference]: Finished difference Result 745 states and 1184 transitions. [2022-04-15 11:42:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1184 transitions. [2022-04-15 11:42:50,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:50,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:50,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 740 states have (on average 1.5945945945945945) internal successors, (1180), 740 states have internal predecessors, (1180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 745 states. [2022-04-15 11:42:50,899 INFO L87 Difference]: Start difference. First operand has 745 states, 740 states have (on average 1.5945945945945945) internal successors, (1180), 740 states have internal predecessors, (1180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 745 states. [2022-04-15 11:42:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:42:50,931 INFO L93 Difference]: Finished difference Result 745 states and 1184 transitions. [2022-04-15 11:42:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1184 transitions. [2022-04-15 11:42:50,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:42:50,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:42:50,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:42:50,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:42:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 740 states have (on average 1.5945945945945945) internal successors, (1180), 740 states have internal predecessors, (1180), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1184 transitions. [2022-04-15 11:42:50,955 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1184 transitions. Word has length 113 [2022-04-15 11:42:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:42:50,955 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1184 transitions. [2022-04-15 11:42:50,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 5 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-15 11:42:50,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1184 transitions. [2022-04-15 11:42:53,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1184 edges. 1184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1184 transitions. [2022-04-15 11:42:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 11:42:53,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:42:53,006 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-15 11:42:53,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:42:53,007 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:42:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:42:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1643941756, now seen corresponding path program 1 times [2022-04-15 11:42:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:53,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315933349] [2022-04-15 11:42:53,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:42:53,091 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:42:53,091 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:42:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1643941756, now seen corresponding path program 2 times [2022-04-15 11:42:53,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:42:53,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517222559] [2022-04-15 11:42:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:42:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:42:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:53,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:42:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:42:53,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {59423#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59416#true} is VALID [2022-04-15 11:42:53,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {59416#true} assume true; {59416#true} is VALID [2022-04-15 11:42:53,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59416#true} {59416#true} #755#return; {59416#true} is VALID [2022-04-15 11:42:53,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {59416#true} call ULTIMATE.init(); {59423#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:42:53,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {59423#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {59416#true} is VALID [2022-04-15 11:42:53,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {59416#true} assume true; {59416#true} is VALID [2022-04-15 11:42:53,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59416#true} {59416#true} #755#return; {59416#true} is VALID [2022-04-15 11:42:53,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {59416#true} call #t~ret161 := main(); {59416#true} is VALID [2022-04-15 11:42:53,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {59416#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {59416#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L272 TraceCheckUtils]: 7: Hoare triple {59416#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {59416#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {59416#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {59416#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {59416#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {59416#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {59416#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {59416#true} assume !false; {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {59416#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {59416#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {59416#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {59416#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {59416#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {59416#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {59416#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {59416#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {59416#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {59416#true} assume 8464 == #t~mem55;havoc #t~mem55; {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {59416#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {59416#true} is VALID [2022-04-15 11:42:53,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {59416#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {59416#true} is VALID [2022-04-15 11:42:53,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {59416#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:53,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:53,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:53,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:53,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:53,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:53,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:42:53,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {59421#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59422#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-15 11:42:53,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {59422#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 36: Hoare triple {59417#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {59417#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {59417#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {59417#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {59417#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {59417#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {59417#false} assume 12292 != #t~mem85;havoc #t~mem85; {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {59417#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {59417#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {59417#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {59417#false} ~skip~0 := 0; {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {59417#false} assume !false; {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {59417#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {59417#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 50: Hoare triple {59417#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 51: Hoare triple {59417#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 52: Hoare triple {59417#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {59417#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {59417#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 55: Hoare triple {59417#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {59417#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {59417#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {59417#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {59417#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {59417#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {59417#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 62: Hoare triple {59417#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 63: Hoare triple {59417#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 64: Hoare triple {59417#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 65: Hoare triple {59417#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,303 INFO L290 TraceCheckUtils]: 66: Hoare triple {59417#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {59417#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {59417#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {59417#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {59417#false} assume 8448 == #t~mem68;havoc #t~mem68; {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {59417#false} assume !(~num1~0 > 0); {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {59417#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {59417#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {59417#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {59417#false} ~skip~0 := 0; {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {59417#false} assume !false; {59417#false} is VALID [2022-04-15 11:42:53,304 INFO L290 TraceCheckUtils]: 77: Hoare triple {59417#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 78: Hoare triple {59417#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {59417#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {59417#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 81: Hoare triple {59417#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 82: Hoare triple {59417#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 83: Hoare triple {59417#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 84: Hoare triple {59417#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 85: Hoare triple {59417#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 86: Hoare triple {59417#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,305 INFO L290 TraceCheckUtils]: 87: Hoare triple {59417#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 88: Hoare triple {59417#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 89: Hoare triple {59417#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 90: Hoare triple {59417#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 91: Hoare triple {59417#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 92: Hoare triple {59417#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {59417#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {59417#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 95: Hoare triple {59417#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 96: Hoare triple {59417#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {59417#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 98: Hoare triple {59417#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 99: Hoare triple {59417#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 100: Hoare triple {59417#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {59417#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {59417#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {59417#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 104: Hoare triple {59417#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 105: Hoare triple {59417#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 106: Hoare triple {59417#false} assume 8640 == #t~mem75;havoc #t~mem75; {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 107: Hoare triple {59417#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {59417#false} is VALID [2022-04-15 11:42:53,307 INFO L290 TraceCheckUtils]: 108: Hoare triple {59417#false} assume !(9 == ~blastFlag~0); {59417#false} is VALID [2022-04-15 11:42:53,308 INFO L290 TraceCheckUtils]: 109: Hoare triple {59417#false} assume !(12 == ~blastFlag~0); {59417#false} is VALID [2022-04-15 11:42:53,308 INFO L290 TraceCheckUtils]: 110: Hoare triple {59417#false} assume !(15 == ~blastFlag~0); {59417#false} is VALID [2022-04-15 11:42:53,308 INFO L290 TraceCheckUtils]: 111: Hoare triple {59417#false} assume !(18 == ~blastFlag~0); {59417#false} is VALID [2022-04-15 11:42:53,308 INFO L290 TraceCheckUtils]: 112: Hoare triple {59417#false} assume 21 == ~blastFlag~0; {59417#false} is VALID [2022-04-15 11:42:53,308 INFO L290 TraceCheckUtils]: 113: Hoare triple {59417#false} assume !false; {59417#false} is VALID [2022-04-15 11:42:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:42:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:42:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517222559] [2022-04-15 11:42:53,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517222559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:53,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:53,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:53,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:42:53,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315933349] [2022-04-15 11:42:53,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315933349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:42:53,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:42:53,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:42:53,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391802151] [2022-04-15 11:42:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:42:53,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:42:53,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:42:53,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:53,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:42:53,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:42:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:42:53,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:42:53,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:42:53,387 INFO L87 Difference]: Start difference. First operand 745 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:42:57,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:01,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-15 11:43:05,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:08,779 INFO L93 Difference]: Finished difference Result 1524 states and 2361 transitions. [2022-04-15 11:43:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:43:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:08,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2022-04-15 11:43:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2022-04-15 11:43:08,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 661 transitions. [2022-04-15 11:43:09,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 661 edges. 661 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:09,296 INFO L225 Difference]: With dead ends: 1524 [2022-04-15 11:43:09,296 INFO L226 Difference]: Without dead ends: 1008 [2022-04-15 11:43:09,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:09,298 INFO L913 BasicCegarLoop]: 157 mSDtfsCounter, 167 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:09,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 446 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 516 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2022-04-15 11:43:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-04-15 11:43:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 745. [2022-04-15 11:43:09,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:09,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1008 states. Second operand has 745 states, 740 states have (on average 1.5810810810810811) internal successors, (1170), 740 states have internal predecessors, (1170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,340 INFO L74 IsIncluded]: Start isIncluded. First operand 1008 states. Second operand has 745 states, 740 states have (on average 1.5810810810810811) internal successors, (1170), 740 states have internal predecessors, (1170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,341 INFO L87 Difference]: Start difference. First operand 1008 states. Second operand has 745 states, 740 states have (on average 1.5810810810810811) internal successors, (1170), 740 states have internal predecessors, (1170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:09,385 INFO L93 Difference]: Finished difference Result 1008 states and 1527 transitions. [2022-04-15 11:43:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1527 transitions. [2022-04-15 11:43:09,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:09,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:09,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 740 states have (on average 1.5810810810810811) internal successors, (1170), 740 states have internal predecessors, (1170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1008 states. [2022-04-15 11:43:09,389 INFO L87 Difference]: Start difference. First operand has 745 states, 740 states have (on average 1.5810810810810811) internal successors, (1170), 740 states have internal predecessors, (1170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1008 states. [2022-04-15 11:43:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:09,434 INFO L93 Difference]: Finished difference Result 1008 states and 1527 transitions. [2022-04-15 11:43:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1527 transitions. [2022-04-15 11:43:09,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:09,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:09,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:09,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 740 states have (on average 1.5810810810810811) internal successors, (1170), 740 states have internal predecessors, (1170), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1174 transitions. [2022-04-15 11:43:09,473 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1174 transitions. Word has length 114 [2022-04-15 11:43:09,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:09,473 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1174 transitions. [2022-04-15 11:43:09,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:09,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1174 transitions. [2022-04-15 11:43:12,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1174 edges. 1174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1174 transitions. [2022-04-15 11:43:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 11:43:12,268 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:12,268 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:43:12,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:43:12,268 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1125250206, now seen corresponding path program 1 times [2022-04-15 11:43:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:12,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883378867] [2022-04-15 11:43:12,333 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:12,333 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:12,333 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1125250206, now seen corresponding path program 2 times [2022-04-15 11:43:12,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:12,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418658053] [2022-04-15 11:43:12,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:12,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:12,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {65989#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {65982#true} is VALID [2022-04-15 11:43:12,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {65982#true} assume true; {65982#true} is VALID [2022-04-15 11:43:12,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65982#true} {65982#true} #755#return; {65982#true} is VALID [2022-04-15 11:43:12,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {65982#true} call ULTIMATE.init(); {65989#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:12,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {65989#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {65982#true} is VALID [2022-04-15 11:43:12,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {65982#true} assume true; {65982#true} is VALID [2022-04-15 11:43:12,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65982#true} {65982#true} #755#return; {65982#true} is VALID [2022-04-15 11:43:12,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {65982#true} call #t~ret161 := main(); {65982#true} is VALID [2022-04-15 11:43:12,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {65982#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {65982#true} is VALID [2022-04-15 11:43:12,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {65982#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,522 INFO L272 TraceCheckUtils]: 7: Hoare triple {65982#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {65982#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {65982#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {65982#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {65982#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {65982#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {65982#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {65982#true} assume !false; {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {65982#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {65982#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {65982#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {65982#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {65982#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {65982#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {65982#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {65982#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {65982#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {65982#true} assume 8464 == #t~mem55;havoc #t~mem55; {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {65982#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {65982#true} is VALID [2022-04-15 11:43:12,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {65982#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {65982#true} is VALID [2022-04-15 11:43:12,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {65982#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:12,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {65987#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65988#(= |ssl3_accept_#t~mem50| 8496)} is VALID [2022-04-15 11:43:12,530 INFO L290 TraceCheckUtils]: 36: Hoare triple {65988#(= |ssl3_accept_#t~mem50| 8496)} assume 24576 == #t~mem50;havoc #t~mem50; {65983#false} is VALID [2022-04-15 11:43:12,530 INFO L290 TraceCheckUtils]: 37: Hoare triple {65983#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,530 INFO L290 TraceCheckUtils]: 38: Hoare triple {65983#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {65983#false} is VALID [2022-04-15 11:43:12,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {65983#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {65983#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {65983#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {65983#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {65983#false} assume 12292 != #t~mem85;havoc #t~mem85; {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 44: Hoare triple {65983#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {65983#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {65983#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {65983#false} ~skip~0 := 0; {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 48: Hoare triple {65983#false} assume !false; {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 49: Hoare triple {65983#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {65983#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 51: Hoare triple {65983#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 52: Hoare triple {65983#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 53: Hoare triple {65983#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 54: Hoare triple {65983#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {65983#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {65983#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 57: Hoare triple {65983#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 58: Hoare triple {65983#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {65983#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {65983#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {65983#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {65983#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {65983#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {65983#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {65983#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {65983#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {65983#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 68: Hoare triple {65983#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 69: Hoare triple {65983#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 70: Hoare triple {65983#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,533 INFO L290 TraceCheckUtils]: 71: Hoare triple {65983#false} assume 8448 == #t~mem68;havoc #t~mem68; {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 72: Hoare triple {65983#false} assume !(~num1~0 > 0); {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 73: Hoare triple {65983#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 74: Hoare triple {65983#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 75: Hoare triple {65983#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 76: Hoare triple {65983#false} ~skip~0 := 0; {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {65983#false} assume !false; {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 78: Hoare triple {65983#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 79: Hoare triple {65983#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,534 INFO L290 TraceCheckUtils]: 80: Hoare triple {65983#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 81: Hoare triple {65983#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 82: Hoare triple {65983#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 83: Hoare triple {65983#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 84: Hoare triple {65983#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 85: Hoare triple {65983#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 86: Hoare triple {65983#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 87: Hoare triple {65983#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 88: Hoare triple {65983#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 89: Hoare triple {65983#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,535 INFO L290 TraceCheckUtils]: 90: Hoare triple {65983#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,558 INFO L290 TraceCheckUtils]: 91: Hoare triple {65983#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,558 INFO L290 TraceCheckUtils]: 92: Hoare triple {65983#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,558 INFO L290 TraceCheckUtils]: 93: Hoare triple {65983#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,558 INFO L290 TraceCheckUtils]: 94: Hoare triple {65983#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,558 INFO L290 TraceCheckUtils]: 95: Hoare triple {65983#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,558 INFO L290 TraceCheckUtils]: 96: Hoare triple {65983#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 97: Hoare triple {65983#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 98: Hoare triple {65983#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 99: Hoare triple {65983#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 100: Hoare triple {65983#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 101: Hoare triple {65983#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 102: Hoare triple {65983#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 103: Hoare triple {65983#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 104: Hoare triple {65983#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 105: Hoare triple {65983#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,559 INFO L290 TraceCheckUtils]: 106: Hoare triple {65983#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 107: Hoare triple {65983#false} assume 8640 == #t~mem75;havoc #t~mem75; {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 108: Hoare triple {65983#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 109: Hoare triple {65983#false} assume !(9 == ~blastFlag~0); {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 110: Hoare triple {65983#false} assume !(12 == ~blastFlag~0); {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 111: Hoare triple {65983#false} assume !(15 == ~blastFlag~0); {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 112: Hoare triple {65983#false} assume !(18 == ~blastFlag~0); {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 113: Hoare triple {65983#false} assume 21 == ~blastFlag~0; {65983#false} is VALID [2022-04-15 11:43:12,560 INFO L290 TraceCheckUtils]: 114: Hoare triple {65983#false} assume !false; {65983#false} is VALID [2022-04-15 11:43:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:12,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418658053] [2022-04-15 11:43:12,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418658053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:12,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:12,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:12,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883378867] [2022-04-15 11:43:12,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883378867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:12,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:12,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128647396] [2022-04-15 11:43:12,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:12,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 11:43:12,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:12,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:12,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:12,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:12,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:12,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:12,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:12,642 INFO L87 Difference]: Start difference. First operand 745 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:14,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:16,967 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-15 11:43:20,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:23,426 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:43:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:26,309 INFO L93 Difference]: Finished difference Result 1038 states and 1640 transitions. [2022-04-15 11:43:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-15 11:43:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-04-15 11:43:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-04-15 11:43:26,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 516 transitions. [2022-04-15 11:43:26,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 516 edges. 516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:26,685 INFO L225 Difference]: With dead ends: 1038 [2022-04-15 11:43:26,685 INFO L226 Difference]: Without dead ends: 772 [2022-04-15 11:43:26,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:26,686 INFO L913 BasicCegarLoop]: 261 mSDtfsCounter, 36 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:26,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 659 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-04-15 11:43:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2022-04-15 11:43:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 745. [2022-04-15 11:43:26,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:26,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 772 states. Second operand has 745 states, 740 states have (on average 1.5797297297297297) internal successors, (1169), 740 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:26,732 INFO L74 IsIncluded]: Start isIncluded. First operand 772 states. Second operand has 745 states, 740 states have (on average 1.5797297297297297) internal successors, (1169), 740 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:26,733 INFO L87 Difference]: Start difference. First operand 772 states. Second operand has 745 states, 740 states have (on average 1.5797297297297297) internal successors, (1169), 740 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:26,762 INFO L93 Difference]: Finished difference Result 772 states and 1208 transitions. [2022-04-15 11:43:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1208 transitions. [2022-04-15 11:43:26,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:26,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:26,764 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 740 states have (on average 1.5797297297297297) internal successors, (1169), 740 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 772 states. [2022-04-15 11:43:26,765 INFO L87 Difference]: Start difference. First operand has 745 states, 740 states have (on average 1.5797297297297297) internal successors, (1169), 740 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 772 states. [2022-04-15 11:43:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:26,794 INFO L93 Difference]: Finished difference Result 772 states and 1208 transitions. [2022-04-15 11:43:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1208 transitions. [2022-04-15 11:43:26,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:26,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:26,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:26,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 740 states have (on average 1.5797297297297297) internal successors, (1169), 740 states have internal predecessors, (1169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1173 transitions. [2022-04-15 11:43:26,828 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1173 transitions. Word has length 115 [2022-04-15 11:43:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:26,829 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1173 transitions. [2022-04-15 11:43:26,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:26,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1173 transitions. [2022-04-15 11:43:29,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1173 edges. 1173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1173 transitions. [2022-04-15 11:43:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-04-15 11:43:29,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:29,014 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-15 11:43:29,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:43:29,014 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash -470255743, now seen corresponding path program 1 times [2022-04-15 11:43:29,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:29,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244680548] [2022-04-15 11:43:29,085 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:29,085 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:29,085 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -470255743, now seen corresponding path program 2 times [2022-04-15 11:43:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:29,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914232375] [2022-04-15 11:43:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:29,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:29,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {71111#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {71104#true} is VALID [2022-04-15 11:43:29,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {71104#true} assume true; {71104#true} is VALID [2022-04-15 11:43:29,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71104#true} {71104#true} #755#return; {71104#true} is VALID [2022-04-15 11:43:29,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {71104#true} call ULTIMATE.init(); {71111#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:29,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {71111#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {71104#true} is VALID [2022-04-15 11:43:29,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {71104#true} assume true; {71104#true} is VALID [2022-04-15 11:43:29,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71104#true} {71104#true} #755#return; {71104#true} is VALID [2022-04-15 11:43:29,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {71104#true} call #t~ret161 := main(); {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {71104#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {71104#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L272 TraceCheckUtils]: 7: Hoare triple {71104#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {71104#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {71104#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {71104#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {71104#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {71104#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {71104#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {71104#true} is VALID [2022-04-15 11:43:29,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {71104#true} assume !false; {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {71104#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {71104#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {71104#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {71104#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {71104#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {71104#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {71104#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {71104#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {71104#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71104#true} is VALID [2022-04-15 11:43:29,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {71104#true} assume 8464 == #t~mem55;havoc #t~mem55; {71104#true} is VALID [2022-04-15 11:43:29,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {71104#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {71104#true} is VALID [2022-04-15 11:43:29,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {71104#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {71104#true} is VALID [2022-04-15 11:43:29,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {71104#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,277 INFO L290 TraceCheckUtils]: 32: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:43:29,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {71109#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71110#(= |ssl3_accept_#t~mem51| 8496)} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {71110#(= |ssl3_accept_#t~mem51| 8496)} assume 8195 == #t~mem51;havoc #t~mem51; {71105#false} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {71105#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {71105#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {71105#false} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {71105#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {71105#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {71105#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {71105#false} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {71105#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {71105#false} assume 12292 != #t~mem85;havoc #t~mem85; {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {71105#false} assume !(0 == ~tmp___5~0);call write~int(8464, ~s.base, 52 + ~s.offset, 4);call #t~mem86.base, #t~mem86.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem87 := read~int(#t~mem86.base, 72 + #t~mem86.offset, 4);call write~int(1 + #t~mem87, #t~mem86.base, 72 + #t~mem86.offset, 4);havoc #t~mem86.base, #t~mem86.offset;havoc #t~mem87; {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {71105#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {71105#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {71105#false} ~skip~0 := 0; {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 49: Hoare triple {71105#false} assume !false; {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 50: Hoare triple {71105#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 51: Hoare triple {71105#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 52: Hoare triple {71105#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,281 INFO L290 TraceCheckUtils]: 53: Hoare triple {71105#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 54: Hoare triple {71105#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 55: Hoare triple {71105#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {71105#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {71105#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {71105#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 59: Hoare triple {71105#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {71105#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {71105#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {71105#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,282 INFO L290 TraceCheckUtils]: 63: Hoare triple {71105#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {71105#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 65: Hoare triple {71105#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 66: Hoare triple {71105#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 67: Hoare triple {71105#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 68: Hoare triple {71105#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 69: Hoare triple {71105#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 70: Hoare triple {71105#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 71: Hoare triple {71105#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 72: Hoare triple {71105#false} assume 8448 == #t~mem68;havoc #t~mem68; {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 73: Hoare triple {71105#false} assume !(~num1~0 > 0); {71105#false} is VALID [2022-04-15 11:43:29,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {71105#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 75: Hoare triple {71105#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 76: Hoare triple {71105#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 77: Hoare triple {71105#false} ~skip~0 := 0; {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 78: Hoare triple {71105#false} assume !false; {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 79: Hoare triple {71105#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 80: Hoare triple {71105#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 81: Hoare triple {71105#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 82: Hoare triple {71105#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,284 INFO L290 TraceCheckUtils]: 83: Hoare triple {71105#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 84: Hoare triple {71105#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 85: Hoare triple {71105#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 86: Hoare triple {71105#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 87: Hoare triple {71105#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 88: Hoare triple {71105#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 89: Hoare triple {71105#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 90: Hoare triple {71105#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 91: Hoare triple {71105#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 92: Hoare triple {71105#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {71105#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 94: Hoare triple {71105#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 95: Hoare triple {71105#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 96: Hoare triple {71105#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {71105#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 98: Hoare triple {71105#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 99: Hoare triple {71105#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 100: Hoare triple {71105#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 101: Hoare triple {71105#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 102: Hoare triple {71105#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 103: Hoare triple {71105#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,286 INFO L290 TraceCheckUtils]: 104: Hoare triple {71105#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 105: Hoare triple {71105#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 106: Hoare triple {71105#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 107: Hoare triple {71105#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 108: Hoare triple {71105#false} assume 8640 == #t~mem75;havoc #t~mem75; {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 109: Hoare triple {71105#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 110: Hoare triple {71105#false} assume !(9 == ~blastFlag~0); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 111: Hoare triple {71105#false} assume !(12 == ~blastFlag~0); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 112: Hoare triple {71105#false} assume !(15 == ~blastFlag~0); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 113: Hoare triple {71105#false} assume !(18 == ~blastFlag~0); {71105#false} is VALID [2022-04-15 11:43:29,287 INFO L290 TraceCheckUtils]: 114: Hoare triple {71105#false} assume 21 == ~blastFlag~0; {71105#false} is VALID [2022-04-15 11:43:29,288 INFO L290 TraceCheckUtils]: 115: Hoare triple {71105#false} assume !false; {71105#false} is VALID [2022-04-15 11:43:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:43:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914232375] [2022-04-15 11:43:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914232375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:29,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:29,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:29,289 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:29,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244680548] [2022-04-15 11:43:29,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244680548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:29,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:29,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045405828] [2022-04-15 11:43:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 11:43:29,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:29,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:29,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:29,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:29,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:29,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:29,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:29,372 INFO L87 Difference]: Start difference. First operand 745 states and 1173 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:31,591 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-15 11:43:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:42,503 INFO L93 Difference]: Finished difference Result 1028 states and 1625 transitions. [2022-04-15 11:43:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:43:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 116 [2022-04-15 11:43:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:43:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-04-15 11:43:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-04-15 11:43:42,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 513 transitions. [2022-04-15 11:43:42,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 513 edges. 513 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:42,879 INFO L225 Difference]: With dead ends: 1028 [2022-04-15 11:43:42,880 INFO L226 Difference]: Without dead ends: 762 [2022-04-15 11:43:42,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:43:42,880 INFO L913 BasicCegarLoop]: 259 mSDtfsCounter, 33 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:43:42,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 655 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 11:43:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-04-15 11:43:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 745. [2022-04-15 11:43:42,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:43:42,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 762 states. Second operand has 745 states, 740 states have (on average 1.5783783783783785) internal successors, (1168), 740 states have internal predecessors, (1168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:42,920 INFO L74 IsIncluded]: Start isIncluded. First operand 762 states. Second operand has 745 states, 740 states have (on average 1.5783783783783785) internal successors, (1168), 740 states have internal predecessors, (1168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:42,922 INFO L87 Difference]: Start difference. First operand 762 states. Second operand has 745 states, 740 states have (on average 1.5783783783783785) internal successors, (1168), 740 states have internal predecessors, (1168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:42,946 INFO L93 Difference]: Finished difference Result 762 states and 1194 transitions. [2022-04-15 11:43:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1194 transitions. [2022-04-15 11:43:42,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:42,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:42,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 745 states, 740 states have (on average 1.5783783783783785) internal successors, (1168), 740 states have internal predecessors, (1168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 762 states. [2022-04-15 11:43:42,950 INFO L87 Difference]: Start difference. First operand has 745 states, 740 states have (on average 1.5783783783783785) internal successors, (1168), 740 states have internal predecessors, (1168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 762 states. [2022-04-15 11:43:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:43:42,969 INFO L93 Difference]: Finished difference Result 762 states and 1194 transitions. [2022-04-15 11:43:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1194 transitions. [2022-04-15 11:43:42,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:43:42,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:43:42,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:43:42,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:43:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 740 states have (on average 1.5783783783783785) internal successors, (1168), 740 states have internal predecessors, (1168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1172 transitions. [2022-04-15 11:43:42,995 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1172 transitions. Word has length 116 [2022-04-15 11:43:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:43:42,995 INFO L478 AbstractCegarLoop]: Abstraction has 745 states and 1172 transitions. [2022-04-15 11:43:42,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:42,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 745 states and 1172 transitions. [2022-04-15 11:43:45,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1172 edges. 1172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1172 transitions. [2022-04-15 11:43:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-04-15 11:43:45,250 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:43:45,250 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:43:45,250 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:43:45,250 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:43:45,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:43:45,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1023027159, now seen corresponding path program 1 times [2022-04-15 11:43:45,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:45,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988699657] [2022-04-15 11:43:45,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:43:45,320 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:43:45,320 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:43:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1023027159, now seen corresponding path program 2 times [2022-04-15 11:43:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:43:45,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062465835] [2022-04-15 11:43:45,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:43:45,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:43:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:43:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:43:45,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {76193#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {76186#true} is VALID [2022-04-15 11:43:45,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {76186#true} assume true; {76186#true} is VALID [2022-04-15 11:43:45,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76186#true} {76186#true} #755#return; {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {76186#true} call ULTIMATE.init(); {76193#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:43:45,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {76193#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {76186#true} assume true; {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76186#true} {76186#true} #755#return; {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {76186#true} call #t~ret161 := main(); {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {76186#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {76186#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L272 TraceCheckUtils]: 7: Hoare triple {76186#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {76186#true} is VALID [2022-04-15 11:43:45,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {76186#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {76186#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {76186#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {76186#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {76186#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {76186#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {76186#true} assume !false; {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {76186#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {76186#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {76186#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {76186#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {76186#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {76186#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {76186#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {76186#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {76186#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {76186#true} assume 8464 == #t~mem55;havoc #t~mem55; {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {76186#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {76186#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {76186#true} is VALID [2022-04-15 11:43:45,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {76186#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {76186#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {76186#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {76186#true} ~skip~0 := 0; {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {76186#true} assume !false; {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {76186#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 33: Hoare triple {76186#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {76186#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {76186#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {76186#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {76186#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {76186#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {76186#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {76186#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {76186#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {76186#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 43: Hoare triple {76186#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 44: Hoare triple {76186#true} assume 8496 == #t~mem58;havoc #t~mem58; {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 45: Hoare triple {76186#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {76186#true} is VALID [2022-04-15 11:43:45,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {76186#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {76186#true} is VALID [2022-04-15 11:43:45,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {76186#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {76186#true} is VALID [2022-04-15 11:43:45,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {76186#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,514 INFO L290 TraceCheckUtils]: 51: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,515 INFO L290 TraceCheckUtils]: 53: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,516 INFO L290 TraceCheckUtils]: 56: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,517 INFO L290 TraceCheckUtils]: 59: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,519 INFO L290 TraceCheckUtils]: 62: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,519 INFO L290 TraceCheckUtils]: 63: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,520 INFO L290 TraceCheckUtils]: 64: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,520 INFO L290 TraceCheckUtils]: 65: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,521 INFO L290 TraceCheckUtils]: 66: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,521 INFO L290 TraceCheckUtils]: 67: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,521 INFO L290 TraceCheckUtils]: 68: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,522 INFO L290 TraceCheckUtils]: 69: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,522 INFO L290 TraceCheckUtils]: 70: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,523 INFO L290 TraceCheckUtils]: 71: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:43:45,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {76191#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {76192#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-15 11:43:45,525 INFO L290 TraceCheckUtils]: 76: Hoare triple {76192#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {76187#false} is VALID [2022-04-15 11:43:45,525 INFO L290 TraceCheckUtils]: 77: Hoare triple {76187#false} assume !(~num1~0 > 0); {76187#false} is VALID [2022-04-15 11:43:45,525 INFO L290 TraceCheckUtils]: 78: Hoare triple {76187#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 79: Hoare triple {76187#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 80: Hoare triple {76187#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 81: Hoare triple {76187#false} ~skip~0 := 0; {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 82: Hoare triple {76187#false} assume !false; {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 83: Hoare triple {76187#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {76187#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {76187#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {76187#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 87: Hoare triple {76187#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,526 INFO L290 TraceCheckUtils]: 88: Hoare triple {76187#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {76187#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 90: Hoare triple {76187#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 91: Hoare triple {76187#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 92: Hoare triple {76187#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 93: Hoare triple {76187#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 94: Hoare triple {76187#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 95: Hoare triple {76187#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 96: Hoare triple {76187#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 97: Hoare triple {76187#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,527 INFO L290 TraceCheckUtils]: 98: Hoare triple {76187#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 99: Hoare triple {76187#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 100: Hoare triple {76187#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 101: Hoare triple {76187#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 102: Hoare triple {76187#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 103: Hoare triple {76187#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 104: Hoare triple {76187#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 105: Hoare triple {76187#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 106: Hoare triple {76187#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 107: Hoare triple {76187#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,528 INFO L290 TraceCheckUtils]: 108: Hoare triple {76187#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 109: Hoare triple {76187#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 110: Hoare triple {76187#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 111: Hoare triple {76187#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 112: Hoare triple {76187#false} assume 8640 == #t~mem75;havoc #t~mem75; {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 113: Hoare triple {76187#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 114: Hoare triple {76187#false} assume !(9 == ~blastFlag~0); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 115: Hoare triple {76187#false} assume !(12 == ~blastFlag~0); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 116: Hoare triple {76187#false} assume !(15 == ~blastFlag~0); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 117: Hoare triple {76187#false} assume !(18 == ~blastFlag~0); {76187#false} is VALID [2022-04-15 11:43:45,529 INFO L290 TraceCheckUtils]: 118: Hoare triple {76187#false} assume 21 == ~blastFlag~0; {76187#false} is VALID [2022-04-15 11:43:45,530 INFO L290 TraceCheckUtils]: 119: Hoare triple {76187#false} assume !false; {76187#false} is VALID [2022-04-15 11:43:45,530 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-15 11:43:45,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:43:45,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062465835] [2022-04-15 11:43:45,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062465835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:45,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:45,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:45,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:43:45,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988699657] [2022-04-15 11:43:45,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988699657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:43:45,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:43:45,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:43:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506721664] [2022-04-15 11:43:45,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:43:45,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-15 11:43:45,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:43:45,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:45,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:43:45,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:43:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:43:45,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:43:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:43:45,610 INFO L87 Difference]: Start difference. First operand 745 states and 1172 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:43:48,718 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-15 11:43:50,722 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-15 11:43:54,156 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-15 11:44:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:01,251 INFO L93 Difference]: Finished difference Result 1955 states and 3077 transitions. [2022-04-15 11:44:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 120 [2022-04-15 11:44:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2022-04-15 11:44:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2022-04-15 11:44:01,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 656 transitions. [2022-04-15 11:44:01,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 656 edges. 656 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:01,765 INFO L225 Difference]: With dead ends: 1955 [2022-04-15 11:44:01,765 INFO L226 Difference]: Without dead ends: 1236 [2022-04-15 11:44:01,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:01,767 INFO L913 BasicCegarLoop]: 296 mSDtfsCounter, 146 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:01,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 722 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 649 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 11:44:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-04-15 11:44:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 937. [2022-04-15 11:44:01,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:01,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1236 states. Second operand has 937 states, 932 states have (on average 1.613733905579399) internal successors, (1504), 932 states have internal predecessors, (1504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,830 INFO L74 IsIncluded]: Start isIncluded. First operand 1236 states. Second operand has 937 states, 932 states have (on average 1.613733905579399) internal successors, (1504), 932 states have internal predecessors, (1504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,831 INFO L87 Difference]: Start difference. First operand 1236 states. Second operand has 937 states, 932 states have (on average 1.613733905579399) internal successors, (1504), 932 states have internal predecessors, (1504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:01,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:01,896 INFO L93 Difference]: Finished difference Result 1236 states and 1933 transitions. [2022-04-15 11:44:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1933 transitions. [2022-04-15 11:44:01,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:01,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:01,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 937 states, 932 states have (on average 1.613733905579399) internal successors, (1504), 932 states have internal predecessors, (1504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1236 states. [2022-04-15 11:44:01,900 INFO L87 Difference]: Start difference. First operand has 937 states, 932 states have (on average 1.613733905579399) internal successors, (1504), 932 states have internal predecessors, (1504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1236 states. [2022-04-15 11:44:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:01,963 INFO L93 Difference]: Finished difference Result 1236 states and 1933 transitions. [2022-04-15 11:44:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1933 transitions. [2022-04-15 11:44:01,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:01,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:01,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:01,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 932 states have (on average 1.613733905579399) internal successors, (1504), 932 states have internal predecessors, (1504), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1508 transitions. [2022-04-15 11:44:02,023 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1508 transitions. Word has length 120 [2022-04-15 11:44:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:02,023 INFO L478 AbstractCegarLoop]: Abstraction has 937 states and 1508 transitions. [2022-04-15 11:44:02,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:02,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 937 states and 1508 transitions. [2022-04-15 11:44:04,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1508 edges. 1508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1508 transitions. [2022-04-15 11:44:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 11:44:04,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:04,659 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:04,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:44:04,659 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1819271850, now seen corresponding path program 1 times [2022-04-15 11:44:04,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:04,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310726252] [2022-04-15 11:44:04,729 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:04,729 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:04,729 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:04,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1819271850, now seen corresponding path program 2 times [2022-04-15 11:44:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:04,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814146051] [2022-04-15 11:44:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:04,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:04,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {84461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {84454#true} is VALID [2022-04-15 11:44:04,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {84454#true} assume true; {84454#true} is VALID [2022-04-15 11:44:04,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84454#true} {84454#true} #755#return; {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {84454#true} call ULTIMATE.init(); {84461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:04,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {84461#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {84454#true} assume true; {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84454#true} {84454#true} #755#return; {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {84454#true} call #t~ret161 := main(); {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {84454#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {84454#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L272 TraceCheckUtils]: 7: Hoare triple {84454#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {84454#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {84454#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {84454#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {84454#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {84454#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {84454#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {84454#true} assume !false; {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {84454#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {84454#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {84454#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {84454#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {84454#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {84454#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {84454#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {84454#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {84454#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84454#true} is VALID [2022-04-15 11:44:04,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {84454#true} assume 8464 == #t~mem55;havoc #t~mem55; {84454#true} is VALID [2022-04-15 11:44:04,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {84454#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {84454#true} is VALID [2022-04-15 11:44:04,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {84454#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {84454#true} is VALID [2022-04-15 11:44:04,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {84454#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:04,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:04,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:04,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:04,939 INFO L290 TraceCheckUtils]: 31: Hoare triple {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:04,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {84459#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84460#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-15 11:44:04,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {84460#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {84455#false} is VALID [2022-04-15 11:44:04,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {84455#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {84455#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {84455#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {84455#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {84455#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {84455#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {84455#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {84455#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 42: Hoare triple {84455#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {84455#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {84455#false} ~skip~0 := 0; {84455#false} is VALID [2022-04-15 11:44:04,941 INFO L290 TraceCheckUtils]: 45: Hoare triple {84455#false} assume !false; {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {84455#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {84455#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {84455#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 49: Hoare triple {84455#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 50: Hoare triple {84455#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 51: Hoare triple {84455#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 52: Hoare triple {84455#false} assume 8480 == #t~mem52;havoc #t~mem52; {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 53: Hoare triple {84455#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 54: Hoare triple {84455#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,942 INFO L290 TraceCheckUtils]: 55: Hoare triple {84455#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 56: Hoare triple {84455#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 57: Hoare triple {84455#false} ~skip~0 := 0; {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 58: Hoare triple {84455#false} assume !false; {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 59: Hoare triple {84455#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {84455#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {84455#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 62: Hoare triple {84455#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 63: Hoare triple {84455#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {84455#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 65: Hoare triple {84455#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 66: Hoare triple {84455#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 67: Hoare triple {84455#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 68: Hoare triple {84455#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 69: Hoare triple {84455#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 70: Hoare triple {84455#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 71: Hoare triple {84455#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 72: Hoare triple {84455#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {84455#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 74: Hoare triple {84455#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 75: Hoare triple {84455#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 76: Hoare triple {84455#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 77: Hoare triple {84455#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 78: Hoare triple {84455#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 79: Hoare triple {84455#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 80: Hoare triple {84455#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 81: Hoare triple {84455#false} assume 8448 == #t~mem68;havoc #t~mem68; {84455#false} is VALID [2022-04-15 11:44:04,945 INFO L290 TraceCheckUtils]: 82: Hoare triple {84455#false} assume !(~num1~0 > 0); {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 83: Hoare triple {84455#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {84455#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 85: Hoare triple {84455#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 86: Hoare triple {84455#false} ~skip~0 := 0; {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 87: Hoare triple {84455#false} assume !false; {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 88: Hoare triple {84455#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 89: Hoare triple {84455#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 90: Hoare triple {84455#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,946 INFO L290 TraceCheckUtils]: 91: Hoare triple {84455#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 92: Hoare triple {84455#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 93: Hoare triple {84455#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 94: Hoare triple {84455#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 95: Hoare triple {84455#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 96: Hoare triple {84455#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 97: Hoare triple {84455#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 98: Hoare triple {84455#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 99: Hoare triple {84455#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 100: Hoare triple {84455#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,947 INFO L290 TraceCheckUtils]: 101: Hoare triple {84455#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 102: Hoare triple {84455#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 103: Hoare triple {84455#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 104: Hoare triple {84455#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 105: Hoare triple {84455#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 106: Hoare triple {84455#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 107: Hoare triple {84455#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 108: Hoare triple {84455#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 109: Hoare triple {84455#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 110: Hoare triple {84455#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 111: Hoare triple {84455#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,948 INFO L290 TraceCheckUtils]: 112: Hoare triple {84455#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 113: Hoare triple {84455#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 114: Hoare triple {84455#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 115: Hoare triple {84455#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 116: Hoare triple {84455#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 117: Hoare triple {84455#false} assume 8640 == #t~mem75;havoc #t~mem75; {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 118: Hoare triple {84455#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 119: Hoare triple {84455#false} assume !(9 == ~blastFlag~0); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 120: Hoare triple {84455#false} assume !(12 == ~blastFlag~0); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 121: Hoare triple {84455#false} assume !(15 == ~blastFlag~0); {84455#false} is VALID [2022-04-15 11:44:04,949 INFO L290 TraceCheckUtils]: 122: Hoare triple {84455#false} assume !(18 == ~blastFlag~0); {84455#false} is VALID [2022-04-15 11:44:04,950 INFO L290 TraceCheckUtils]: 123: Hoare triple {84455#false} assume 21 == ~blastFlag~0; {84455#false} is VALID [2022-04-15 11:44:04,950 INFO L290 TraceCheckUtils]: 124: Hoare triple {84455#false} assume !false; {84455#false} is VALID [2022-04-15 11:44:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 11:44:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:04,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814146051] [2022-04-15 11:44:04,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814146051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:04,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:04,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:04,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310726252] [2022-04-15 11:44:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310726252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:04,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:04,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:04,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389680107] [2022-04-15 11:44:04,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 11:44:04,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:04,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:05,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:05,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:05,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:05,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:05,025 INFO L87 Difference]: Start difference. First operand 937 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:07,069 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-15 11:44:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:09,869 INFO L93 Difference]: Finished difference Result 1274 states and 2059 transitions. [2022-04-15 11:44:09,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:09,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 125 [2022-04-15 11:44:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-04-15 11:44:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-04-15 11:44:09,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 500 transitions. [2022-04-15 11:44:10,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:10,246 INFO L225 Difference]: With dead ends: 1274 [2022-04-15 11:44:10,246 INFO L226 Difference]: Without dead ends: 944 [2022-04-15 11:44:10,247 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:10,247 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:10,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 643 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 420 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 11:44:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-04-15 11:44:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 937. [2022-04-15 11:44:10,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:10,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 944 states. Second operand has 937 states, 932 states have (on average 1.6126609442060085) internal successors, (1503), 932 states have internal predecessors, (1503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:10,301 INFO L74 IsIncluded]: Start isIncluded. First operand 944 states. Second operand has 937 states, 932 states have (on average 1.6126609442060085) internal successors, (1503), 932 states have internal predecessors, (1503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:10,301 INFO L87 Difference]: Start difference. First operand 944 states. Second operand has 937 states, 932 states have (on average 1.6126609442060085) internal successors, (1503), 932 states have internal predecessors, (1503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:10,330 INFO L93 Difference]: Finished difference Result 944 states and 1517 transitions. [2022-04-15 11:44:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1517 transitions. [2022-04-15 11:44:10,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:10,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:10,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 937 states, 932 states have (on average 1.6126609442060085) internal successors, (1503), 932 states have internal predecessors, (1503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 944 states. [2022-04-15 11:44:10,333 INFO L87 Difference]: Start difference. First operand has 937 states, 932 states have (on average 1.6126609442060085) internal successors, (1503), 932 states have internal predecessors, (1503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 944 states. [2022-04-15 11:44:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:10,360 INFO L93 Difference]: Finished difference Result 944 states and 1517 transitions. [2022-04-15 11:44:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1517 transitions. [2022-04-15 11:44:10,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:10,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:10,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:10,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 932 states have (on average 1.6126609442060085) internal successors, (1503), 932 states have internal predecessors, (1503), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1507 transitions. [2022-04-15 11:44:10,422 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1507 transitions. Word has length 125 [2022-04-15 11:44:10,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:10,423 INFO L478 AbstractCegarLoop]: Abstraction has 937 states and 1507 transitions. [2022-04-15 11:44:10,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:10,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 937 states and 1507 transitions. [2022-04-15 11:44:12,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1507 edges. 1507 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1507 transitions. [2022-04-15 11:44:12,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 11:44:12,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:12,880 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:12,880 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:44:12,880 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:12,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1280230605, now seen corresponding path program 1 times [2022-04-15 11:44:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:12,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [440274424] [2022-04-15 11:44:12,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:12,965 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:12,965 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1280230605, now seen corresponding path program 2 times [2022-04-15 11:44:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:12,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492277342] [2022-04-15 11:44:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:13,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {90783#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {90776#true} is VALID [2022-04-15 11:44:13,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {90776#true} assume true; {90776#true} is VALID [2022-04-15 11:44:13,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90776#true} {90776#true} #755#return; {90776#true} is VALID [2022-04-15 11:44:13,171 INFO L272 TraceCheckUtils]: 0: Hoare triple {90776#true} call ULTIMATE.init(); {90783#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:13,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {90783#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {90776#true} assume true; {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90776#true} {90776#true} #755#return; {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {90776#true} call #t~ret161 := main(); {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {90776#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {90776#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L272 TraceCheckUtils]: 7: Hoare triple {90776#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {90776#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {90776#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {90776#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {90776#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {90776#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {90776#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {90776#true} assume !false; {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {90776#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {90776#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {90776#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {90776#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {90776#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {90776#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {90776#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {90776#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {90776#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {90776#true} assume 8464 == #t~mem55;havoc #t~mem55; {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {90776#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {90776#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {90776#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {90776#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {90776#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {90776#true} ~skip~0 := 0; {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {90776#true} assume !false; {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {90776#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {90776#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 34: Hoare triple {90776#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 35: Hoare triple {90776#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {90776#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 37: Hoare triple {90776#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {90776#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {90776#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {90776#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {90776#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {90776#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {90776#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {90776#true} assume 8496 == #t~mem58;havoc #t~mem58; {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 45: Hoare triple {90776#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 46: Hoare triple {90776#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {90776#true} is VALID [2022-04-15 11:44:13,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {90776#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {90776#true} is VALID [2022-04-15 11:44:13,177 INFO L290 TraceCheckUtils]: 48: Hoare triple {90776#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,179 INFO L290 TraceCheckUtils]: 51: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,180 INFO L290 TraceCheckUtils]: 52: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,180 INFO L290 TraceCheckUtils]: 53: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,180 INFO L290 TraceCheckUtils]: 54: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,181 INFO L290 TraceCheckUtils]: 55: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,181 INFO L290 TraceCheckUtils]: 56: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,186 INFO L290 TraceCheckUtils]: 67: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,188 INFO L290 TraceCheckUtils]: 71: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,189 INFO L290 TraceCheckUtils]: 72: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,189 INFO L290 TraceCheckUtils]: 73: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,190 INFO L290 TraceCheckUtils]: 74: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,190 INFO L290 TraceCheckUtils]: 75: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,190 INFO L290 TraceCheckUtils]: 76: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,191 INFO L290 TraceCheckUtils]: 77: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,191 INFO L290 TraceCheckUtils]: 78: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,192 INFO L290 TraceCheckUtils]: 79: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:13,192 INFO L290 TraceCheckUtils]: 80: Hoare triple {90781#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {90782#(= |ssl3_accept_#t~mem73| 8656)} is VALID [2022-04-15 11:44:13,193 INFO L290 TraceCheckUtils]: 81: Hoare triple {90782#(= |ssl3_accept_#t~mem73| 8656)} assume 8608 == #t~mem73;havoc #t~mem73; {90777#false} is VALID [2022-04-15 11:44:13,193 INFO L290 TraceCheckUtils]: 82: Hoare triple {90777#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {90777#false} is VALID [2022-04-15 11:44:13,193 INFO L290 TraceCheckUtils]: 83: Hoare triple {90777#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {90777#false} is VALID [2022-04-15 11:44:13,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {90777#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,193 INFO L290 TraceCheckUtils]: 85: Hoare triple {90777#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,193 INFO L290 TraceCheckUtils]: 86: Hoare triple {90777#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 87: Hoare triple {90777#false} ~skip~0 := 0; {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 88: Hoare triple {90777#false} assume !false; {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {90777#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {90777#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 91: Hoare triple {90777#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 92: Hoare triple {90777#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 93: Hoare triple {90777#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 94: Hoare triple {90777#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,194 INFO L290 TraceCheckUtils]: 95: Hoare triple {90777#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,196 INFO L290 TraceCheckUtils]: 96: Hoare triple {90777#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,196 INFO L290 TraceCheckUtils]: 97: Hoare triple {90777#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,196 INFO L290 TraceCheckUtils]: 98: Hoare triple {90777#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 99: Hoare triple {90777#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 100: Hoare triple {90777#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 101: Hoare triple {90777#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 102: Hoare triple {90777#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 103: Hoare triple {90777#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 104: Hoare triple {90777#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 105: Hoare triple {90777#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 106: Hoare triple {90777#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 107: Hoare triple {90777#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,197 INFO L290 TraceCheckUtils]: 108: Hoare triple {90777#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 109: Hoare triple {90777#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 110: Hoare triple {90777#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 111: Hoare triple {90777#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 112: Hoare triple {90777#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 113: Hoare triple {90777#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 114: Hoare triple {90777#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 115: Hoare triple {90777#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 116: Hoare triple {90777#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 117: Hoare triple {90777#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {90777#false} is VALID [2022-04-15 11:44:13,198 INFO L290 TraceCheckUtils]: 118: Hoare triple {90777#false} assume 8640 == #t~mem75;havoc #t~mem75; {90777#false} is VALID [2022-04-15 11:44:13,199 INFO L290 TraceCheckUtils]: 119: Hoare triple {90777#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {90777#false} is VALID [2022-04-15 11:44:13,199 INFO L290 TraceCheckUtils]: 120: Hoare triple {90777#false} assume !(9 == ~blastFlag~0); {90777#false} is VALID [2022-04-15 11:44:13,199 INFO L290 TraceCheckUtils]: 121: Hoare triple {90777#false} assume !(12 == ~blastFlag~0); {90777#false} is VALID [2022-04-15 11:44:13,199 INFO L290 TraceCheckUtils]: 122: Hoare triple {90777#false} assume !(15 == ~blastFlag~0); {90777#false} is VALID [2022-04-15 11:44:13,199 INFO L290 TraceCheckUtils]: 123: Hoare triple {90777#false} assume !(18 == ~blastFlag~0); {90777#false} is VALID [2022-04-15 11:44:13,199 INFO L290 TraceCheckUtils]: 124: Hoare triple {90777#false} assume 21 == ~blastFlag~0; {90777#false} is VALID [2022-04-15 11:44:13,199 INFO L290 TraceCheckUtils]: 125: Hoare triple {90777#false} assume !false; {90777#false} is VALID [2022-04-15 11:44:13,200 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-15 11:44:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:13,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492277342] [2022-04-15 11:44:13,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492277342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:13,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:13,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:13,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:13,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [440274424] [2022-04-15 11:44:13,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [440274424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:13,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:13,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608096718] [2022-04-15 11:44:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:13,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 11:44:13,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:13,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:13,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:13,303 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:13,304 INFO L87 Difference]: Start difference. First operand 937 states and 1507 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:15,368 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-15 11:44:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:19,714 INFO L93 Difference]: Finished difference Result 2160 states and 3439 transitions. [2022-04-15 11:44:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:19,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 11:44:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2022-04-15 11:44:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2022-04-15 11:44:19,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 618 transitions. [2022-04-15 11:44:20,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:20,206 INFO L225 Difference]: With dead ends: 2160 [2022-04-15 11:44:20,206 INFO L226 Difference]: Without dead ends: 1249 [2022-04-15 11:44:20,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:20,208 INFO L913 BasicCegarLoop]: 308 mSDtfsCounter, 96 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:20,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 753 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 660 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:44:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2022-04-15 11:44:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1054. [2022-04-15 11:44:20,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:20,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1249 states. Second operand has 1054 states, 1049 states have (on average 1.6244041944709247) internal successors, (1704), 1049 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:20,270 INFO L74 IsIncluded]: Start isIncluded. First operand 1249 states. Second operand has 1054 states, 1049 states have (on average 1.6244041944709247) internal successors, (1704), 1049 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:20,271 INFO L87 Difference]: Start difference. First operand 1249 states. Second operand has 1054 states, 1049 states have (on average 1.6244041944709247) internal successors, (1704), 1049 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:20,319 INFO L93 Difference]: Finished difference Result 1249 states and 1963 transitions. [2022-04-15 11:44:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1963 transitions. [2022-04-15 11:44:20,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:20,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:20,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 1054 states, 1049 states have (on average 1.6244041944709247) internal successors, (1704), 1049 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1249 states. [2022-04-15 11:44:20,322 INFO L87 Difference]: Start difference. First operand has 1054 states, 1049 states have (on average 1.6244041944709247) internal successors, (1704), 1049 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1249 states. [2022-04-15 11:44:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:20,382 INFO L93 Difference]: Finished difference Result 1249 states and 1963 transitions. [2022-04-15 11:44:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1963 transitions. [2022-04-15 11:44:20,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:20,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:20,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:20,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 1049 states have (on average 1.6244041944709247) internal successors, (1704), 1049 states have internal predecessors, (1704), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1708 transitions. [2022-04-15 11:44:20,439 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1708 transitions. Word has length 126 [2022-04-15 11:44:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:20,439 INFO L478 AbstractCegarLoop]: Abstraction has 1054 states and 1708 transitions. [2022-04-15 11:44:20,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:20,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1054 states and 1708 transitions. [2022-04-15 11:44:23,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1708 edges. 1708 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1708 transitions. [2022-04-15 11:44:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 11:44:23,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:23,055 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:23,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:44:23,055 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -441196943, now seen corresponding path program 1 times [2022-04-15 11:44:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:23,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52111826] [2022-04-15 11:44:23,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:23,118 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:23,119 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash -441196943, now seen corresponding path program 2 times [2022-04-15 11:44:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:23,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709075399] [2022-04-15 11:44:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:23,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:23,313 INFO L290 TraceCheckUtils]: 0: Hoare triple {99721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {99714#true} is VALID [2022-04-15 11:44:23,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {99714#true} assume true; {99714#true} is VALID [2022-04-15 11:44:23,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {99714#true} {99714#true} #755#return; {99714#true} is VALID [2022-04-15 11:44:23,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {99714#true} call ULTIMATE.init(); {99721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:23,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {99721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {99714#true} is VALID [2022-04-15 11:44:23,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {99714#true} assume true; {99714#true} is VALID [2022-04-15 11:44:23,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {99714#true} {99714#true} #755#return; {99714#true} is VALID [2022-04-15 11:44:23,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {99714#true} call #t~ret161 := main(); {99714#true} is VALID [2022-04-15 11:44:23,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {99714#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {99714#true} is VALID [2022-04-15 11:44:23,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {99714#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L272 TraceCheckUtils]: 7: Hoare triple {99714#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {99714#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {99714#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {99714#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {99714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {99714#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {99714#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {99714#true} is VALID [2022-04-15 11:44:23,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {99714#true} assume !false; {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {99714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {99714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {99714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {99714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {99714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {99714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {99714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {99714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {99714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {99714#true} assume 8464 == #t~mem55;havoc #t~mem55; {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {99714#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {99714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {99714#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {99714#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {99714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {99714#true} ~skip~0 := 0; {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 31: Hoare triple {99714#true} assume !false; {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 32: Hoare triple {99714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 33: Hoare triple {99714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {99714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 35: Hoare triple {99714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {99714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {99714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {99714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 39: Hoare triple {99714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 40: Hoare triple {99714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {99714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {99714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {99714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {99714#true} assume 8496 == #t~mem58;havoc #t~mem58; {99714#true} is VALID [2022-04-15 11:44:23,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {99714#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {99714#true} is VALID [2022-04-15 11:44:23,332 INFO L290 TraceCheckUtils]: 46: Hoare triple {99714#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {99714#true} is VALID [2022-04-15 11:44:23,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {99714#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {99714#true} is VALID [2022-04-15 11:44:23,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {99714#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,334 INFO L290 TraceCheckUtils]: 50: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,337 INFO L290 TraceCheckUtils]: 55: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,339 INFO L290 TraceCheckUtils]: 60: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,339 INFO L290 TraceCheckUtils]: 61: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,341 INFO L290 TraceCheckUtils]: 65: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,342 INFO L290 TraceCheckUtils]: 66: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,342 INFO L290 TraceCheckUtils]: 67: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,343 INFO L290 TraceCheckUtils]: 68: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,343 INFO L290 TraceCheckUtils]: 69: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,344 INFO L290 TraceCheckUtils]: 70: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,344 INFO L290 TraceCheckUtils]: 71: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,344 INFO L290 TraceCheckUtils]: 72: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,345 INFO L290 TraceCheckUtils]: 73: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,345 INFO L290 TraceCheckUtils]: 74: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,346 INFO L290 TraceCheckUtils]: 76: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,348 INFO L290 TraceCheckUtils]: 79: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:44:23,348 INFO L290 TraceCheckUtils]: 80: Hoare triple {99719#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {99720#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 81: Hoare triple {99720#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {99715#false} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 82: Hoare triple {99715#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {99715#false} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 83: Hoare triple {99715#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {99715#false} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 84: Hoare triple {99715#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 85: Hoare triple {99715#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 86: Hoare triple {99715#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {99715#false} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 87: Hoare triple {99715#false} ~skip~0 := 0; {99715#false} is VALID [2022-04-15 11:44:23,349 INFO L290 TraceCheckUtils]: 88: Hoare triple {99715#false} assume !false; {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 89: Hoare triple {99715#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 90: Hoare triple {99715#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 91: Hoare triple {99715#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 92: Hoare triple {99715#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 93: Hoare triple {99715#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 94: Hoare triple {99715#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 95: Hoare triple {99715#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 96: Hoare triple {99715#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 97: Hoare triple {99715#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,350 INFO L290 TraceCheckUtils]: 98: Hoare triple {99715#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 99: Hoare triple {99715#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 100: Hoare triple {99715#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 101: Hoare triple {99715#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 102: Hoare triple {99715#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 103: Hoare triple {99715#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 104: Hoare triple {99715#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 105: Hoare triple {99715#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 106: Hoare triple {99715#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,351 INFO L290 TraceCheckUtils]: 107: Hoare triple {99715#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 108: Hoare triple {99715#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 109: Hoare triple {99715#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 110: Hoare triple {99715#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 111: Hoare triple {99715#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 112: Hoare triple {99715#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 113: Hoare triple {99715#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 114: Hoare triple {99715#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 115: Hoare triple {99715#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 116: Hoare triple {99715#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,352 INFO L290 TraceCheckUtils]: 117: Hoare triple {99715#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 118: Hoare triple {99715#false} assume 8640 == #t~mem75;havoc #t~mem75; {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 119: Hoare triple {99715#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 120: Hoare triple {99715#false} assume !(9 == ~blastFlag~0); {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 121: Hoare triple {99715#false} assume !(12 == ~blastFlag~0); {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 122: Hoare triple {99715#false} assume !(15 == ~blastFlag~0); {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 123: Hoare triple {99715#false} assume !(18 == ~blastFlag~0); {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 124: Hoare triple {99715#false} assume 21 == ~blastFlag~0; {99715#false} is VALID [2022-04-15 11:44:23,353 INFO L290 TraceCheckUtils]: 125: Hoare triple {99715#false} assume !false; {99715#false} is VALID [2022-04-15 11:44:23,354 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-15 11:44:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:23,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709075399] [2022-04-15 11:44:23,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709075399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:23,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:23,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:23,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:23,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52111826] [2022-04-15 11:44:23,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52111826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:23,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:23,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645435560] [2022-04-15 11:44:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:23,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 11:44:23,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:23,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:23,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:23,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:23,444 INFO L87 Difference]: Start difference. First operand 1054 states and 1708 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:26,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:44:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:35,743 INFO L93 Difference]: Finished difference Result 2465 states and 3945 transitions. [2022-04-15 11:44:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 126 [2022-04-15 11:44:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-04-15 11:44:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-04-15 11:44:35,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 660 transitions. [2022-04-15 11:44:36,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:36,300 INFO L225 Difference]: With dead ends: 2465 [2022-04-15 11:44:36,300 INFO L226 Difference]: Without dead ends: 1437 [2022-04-15 11:44:36,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:36,302 INFO L913 BasicCegarLoop]: 151 mSDtfsCounter, 142 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:36,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 434 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:44:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-04-15 11:44:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1048. [2022-04-15 11:44:36,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:36,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1437 states. Second operand has 1048 states, 1043 states have (on average 1.6251198465963566) internal successors, (1695), 1043 states have internal predecessors, (1695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:36,370 INFO L74 IsIncluded]: Start isIncluded. First operand 1437 states. Second operand has 1048 states, 1043 states have (on average 1.6251198465963566) internal successors, (1695), 1043 states have internal predecessors, (1695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:36,371 INFO L87 Difference]: Start difference. First operand 1437 states. Second operand has 1048 states, 1043 states have (on average 1.6251198465963566) internal successors, (1695), 1043 states have internal predecessors, (1695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:36,439 INFO L93 Difference]: Finished difference Result 1437 states and 2265 transitions. [2022-04-15 11:44:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2265 transitions. [2022-04-15 11:44:36,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:36,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:36,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 1048 states, 1043 states have (on average 1.6251198465963566) internal successors, (1695), 1043 states have internal predecessors, (1695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1437 states. [2022-04-15 11:44:36,443 INFO L87 Difference]: Start difference. First operand has 1048 states, 1043 states have (on average 1.6251198465963566) internal successors, (1695), 1043 states have internal predecessors, (1695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1437 states. [2022-04-15 11:44:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:36,496 INFO L93 Difference]: Finished difference Result 1437 states and 2265 transitions. [2022-04-15 11:44:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2265 transitions. [2022-04-15 11:44:36,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:36,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:36,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:36,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1043 states have (on average 1.6251198465963566) internal successors, (1695), 1043 states have internal predecessors, (1695), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1699 transitions. [2022-04-15 11:44:36,554 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1699 transitions. Word has length 126 [2022-04-15 11:44:36,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:36,554 INFO L478 AbstractCegarLoop]: Abstraction has 1048 states and 1699 transitions. [2022-04-15 11:44:36,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:36,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1048 states and 1699 transitions. [2022-04-15 11:44:39,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1699 edges. 1699 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1699 transitions. [2022-04-15 11:44:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 11:44:39,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:39,254 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:39,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:44:39,254 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:39,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash 860641639, now seen corresponding path program 1 times [2022-04-15 11:44:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:39,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527257303] [2022-04-15 11:44:39,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:39,328 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:39,328 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 860641639, now seen corresponding path program 2 times [2022-04-15 11:44:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:39,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218095418] [2022-04-15 11:44:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:39,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:39,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {109633#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109626#true} is VALID [2022-04-15 11:44:39,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {109626#true} assume true; {109626#true} is VALID [2022-04-15 11:44:39,509 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {109626#true} {109626#true} #755#return; {109626#true} is VALID [2022-04-15 11:44:39,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {109626#true} call ULTIMATE.init(); {109633#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:39,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {109633#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {109626#true} assume true; {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {109626#true} {109626#true} #755#return; {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {109626#true} call #t~ret161 := main(); {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {109626#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {109626#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L272 TraceCheckUtils]: 7: Hoare triple {109626#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {109626#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {109626#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {109626#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {109626#true} is VALID [2022-04-15 11:44:39,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {109626#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {109626#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {109626#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {109626#true} assume !false; {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {109626#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {109626#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {109626#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {109626#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {109626#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {109626#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {109626#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {109626#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {109626#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {109626#true} assume 8464 == #t~mem55;havoc #t~mem55; {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {109626#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {109626#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {109626#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {109626#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {109626#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {109626#true} ~skip~0 := 0; {109626#true} is VALID [2022-04-15 11:44:39,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {109626#true} assume !false; {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {109626#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {109626#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {109626#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {109626#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {109626#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {109626#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {109626#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {109626#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {109626#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {109626#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {109626#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {109626#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {109626#true} assume 8496 == #t~mem58;havoc #t~mem58; {109626#true} is VALID [2022-04-15 11:44:39,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {109626#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {109626#true} is VALID [2022-04-15 11:44:39,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {109626#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {109626#true} is VALID [2022-04-15 11:44:39,515 INFO L290 TraceCheckUtils]: 47: Hoare triple {109626#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {109626#true} is VALID [2022-04-15 11:44:39,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {109626#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,521 INFO L290 TraceCheckUtils]: 57: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,521 INFO L290 TraceCheckUtils]: 58: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,521 INFO L290 TraceCheckUtils]: 59: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,523 INFO L290 TraceCheckUtils]: 62: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,523 INFO L290 TraceCheckUtils]: 63: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,524 INFO L290 TraceCheckUtils]: 64: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,524 INFO L290 TraceCheckUtils]: 65: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,525 INFO L290 TraceCheckUtils]: 67: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,526 INFO L290 TraceCheckUtils]: 68: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,526 INFO L290 TraceCheckUtils]: 69: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,526 INFO L290 TraceCheckUtils]: 70: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,527 INFO L290 TraceCheckUtils]: 71: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,527 INFO L290 TraceCheckUtils]: 72: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,528 INFO L290 TraceCheckUtils]: 73: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,528 INFO L290 TraceCheckUtils]: 74: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,529 INFO L290 TraceCheckUtils]: 76: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,530 INFO L290 TraceCheckUtils]: 77: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,530 INFO L290 TraceCheckUtils]: 78: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,531 INFO L290 TraceCheckUtils]: 79: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,531 INFO L290 TraceCheckUtils]: 80: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:44:39,531 INFO L290 TraceCheckUtils]: 81: Hoare triple {109631#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {109632#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-15 11:44:39,532 INFO L290 TraceCheckUtils]: 82: Hoare triple {109632#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {109627#false} is VALID [2022-04-15 11:44:39,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {109627#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {109627#false} is VALID [2022-04-15 11:44:39,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {109627#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {109627#false} is VALID [2022-04-15 11:44:39,532 INFO L290 TraceCheckUtils]: 85: Hoare triple {109627#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,532 INFO L290 TraceCheckUtils]: 86: Hoare triple {109627#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,532 INFO L290 TraceCheckUtils]: 87: Hoare triple {109627#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 88: Hoare triple {109627#false} ~skip~0 := 0; {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 89: Hoare triple {109627#false} assume !false; {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 90: Hoare triple {109627#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 91: Hoare triple {109627#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 92: Hoare triple {109627#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 93: Hoare triple {109627#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 94: Hoare triple {109627#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 95: Hoare triple {109627#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 96: Hoare triple {109627#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 97: Hoare triple {109627#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,533 INFO L290 TraceCheckUtils]: 98: Hoare triple {109627#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 99: Hoare triple {109627#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 100: Hoare triple {109627#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 101: Hoare triple {109627#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 102: Hoare triple {109627#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 103: Hoare triple {109627#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 104: Hoare triple {109627#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 105: Hoare triple {109627#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 106: Hoare triple {109627#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 107: Hoare triple {109627#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,534 INFO L290 TraceCheckUtils]: 108: Hoare triple {109627#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 109: Hoare triple {109627#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 110: Hoare triple {109627#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 111: Hoare triple {109627#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 112: Hoare triple {109627#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 113: Hoare triple {109627#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 114: Hoare triple {109627#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 115: Hoare triple {109627#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 116: Hoare triple {109627#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 117: Hoare triple {109627#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 118: Hoare triple {109627#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {109627#false} is VALID [2022-04-15 11:44:39,535 INFO L290 TraceCheckUtils]: 119: Hoare triple {109627#false} assume 8640 == #t~mem75;havoc #t~mem75; {109627#false} is VALID [2022-04-15 11:44:39,536 INFO L290 TraceCheckUtils]: 120: Hoare triple {109627#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {109627#false} is VALID [2022-04-15 11:44:39,536 INFO L290 TraceCheckUtils]: 121: Hoare triple {109627#false} assume !(9 == ~blastFlag~0); {109627#false} is VALID [2022-04-15 11:44:39,536 INFO L290 TraceCheckUtils]: 122: Hoare triple {109627#false} assume !(12 == ~blastFlag~0); {109627#false} is VALID [2022-04-15 11:44:39,536 INFO L290 TraceCheckUtils]: 123: Hoare triple {109627#false} assume !(15 == ~blastFlag~0); {109627#false} is VALID [2022-04-15 11:44:39,536 INFO L290 TraceCheckUtils]: 124: Hoare triple {109627#false} assume !(18 == ~blastFlag~0); {109627#false} is VALID [2022-04-15 11:44:39,536 INFO L290 TraceCheckUtils]: 125: Hoare triple {109627#false} assume 21 == ~blastFlag~0; {109627#false} is VALID [2022-04-15 11:44:39,536 INFO L290 TraceCheckUtils]: 126: Hoare triple {109627#false} assume !false; {109627#false} is VALID [2022-04-15 11:44:39,537 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-15 11:44:39,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:39,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218095418] [2022-04-15 11:44:39,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218095418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:39,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:39,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:39,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:39,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527257303] [2022-04-15 11:44:39,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527257303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:39,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:39,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50487730] [2022-04-15 11:44:39,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:39,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 11:44:39,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:39,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:39,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:39,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:39,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:39,638 INFO L87 Difference]: Start difference. First operand 1048 states and 1699 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:42,810 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-15 11:44:44,815 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-15 11:44:46,994 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-15 11:44:49,855 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-15 11:44:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:53,209 INFO L93 Difference]: Finished difference Result 2333 states and 3717 transitions. [2022-04-15 11:44:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:44:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 127 [2022-04-15 11:44:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:44:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-04-15 11:44:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2022-04-15 11:44:53,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 660 transitions. [2022-04-15 11:44:53,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:53,770 INFO L225 Difference]: With dead ends: 2333 [2022-04-15 11:44:53,770 INFO L226 Difference]: Without dead ends: 1311 [2022-04-15 11:44:53,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:44:53,772 INFO L913 BasicCegarLoop]: 161 mSDtfsCounter, 141 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:44:53,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 454 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 520 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:44:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2022-04-15 11:44:53,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1048. [2022-04-15 11:44:53,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:44:53,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1311 states. Second operand has 1048 states, 1043 states have (on average 1.6193672099712368) internal successors, (1689), 1043 states have internal predecessors, (1689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,849 INFO L74 IsIncluded]: Start isIncluded. First operand 1311 states. Second operand has 1048 states, 1043 states have (on average 1.6193672099712368) internal successors, (1689), 1043 states have internal predecessors, (1689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,850 INFO L87 Difference]: Start difference. First operand 1311 states. Second operand has 1048 states, 1043 states have (on average 1.6193672099712368) internal successors, (1689), 1043 states have internal predecessors, (1689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:53,923 INFO L93 Difference]: Finished difference Result 1311 states and 2046 transitions. [2022-04-15 11:44:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2046 transitions. [2022-04-15 11:44:53,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:53,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:53,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 1048 states, 1043 states have (on average 1.6193672099712368) internal successors, (1689), 1043 states have internal predecessors, (1689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1311 states. [2022-04-15 11:44:53,928 INFO L87 Difference]: Start difference. First operand has 1048 states, 1043 states have (on average 1.6193672099712368) internal successors, (1689), 1043 states have internal predecessors, (1689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1311 states. [2022-04-15 11:44:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:44:53,999 INFO L93 Difference]: Finished difference Result 1311 states and 2046 transitions. [2022-04-15 11:44:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 2046 transitions. [2022-04-15 11:44:54,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:44:54,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:44:54,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:44:54,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:44:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1043 states have (on average 1.6193672099712368) internal successors, (1689), 1043 states have internal predecessors, (1689), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1693 transitions. [2022-04-15 11:44:54,069 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1693 transitions. Word has length 127 [2022-04-15 11:44:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:44:54,070 INFO L478 AbstractCegarLoop]: Abstraction has 1048 states and 1693 transitions. [2022-04-15 11:44:54,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:44:54,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1048 states and 1693 transitions. [2022-04-15 11:44:57,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1693 edges. 1693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:44:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1693 transitions. [2022-04-15 11:44:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:44:57,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:44:57,004 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:44:57,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:44:57,004 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:44:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:44:57,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1011987089, now seen corresponding path program 1 times [2022-04-15 11:44:57,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:57,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1252290475] [2022-04-15 11:44:57,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:44:57,089 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:44:57,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:44:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1011987089, now seen corresponding path program 2 times [2022-04-15 11:44:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:44:57,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031330441] [2022-04-15 11:44:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:44:57,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:44:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:57,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:44:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:44:57,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {119029#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {119022#true} is VALID [2022-04-15 11:44:57,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {119022#true} assume true; {119022#true} is VALID [2022-04-15 11:44:57,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119022#true} {119022#true} #755#return; {119022#true} is VALID [2022-04-15 11:44:57,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {119022#true} call ULTIMATE.init(); {119029#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:44:57,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {119029#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {119022#true} is VALID [2022-04-15 11:44:57,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {119022#true} assume true; {119022#true} is VALID [2022-04-15 11:44:57,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119022#true} {119022#true} #755#return; {119022#true} is VALID [2022-04-15 11:44:57,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {119022#true} call #t~ret161 := main(); {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {119022#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {119022#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L272 TraceCheckUtils]: 7: Hoare triple {119022#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {119022#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {119022#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {119022#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {119022#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {119022#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {119022#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {119022#true} is VALID [2022-04-15 11:44:57,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {119022#true} assume !false; {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {119022#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {119022#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {119022#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {119022#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {119022#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {119022#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {119022#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {119022#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {119022#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {119022#true} assume 8464 == #t~mem55;havoc #t~mem55; {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {119022#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {119022#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {119022#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {119022#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {119022#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {119022#true} ~skip~0 := 0; {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {119022#true} assume !false; {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {119022#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {119022#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {119022#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {119022#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {119022#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {119022#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {119022#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {119022#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {119022#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {119022#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {119022#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {119022#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {119022#true} assume 8496 == #t~mem58;havoc #t~mem58; {119022#true} is VALID [2022-04-15 11:44:57,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {119022#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {119022#true} is VALID [2022-04-15 11:44:57,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {119022#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {119022#true} is VALID [2022-04-15 11:44:57,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {119022#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {119022#true} is VALID [2022-04-15 11:44:57,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {119022#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:44:57,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {119027#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {119028#(= |ssl3_accept_#t~mem52| 8656)} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {119028#(= |ssl3_accept_#t~mem52| 8656)} assume 8480 == #t~mem52;havoc #t~mem52; {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {119023#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {119023#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 63: Hoare triple {119023#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {119023#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {119023#false} ~skip~0 := 0; {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {119023#false} assume !false; {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 67: Hoare triple {119023#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {119023#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {119023#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {119023#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 71: Hoare triple {119023#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {119023#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {119023#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {119023#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {119023#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 76: Hoare triple {119023#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 77: Hoare triple {119023#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,288 INFO L290 TraceCheckUtils]: 78: Hoare triple {119023#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {119023#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 80: Hoare triple {119023#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 81: Hoare triple {119023#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 82: Hoare triple {119023#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 83: Hoare triple {119023#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 84: Hoare triple {119023#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 85: Hoare triple {119023#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {119023#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {119023#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {119023#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 89: Hoare triple {119023#false} assume 8448 == #t~mem68;havoc #t~mem68; {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 90: Hoare triple {119023#false} assume !(~num1~0 > 0); {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {119023#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {119023#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {119023#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 94: Hoare triple {119023#false} ~skip~0 := 0; {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 95: Hoare triple {119023#false} assume !false; {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 96: Hoare triple {119023#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 97: Hoare triple {119023#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,290 INFO L290 TraceCheckUtils]: 98: Hoare triple {119023#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 99: Hoare triple {119023#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 100: Hoare triple {119023#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 101: Hoare triple {119023#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 102: Hoare triple {119023#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 103: Hoare triple {119023#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 104: Hoare triple {119023#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 105: Hoare triple {119023#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 106: Hoare triple {119023#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 107: Hoare triple {119023#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,291 INFO L290 TraceCheckUtils]: 108: Hoare triple {119023#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 109: Hoare triple {119023#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 110: Hoare triple {119023#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 111: Hoare triple {119023#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 112: Hoare triple {119023#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 113: Hoare triple {119023#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 114: Hoare triple {119023#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 115: Hoare triple {119023#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 116: Hoare triple {119023#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 117: Hoare triple {119023#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 118: Hoare triple {119023#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,292 INFO L290 TraceCheckUtils]: 119: Hoare triple {119023#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 120: Hoare triple {119023#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 121: Hoare triple {119023#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 122: Hoare triple {119023#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 123: Hoare triple {119023#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 124: Hoare triple {119023#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 125: Hoare triple {119023#false} assume 8640 == #t~mem75;havoc #t~mem75; {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 126: Hoare triple {119023#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 127: Hoare triple {119023#false} assume !(9 == ~blastFlag~0); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 128: Hoare triple {119023#false} assume !(12 == ~blastFlag~0); {119023#false} is VALID [2022-04-15 11:44:57,293 INFO L290 TraceCheckUtils]: 129: Hoare triple {119023#false} assume !(15 == ~blastFlag~0); {119023#false} is VALID [2022-04-15 11:44:57,294 INFO L290 TraceCheckUtils]: 130: Hoare triple {119023#false} assume !(18 == ~blastFlag~0); {119023#false} is VALID [2022-04-15 11:44:57,294 INFO L290 TraceCheckUtils]: 131: Hoare triple {119023#false} assume 21 == ~blastFlag~0; {119023#false} is VALID [2022-04-15 11:44:57,294 INFO L290 TraceCheckUtils]: 132: Hoare triple {119023#false} assume !false; {119023#false} is VALID [2022-04-15 11:44:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:44:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:44:57,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031330441] [2022-04-15 11:44:57,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031330441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:57,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:57,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:57,295 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:44:57,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1252290475] [2022-04-15 11:44:57,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1252290475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:44:57,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:44:57,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:44:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569613675] [2022-04-15 11:44:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:44:57,296 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 133 [2022-04-15 11:44:57,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:44:57,296 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-15 11:44:57,382 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-15 11:44:57,382 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:44:57,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:44:57,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:44:57,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:44:57,383 INFO L87 Difference]: Start difference. First operand 1048 states and 1693 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-15 11:45:09,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:09,676 INFO L93 Difference]: Finished difference Result 2373 states and 3795 transitions. [2022-04-15 11:45:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:09,676 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 133 [2022-04-15 11:45:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:09,677 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-15 11:45:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-15 11:45:09,679 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-15 11:45:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-04-15 11:45:09,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 612 transitions. [2022-04-15 11:45:10,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:10,169 INFO L225 Difference]: With dead ends: 2373 [2022-04-15 11:45:10,169 INFO L226 Difference]: Without dead ends: 1351 [2022-04-15 11:45:10,171 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:10,171 INFO L913 BasicCegarLoop]: 303 mSDtfsCounter, 112 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:10,171 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 743 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:45:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-04-15 11:45:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1102. [2022-04-15 11:45:10,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:10,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1351 states. Second operand has 1102 states, 1097 states have (on average 1.6107566089334548) internal successors, (1767), 1097 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,242 INFO L74 IsIncluded]: Start isIncluded. First operand 1351 states. Second operand has 1102 states, 1097 states have (on average 1.6107566089334548) internal successors, (1767), 1097 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,244 INFO L87 Difference]: Start difference. First operand 1351 states. Second operand has 1102 states, 1097 states have (on average 1.6107566089334548) internal successors, (1767), 1097 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:10,322 INFO L93 Difference]: Finished difference Result 1351 states and 2133 transitions. [2022-04-15 11:45:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2133 transitions. [2022-04-15 11:45:10,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:10,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:10,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 1102 states, 1097 states have (on average 1.6107566089334548) internal successors, (1767), 1097 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1351 states. [2022-04-15 11:45:10,325 INFO L87 Difference]: Start difference. First operand has 1102 states, 1097 states have (on average 1.6107566089334548) internal successors, (1767), 1097 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1351 states. [2022-04-15 11:45:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:10,384 INFO L93 Difference]: Finished difference Result 1351 states and 2133 transitions. [2022-04-15 11:45:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2133 transitions. [2022-04-15 11:45:10,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:10,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:10,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:10,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1097 states have (on average 1.6107566089334548) internal successors, (1767), 1097 states have internal predecessors, (1767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1771 transitions. [2022-04-15 11:45:10,434 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1771 transitions. Word has length 133 [2022-04-15 11:45:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:10,434 INFO L478 AbstractCegarLoop]: Abstraction has 1102 states and 1771 transitions. [2022-04-15 11:45:10,434 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:10,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1102 states and 1771 transitions. [2022-04-15 11:45:14,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1771 edges. 1771 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:14,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1771 transitions. [2022-04-15 11:45:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:45:14,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:14,148 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:14,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:45:14,148 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1406497389, now seen corresponding path program 1 times [2022-04-15 11:45:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:14,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291163869] [2022-04-15 11:45:14,217 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:14,217 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:14,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:14,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1406497389, now seen corresponding path program 2 times [2022-04-15 11:45:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:14,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142374750] [2022-04-15 11:45:14,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:14,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:14,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {128693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {128686#true} is VALID [2022-04-15 11:45:14,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {128686#true} assume true; {128686#true} is VALID [2022-04-15 11:45:14,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128686#true} {128686#true} #755#return; {128686#true} is VALID [2022-04-15 11:45:14,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {128686#true} call ULTIMATE.init(); {128693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:14,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {128693#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {128686#true} is VALID [2022-04-15 11:45:14,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {128686#true} assume true; {128686#true} is VALID [2022-04-15 11:45:14,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128686#true} {128686#true} #755#return; {128686#true} is VALID [2022-04-15 11:45:14,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {128686#true} call #t~ret161 := main(); {128686#true} is VALID [2022-04-15 11:45:14,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {128686#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {128686#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L272 TraceCheckUtils]: 7: Hoare triple {128686#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {128686#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {128686#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {128686#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {128686#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {128686#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {128686#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {128686#true} assume !false; {128686#true} is VALID [2022-04-15 11:45:14,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {128686#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {128686#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {128686#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {128686#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {128686#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {128686#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {128686#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {128686#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {128686#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {128686#true} assume 8464 == #t~mem55;havoc #t~mem55; {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {128686#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {128686#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 27: Hoare triple {128686#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 28: Hoare triple {128686#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 29: Hoare triple {128686#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {128686#true} ~skip~0 := 0; {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {128686#true} assume !false; {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {128686#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {128686#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {128686#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 35: Hoare triple {128686#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {128686#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {128686#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {128686#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {128686#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 40: Hoare triple {128686#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 41: Hoare triple {128686#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 42: Hoare triple {128686#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 43: Hoare triple {128686#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {128686#true} assume 8496 == #t~mem58;havoc #t~mem58; {128686#true} is VALID [2022-04-15 11:45:14,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {128686#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {128686#true} is VALID [2022-04-15 11:45:14,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {128686#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {128686#true} is VALID [2022-04-15 11:45:14,416 INFO L290 TraceCheckUtils]: 47: Hoare triple {128686#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {128686#true} is VALID [2022-04-15 11:45:14,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {128686#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,420 INFO L290 TraceCheckUtils]: 53: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,421 INFO L290 TraceCheckUtils]: 56: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:14,423 INFO L290 TraceCheckUtils]: 59: Hoare triple {128691#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128692#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:45:14,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {128692#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {128687#false} is VALID [2022-04-15 11:45:14,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {128687#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {128687#false} is VALID [2022-04-15 11:45:14,423 INFO L290 TraceCheckUtils]: 62: Hoare triple {128687#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,423 INFO L290 TraceCheckUtils]: 63: Hoare triple {128687#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {128687#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {128687#false} ~skip~0 := 0; {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {128687#false} assume !false; {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {128687#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {128687#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {128687#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 70: Hoare triple {128687#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {128687#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {128687#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {128687#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {128687#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 75: Hoare triple {128687#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 76: Hoare triple {128687#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 77: Hoare triple {128687#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 78: Hoare triple {128687#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 79: Hoare triple {128687#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 80: Hoare triple {128687#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 81: Hoare triple {128687#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 82: Hoare triple {128687#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 83: Hoare triple {128687#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,425 INFO L290 TraceCheckUtils]: 84: Hoare triple {128687#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 85: Hoare triple {128687#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 86: Hoare triple {128687#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 87: Hoare triple {128687#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {128687#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 89: Hoare triple {128687#false} assume 8448 == #t~mem68;havoc #t~mem68; {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 90: Hoare triple {128687#false} assume !(~num1~0 > 0); {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 91: Hoare triple {128687#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 92: Hoare triple {128687#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,426 INFO L290 TraceCheckUtils]: 93: Hoare triple {128687#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 94: Hoare triple {128687#false} ~skip~0 := 0; {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 95: Hoare triple {128687#false} assume !false; {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 96: Hoare triple {128687#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 97: Hoare triple {128687#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {128687#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {128687#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {128687#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 101: Hoare triple {128687#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 102: Hoare triple {128687#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,427 INFO L290 TraceCheckUtils]: 103: Hoare triple {128687#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 104: Hoare triple {128687#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 105: Hoare triple {128687#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 106: Hoare triple {128687#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 107: Hoare triple {128687#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 108: Hoare triple {128687#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 109: Hoare triple {128687#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 110: Hoare triple {128687#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 111: Hoare triple {128687#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,428 INFO L290 TraceCheckUtils]: 112: Hoare triple {128687#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,448 INFO L290 TraceCheckUtils]: 113: Hoare triple {128687#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,448 INFO L290 TraceCheckUtils]: 114: Hoare triple {128687#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,448 INFO L290 TraceCheckUtils]: 115: Hoare triple {128687#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,448 INFO L290 TraceCheckUtils]: 116: Hoare triple {128687#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,448 INFO L290 TraceCheckUtils]: 117: Hoare triple {128687#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,448 INFO L290 TraceCheckUtils]: 118: Hoare triple {128687#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,449 INFO L290 TraceCheckUtils]: 119: Hoare triple {128687#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,449 INFO L290 TraceCheckUtils]: 120: Hoare triple {128687#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,449 INFO L290 TraceCheckUtils]: 121: Hoare triple {128687#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,449 INFO L290 TraceCheckUtils]: 122: Hoare triple {128687#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,451 INFO L290 TraceCheckUtils]: 123: Hoare triple {128687#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,451 INFO L290 TraceCheckUtils]: 124: Hoare triple {128687#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {128687#false} is VALID [2022-04-15 11:45:14,451 INFO L290 TraceCheckUtils]: 125: Hoare triple {128687#false} assume 8640 == #t~mem75;havoc #t~mem75; {128687#false} is VALID [2022-04-15 11:45:14,452 INFO L290 TraceCheckUtils]: 126: Hoare triple {128687#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {128687#false} is VALID [2022-04-15 11:45:14,452 INFO L290 TraceCheckUtils]: 127: Hoare triple {128687#false} assume !(9 == ~blastFlag~0); {128687#false} is VALID [2022-04-15 11:45:14,452 INFO L290 TraceCheckUtils]: 128: Hoare triple {128687#false} assume !(12 == ~blastFlag~0); {128687#false} is VALID [2022-04-15 11:45:14,452 INFO L290 TraceCheckUtils]: 129: Hoare triple {128687#false} assume !(15 == ~blastFlag~0); {128687#false} is VALID [2022-04-15 11:45:14,452 INFO L290 TraceCheckUtils]: 130: Hoare triple {128687#false} assume !(18 == ~blastFlag~0); {128687#false} is VALID [2022-04-15 11:45:14,452 INFO L290 TraceCheckUtils]: 131: Hoare triple {128687#false} assume 21 == ~blastFlag~0; {128687#false} is VALID [2022-04-15 11:45:14,452 INFO L290 TraceCheckUtils]: 132: Hoare triple {128687#false} assume !false; {128687#false} is VALID [2022-04-15 11:45:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:45:14,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:14,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142374750] [2022-04-15 11:45:14,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142374750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:14,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:14,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:14,453 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:14,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291163869] [2022-04-15 11:45:14,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291163869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:14,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:14,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:14,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447091202] [2022-04-15 11:45:14,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:14,455 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 133 [2022-04-15 11:45:14,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:14,455 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-15 11:45:14,535 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-15 11:45:14,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:14,536 INFO L87 Difference]: Start difference. First operand 1102 states and 1771 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-15 11:45:16,584 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-15 11:45:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:19,970 INFO L93 Difference]: Finished difference Result 2441 states and 3861 transitions. [2022-04-15 11:45:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:19,970 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 133 [2022-04-15 11:45:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:19,970 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-15 11:45:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-04-15 11:45:19,973 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-15 11:45:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-04-15 11:45:19,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 659 transitions. [2022-04-15 11:45:20,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 659 edges. 659 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:20,513 INFO L225 Difference]: With dead ends: 2441 [2022-04-15 11:45:20,513 INFO L226 Difference]: Without dead ends: 1365 [2022-04-15 11:45:20,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:20,515 INFO L913 BasicCegarLoop]: 161 mSDtfsCounter, 162 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:20,515 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 454 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 518 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:45:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2022-04-15 11:45:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1048. [2022-04-15 11:45:20,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:20,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1365 states. Second operand has 1048 states, 1043 states have (on average 1.6049856184084372) internal successors, (1674), 1043 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:20,578 INFO L74 IsIncluded]: Start isIncluded. First operand 1365 states. Second operand has 1048 states, 1043 states have (on average 1.6049856184084372) internal successors, (1674), 1043 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:20,578 INFO L87 Difference]: Start difference. First operand 1365 states. Second operand has 1048 states, 1043 states have (on average 1.6049856184084372) internal successors, (1674), 1043 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:20,629 INFO L93 Difference]: Finished difference Result 1365 states and 2109 transitions. [2022-04-15 11:45:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2109 transitions. [2022-04-15 11:45:20,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:20,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:20,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 1048 states, 1043 states have (on average 1.6049856184084372) internal successors, (1674), 1043 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1365 states. [2022-04-15 11:45:20,633 INFO L87 Difference]: Start difference. First operand has 1048 states, 1043 states have (on average 1.6049856184084372) internal successors, (1674), 1043 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1365 states. [2022-04-15 11:45:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:20,681 INFO L93 Difference]: Finished difference Result 1365 states and 2109 transitions. [2022-04-15 11:45:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2109 transitions. [2022-04-15 11:45:20,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:20,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:20,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:20,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1043 states have (on average 1.6049856184084372) internal successors, (1674), 1043 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1678 transitions. [2022-04-15 11:45:20,729 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1678 transitions. Word has length 133 [2022-04-15 11:45:20,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:20,729 INFO L478 AbstractCegarLoop]: Abstraction has 1048 states and 1678 transitions. [2022-04-15 11:45:20,729 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:20,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1048 states and 1678 transitions. [2022-04-15 11:45:23,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1678 edges. 1678 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1678 transitions. [2022-04-15 11:45:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 11:45:23,486 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:23,486 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:23,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:45:23,486 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:23,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash 376967106, now seen corresponding path program 1 times [2022-04-15 11:45:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:23,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1863045132] [2022-04-15 11:45:23,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:23,570 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:23,570 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:23,570 INFO L85 PathProgramCache]: Analyzing trace with hash 376967106, now seen corresponding path program 2 times [2022-04-15 11:45:23,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:23,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151595831] [2022-04-15 11:45:23,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:23,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:23,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {138413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {138406#true} is VALID [2022-04-15 11:45:23,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {138406#true} assume true; {138406#true} is VALID [2022-04-15 11:45:23,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {138406#true} {138406#true} #755#return; {138406#true} is VALID [2022-04-15 11:45:23,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {138406#true} call ULTIMATE.init(); {138413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:23,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {138413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {138406#true} is VALID [2022-04-15 11:45:23,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {138406#true} assume true; {138406#true} is VALID [2022-04-15 11:45:23,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {138406#true} {138406#true} #755#return; {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {138406#true} call #t~ret161 := main(); {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {138406#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {138406#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L272 TraceCheckUtils]: 7: Hoare triple {138406#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {138406#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {138406#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {138406#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {138406#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {138406#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {138406#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {138406#true} assume !false; {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {138406#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {138406#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {138406#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {138406#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {138406#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {138406#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {138406#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {138406#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {138406#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {138406#true} assume 8464 == #t~mem55;havoc #t~mem55; {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {138406#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {138406#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {138406#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {138406#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {138406#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {138406#true} ~skip~0 := 0; {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {138406#true} assume !false; {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {138406#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {138406#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {138406#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {138406#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {138406#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 37: Hoare triple {138406#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 38: Hoare triple {138406#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 39: Hoare triple {138406#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 40: Hoare triple {138406#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {138406#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {138406#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 43: Hoare triple {138406#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,760 INFO L290 TraceCheckUtils]: 44: Hoare triple {138406#true} assume 8496 == #t~mem58;havoc #t~mem58; {138406#true} is VALID [2022-04-15 11:45:23,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {138406#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {138406#true} is VALID [2022-04-15 11:45:23,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {138406#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {138406#true} is VALID [2022-04-15 11:45:23,761 INFO L290 TraceCheckUtils]: 47: Hoare triple {138406#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {138406#true} is VALID [2022-04-15 11:45:23,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {138406#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,763 INFO L290 TraceCheckUtils]: 49: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,763 INFO L290 TraceCheckUtils]: 50: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,764 INFO L290 TraceCheckUtils]: 51: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,764 INFO L290 TraceCheckUtils]: 52: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:23,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {138411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138412#(= |ssl3_accept_#t~mem53| 8656)} is VALID [2022-04-15 11:45:23,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {138412#(= |ssl3_accept_#t~mem53| 8656)} assume 8481 == #t~mem53;havoc #t~mem53; {138407#false} is VALID [2022-04-15 11:45:23,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {138407#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {138407#false} is VALID [2022-04-15 11:45:23,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {138407#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,768 INFO L290 TraceCheckUtils]: 64: Hoare triple {138407#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {138407#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {138407#false} ~skip~0 := 0; {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {138407#false} assume !false; {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {138407#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {138407#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {138407#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 71: Hoare triple {138407#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 72: Hoare triple {138407#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 73: Hoare triple {138407#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,769 INFO L290 TraceCheckUtils]: 74: Hoare triple {138407#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 75: Hoare triple {138407#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 76: Hoare triple {138407#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 77: Hoare triple {138407#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 78: Hoare triple {138407#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 79: Hoare triple {138407#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 80: Hoare triple {138407#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 81: Hoare triple {138407#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 82: Hoare triple {138407#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 83: Hoare triple {138407#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 84: Hoare triple {138407#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,770 INFO L290 TraceCheckUtils]: 85: Hoare triple {138407#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 86: Hoare triple {138407#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 87: Hoare triple {138407#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 88: Hoare triple {138407#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 89: Hoare triple {138407#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 90: Hoare triple {138407#false} assume 8448 == #t~mem68;havoc #t~mem68; {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 91: Hoare triple {138407#false} assume !(~num1~0 > 0); {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 92: Hoare triple {138407#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 93: Hoare triple {138407#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 94: Hoare triple {138407#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {138407#false} is VALID [2022-04-15 11:45:23,771 INFO L290 TraceCheckUtils]: 95: Hoare triple {138407#false} ~skip~0 := 0; {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 96: Hoare triple {138407#false} assume !false; {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 97: Hoare triple {138407#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 98: Hoare triple {138407#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 99: Hoare triple {138407#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 100: Hoare triple {138407#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 101: Hoare triple {138407#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 102: Hoare triple {138407#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 103: Hoare triple {138407#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,772 INFO L290 TraceCheckUtils]: 104: Hoare triple {138407#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 105: Hoare triple {138407#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 106: Hoare triple {138407#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 107: Hoare triple {138407#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 108: Hoare triple {138407#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 109: Hoare triple {138407#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 110: Hoare triple {138407#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 111: Hoare triple {138407#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 112: Hoare triple {138407#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 113: Hoare triple {138407#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,773 INFO L290 TraceCheckUtils]: 114: Hoare triple {138407#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 115: Hoare triple {138407#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {138407#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 117: Hoare triple {138407#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 118: Hoare triple {138407#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 119: Hoare triple {138407#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 120: Hoare triple {138407#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 121: Hoare triple {138407#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 122: Hoare triple {138407#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 123: Hoare triple {138407#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,774 INFO L290 TraceCheckUtils]: 124: Hoare triple {138407#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 125: Hoare triple {138407#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 126: Hoare triple {138407#false} assume 8640 == #t~mem75;havoc #t~mem75; {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 127: Hoare triple {138407#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 128: Hoare triple {138407#false} assume !(9 == ~blastFlag~0); {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 129: Hoare triple {138407#false} assume !(12 == ~blastFlag~0); {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 130: Hoare triple {138407#false} assume !(15 == ~blastFlag~0); {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 131: Hoare triple {138407#false} assume !(18 == ~blastFlag~0); {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 132: Hoare triple {138407#false} assume 21 == ~blastFlag~0; {138407#false} is VALID [2022-04-15 11:45:23,775 INFO L290 TraceCheckUtils]: 133: Hoare triple {138407#false} assume !false; {138407#false} is VALID [2022-04-15 11:45:23,776 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:45:23,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:23,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151595831] [2022-04-15 11:45:23,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151595831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:23,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:23,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:23,776 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:23,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1863045132] [2022-04-15 11:45:23,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1863045132] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:23,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:23,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:23,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306062073] [2022-04-15 11:45:23,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:23,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 11:45:23,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:23,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:23,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:23,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:23,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:23,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:23,860 INFO L87 Difference]: Start difference. First operand 1048 states and 1678 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:25,917 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-15 11:45:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:30,591 INFO L93 Difference]: Finished difference Result 2367 states and 3756 transitions. [2022-04-15 11:45:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 11:45:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:45:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-15 11:45:30,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-15 11:45:31,027 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-15 11:45:31,090 INFO L225 Difference]: With dead ends: 2367 [2022-04-15 11:45:31,091 INFO L226 Difference]: Without dead ends: 1345 [2022-04-15 11:45:31,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:31,092 INFO L913 BasicCegarLoop]: 302 mSDtfsCounter, 110 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:31,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 741 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 643 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:45:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-04-15 11:45:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1105. [2022-04-15 11:45:31,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:31,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1345 states. Second operand has 1105 states, 1100 states have (on average 1.5954545454545455) internal successors, (1755), 1100 states have internal predecessors, (1755), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,172 INFO L74 IsIncluded]: Start isIncluded. First operand 1345 states. Second operand has 1105 states, 1100 states have (on average 1.5954545454545455) internal successors, (1755), 1100 states have internal predecessors, (1755), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,172 INFO L87 Difference]: Start difference. First operand 1345 states. Second operand has 1105 states, 1100 states have (on average 1.5954545454545455) internal successors, (1755), 1100 states have internal predecessors, (1755), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:31,219 INFO L93 Difference]: Finished difference Result 1345 states and 2109 transitions. [2022-04-15 11:45:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2109 transitions. [2022-04-15 11:45:31,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:31,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:31,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 1105 states, 1100 states have (on average 1.5954545454545455) internal successors, (1755), 1100 states have internal predecessors, (1755), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1345 states. [2022-04-15 11:45:31,223 INFO L87 Difference]: Start difference. First operand has 1105 states, 1100 states have (on average 1.5954545454545455) internal successors, (1755), 1100 states have internal predecessors, (1755), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1345 states. [2022-04-15 11:45:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:31,270 INFO L93 Difference]: Finished difference Result 1345 states and 2109 transitions. [2022-04-15 11:45:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2109 transitions. [2022-04-15 11:45:31,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:31,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:31,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:31,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1100 states have (on average 1.5954545454545455) internal successors, (1755), 1100 states have internal predecessors, (1755), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1759 transitions. [2022-04-15 11:45:31,320 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1759 transitions. Word has length 134 [2022-04-15 11:45:31,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:31,321 INFO L478 AbstractCegarLoop]: Abstraction has 1105 states and 1759 transitions. [2022-04-15 11:45:31,321 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:31,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1105 states and 1759 transitions. [2022-04-15 11:45:35,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1759 edges. 1759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1759 transitions. [2022-04-15 11:45:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 11:45:35,022 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:35,022 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:35,023 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:45:35,023 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:35,023 INFO L85 PathProgramCache]: Analyzing trace with hash -477332652, now seen corresponding path program 1 times [2022-04-15 11:45:35,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:35,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776625329] [2022-04-15 11:45:35,112 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:35,112 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:35,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash -477332652, now seen corresponding path program 2 times [2022-04-15 11:45:35,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:35,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932597016] [2022-04-15 11:45:35,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:35,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:35,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:35,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {148059#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {148052#true} is VALID [2022-04-15 11:45:35,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {148052#true} assume true; {148052#true} is VALID [2022-04-15 11:45:35,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {148052#true} {148052#true} #755#return; {148052#true} is VALID [2022-04-15 11:45:35,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {148052#true} call ULTIMATE.init(); {148059#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:35,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {148059#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {148052#true} assume true; {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {148052#true} {148052#true} #755#return; {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {148052#true} call #t~ret161 := main(); {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {148052#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {148052#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L272 TraceCheckUtils]: 7: Hoare triple {148052#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {148052#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {148052#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {148052#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {148052#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {148052#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {148052#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {148052#true} assume !false; {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {148052#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {148052#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {148052#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {148052#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {148052#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {148052#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {148052#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {148052#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {148052#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {148052#true} assume 8464 == #t~mem55;havoc #t~mem55; {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {148052#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {148052#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {148052#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,318 INFO L290 TraceCheckUtils]: 28: Hoare triple {148052#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {148052#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {148052#true} ~skip~0 := 0; {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {148052#true} assume !false; {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {148052#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {148052#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {148052#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {148052#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {148052#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {148052#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {148052#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 39: Hoare triple {148052#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {148052#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {148052#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {148052#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 43: Hoare triple {148052#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {148052#true} assume 8496 == #t~mem58;havoc #t~mem58; {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {148052#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {148052#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {148052#true} is VALID [2022-04-15 11:45:35,320 INFO L290 TraceCheckUtils]: 47: Hoare triple {148052#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {148052#true} is VALID [2022-04-15 11:45:35,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {148052#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,322 INFO L290 TraceCheckUtils]: 49: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,324 INFO L290 TraceCheckUtils]: 52: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,325 INFO L290 TraceCheckUtils]: 54: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,325 INFO L290 TraceCheckUtils]: 55: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,326 INFO L290 TraceCheckUtils]: 56: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,326 INFO L290 TraceCheckUtils]: 57: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,327 INFO L290 TraceCheckUtils]: 58: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,327 INFO L290 TraceCheckUtils]: 59: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,328 INFO L290 TraceCheckUtils]: 60: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,328 INFO L290 TraceCheckUtils]: 61: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,331 INFO L290 TraceCheckUtils]: 67: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,331 INFO L290 TraceCheckUtils]: 68: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,332 INFO L290 TraceCheckUtils]: 69: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,332 INFO L290 TraceCheckUtils]: 70: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,333 INFO L290 TraceCheckUtils]: 71: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,333 INFO L290 TraceCheckUtils]: 72: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,334 INFO L290 TraceCheckUtils]: 73: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,334 INFO L290 TraceCheckUtils]: 74: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,335 INFO L290 TraceCheckUtils]: 75: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,336 INFO L290 TraceCheckUtils]: 77: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,336 INFO L290 TraceCheckUtils]: 78: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,336 INFO L290 TraceCheckUtils]: 79: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,337 INFO L290 TraceCheckUtils]: 80: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,338 INFO L290 TraceCheckUtils]: 82: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,339 INFO L290 TraceCheckUtils]: 84: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,340 INFO L290 TraceCheckUtils]: 85: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:35,340 INFO L290 TraceCheckUtils]: 86: Hoare triple {148057#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {148058#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-15 11:45:35,340 INFO L290 TraceCheckUtils]: 87: Hoare triple {148058#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 88: Hoare triple {148053#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 89: Hoare triple {148053#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 90: Hoare triple {148053#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 91: Hoare triple {148053#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 92: Hoare triple {148053#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 93: Hoare triple {148053#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 94: Hoare triple {148053#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 95: Hoare triple {148053#false} ~skip~0 := 0; {148053#false} is VALID [2022-04-15 11:45:35,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {148053#false} assume !false; {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 97: Hoare triple {148053#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 98: Hoare triple {148053#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 99: Hoare triple {148053#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 100: Hoare triple {148053#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 101: Hoare triple {148053#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 102: Hoare triple {148053#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 103: Hoare triple {148053#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 104: Hoare triple {148053#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 105: Hoare triple {148053#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,342 INFO L290 TraceCheckUtils]: 106: Hoare triple {148053#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 107: Hoare triple {148053#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 108: Hoare triple {148053#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 109: Hoare triple {148053#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 110: Hoare triple {148053#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 111: Hoare triple {148053#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 112: Hoare triple {148053#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 113: Hoare triple {148053#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 114: Hoare triple {148053#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 115: Hoare triple {148053#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,343 INFO L290 TraceCheckUtils]: 116: Hoare triple {148053#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 117: Hoare triple {148053#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 118: Hoare triple {148053#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 119: Hoare triple {148053#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 120: Hoare triple {148053#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 121: Hoare triple {148053#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 122: Hoare triple {148053#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 123: Hoare triple {148053#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 124: Hoare triple {148053#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 125: Hoare triple {148053#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {148053#false} is VALID [2022-04-15 11:45:35,344 INFO L290 TraceCheckUtils]: 126: Hoare triple {148053#false} assume 8640 == #t~mem75;havoc #t~mem75; {148053#false} is VALID [2022-04-15 11:45:35,345 INFO L290 TraceCheckUtils]: 127: Hoare triple {148053#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {148053#false} is VALID [2022-04-15 11:45:35,345 INFO L290 TraceCheckUtils]: 128: Hoare triple {148053#false} assume !(9 == ~blastFlag~0); {148053#false} is VALID [2022-04-15 11:45:35,345 INFO L290 TraceCheckUtils]: 129: Hoare triple {148053#false} assume !(12 == ~blastFlag~0); {148053#false} is VALID [2022-04-15 11:45:35,345 INFO L290 TraceCheckUtils]: 130: Hoare triple {148053#false} assume !(15 == ~blastFlag~0); {148053#false} is VALID [2022-04-15 11:45:35,345 INFO L290 TraceCheckUtils]: 131: Hoare triple {148053#false} assume !(18 == ~blastFlag~0); {148053#false} is VALID [2022-04-15 11:45:35,345 INFO L290 TraceCheckUtils]: 132: Hoare triple {148053#false} assume 21 == ~blastFlag~0; {148053#false} is VALID [2022-04-15 11:45:35,345 INFO L290 TraceCheckUtils]: 133: Hoare triple {148053#false} assume !false; {148053#false} is VALID [2022-04-15 11:45:35,346 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-15 11:45:35,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:35,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932597016] [2022-04-15 11:45:35,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932597016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:35,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:35,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:35,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:35,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776625329] [2022-04-15 11:45:35,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776625329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:35,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:35,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:35,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592092646] [2022-04-15 11:45:35,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:35,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 11:45:35,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:35,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:35,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:35,436 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:35,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:35,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:35,437 INFO L87 Difference]: Start difference. First operand 1105 states and 1759 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:37,408 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-15 11:45:41,223 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-15 11:45:44,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:46,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:49,962 INFO L93 Difference]: Finished difference Result 2567 states and 4038 transitions. [2022-04-15 11:45:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:49,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 11:45:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-04-15 11:45:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-04-15 11:45:49,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 659 transitions. [2022-04-15 11:45:50,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 659 edges. 659 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:50,515 INFO L225 Difference]: With dead ends: 2567 [2022-04-15 11:45:50,516 INFO L226 Difference]: Without dead ends: 1488 [2022-04-15 11:45:50,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:50,518 INFO L913 BasicCegarLoop]: 161 mSDtfsCounter, 134 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:50,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 455 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-15 11:45:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-04-15 11:45:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1234. [2022-04-15 11:45:50,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:50,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1488 states. Second operand has 1234 states, 1229 states have (on average 1.6037428803905613) internal successors, (1971), 1229 states have internal predecessors, (1971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:50,603 INFO L74 IsIncluded]: Start isIncluded. First operand 1488 states. Second operand has 1234 states, 1229 states have (on average 1.6037428803905613) internal successors, (1971), 1229 states have internal predecessors, (1971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:50,604 INFO L87 Difference]: Start difference. First operand 1488 states. Second operand has 1234 states, 1229 states have (on average 1.6037428803905613) internal successors, (1971), 1229 states have internal predecessors, (1971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:50,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:50,660 INFO L93 Difference]: Finished difference Result 1488 states and 2310 transitions. [2022-04-15 11:45:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2310 transitions. [2022-04-15 11:45:50,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:50,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:50,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 1234 states, 1229 states have (on average 1.6037428803905613) internal successors, (1971), 1229 states have internal predecessors, (1971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1488 states. [2022-04-15 11:45:50,664 INFO L87 Difference]: Start difference. First operand has 1234 states, 1229 states have (on average 1.6037428803905613) internal successors, (1971), 1229 states have internal predecessors, (1971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1488 states. [2022-04-15 11:45:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:50,721 INFO L93 Difference]: Finished difference Result 1488 states and 2310 transitions. [2022-04-15 11:45:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2310 transitions. [2022-04-15 11:45:50,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:50,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:50,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:50,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1229 states have (on average 1.6037428803905613) internal successors, (1971), 1229 states have internal predecessors, (1971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1975 transitions. [2022-04-15 11:45:50,795 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1975 transitions. Word has length 134 [2022-04-15 11:45:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:50,795 INFO L478 AbstractCegarLoop]: Abstraction has 1234 states and 1975 transitions. [2022-04-15 11:45:50,795 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:50,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1234 states and 1975 transitions. [2022-04-15 11:45:54,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1975 edges. 1975 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1975 transitions. [2022-04-15 11:45:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 11:45:54,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:54,225 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:54,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:45:54,225 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:54,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:54,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1581607680, now seen corresponding path program 1 times [2022-04-15 11:45:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:54,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1363960299] [2022-04-15 11:45:54,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:54,313 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:54,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:54,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1581607680, now seen corresponding path program 2 times [2022-04-15 11:45:54,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:54,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983039441] [2022-04-15 11:45:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:54,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:54,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {158649#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158642#true} is VALID [2022-04-15 11:45:54,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {158642#true} assume true; {158642#true} is VALID [2022-04-15 11:45:54,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158642#true} {158642#true} #755#return; {158642#true} is VALID [2022-04-15 11:45:54,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {158642#true} call ULTIMATE.init(); {158649#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:45:54,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {158649#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {158642#true} is VALID [2022-04-15 11:45:54,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {158642#true} assume true; {158642#true} is VALID [2022-04-15 11:45:54,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158642#true} {158642#true} #755#return; {158642#true} is VALID [2022-04-15 11:45:54,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {158642#true} call #t~ret161 := main(); {158642#true} is VALID [2022-04-15 11:45:54,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {158642#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {158642#true} is VALID [2022-04-15 11:45:54,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {158642#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L272 TraceCheckUtils]: 7: Hoare triple {158642#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {158642#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {158642#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {158642#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {158642#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {158642#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {158642#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {158642#true} assume !false; {158642#true} is VALID [2022-04-15 11:45:54,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {158642#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {158642#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {158642#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {158642#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {158642#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {158642#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {158642#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {158642#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {158642#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {158642#true} assume 8464 == #t~mem55;havoc #t~mem55; {158642#true} is VALID [2022-04-15 11:45:54,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {158642#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {158642#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {158642#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {158642#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {158642#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {158642#true} ~skip~0 := 0; {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {158642#true} assume !false; {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {158642#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {158642#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {158642#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {158642#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {158642#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {158642#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {158642#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {158642#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {158642#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {158642#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {158642#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {158642#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {158642#true} assume 8496 == #t~mem58;havoc #t~mem58; {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {158642#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {158642#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {158642#true} is VALID [2022-04-15 11:45:54,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {158642#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {158642#true} is VALID [2022-04-15 11:45:54,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {158642#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,531 INFO L290 TraceCheckUtils]: 52: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,532 INFO L290 TraceCheckUtils]: 54: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,532 INFO L290 TraceCheckUtils]: 55: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,533 INFO L290 TraceCheckUtils]: 57: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,533 INFO L290 TraceCheckUtils]: 58: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:45:54,534 INFO L290 TraceCheckUtils]: 60: Hoare triple {158647#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {158648#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 61: Hoare triple {158648#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 62: Hoare triple {158643#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 63: Hoare triple {158643#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 64: Hoare triple {158643#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {158643#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {158643#false} ~skip~0 := 0; {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 67: Hoare triple {158643#false} assume !false; {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 68: Hoare triple {158643#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {158643#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 70: Hoare triple {158643#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 71: Hoare triple {158643#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {158643#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {158643#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {158643#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 75: Hoare triple {158643#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 76: Hoare triple {158643#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 77: Hoare triple {158643#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 78: Hoare triple {158643#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,536 INFO L290 TraceCheckUtils]: 79: Hoare triple {158643#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {158643#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {158643#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 82: Hoare triple {158643#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 83: Hoare triple {158643#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 84: Hoare triple {158643#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 85: Hoare triple {158643#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 86: Hoare triple {158643#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 87: Hoare triple {158643#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 88: Hoare triple {158643#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 89: Hoare triple {158643#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,537 INFO L290 TraceCheckUtils]: 90: Hoare triple {158643#false} assume 8448 == #t~mem68;havoc #t~mem68; {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 91: Hoare triple {158643#false} assume !(~num1~0 > 0); {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 92: Hoare triple {158643#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 93: Hoare triple {158643#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 94: Hoare triple {158643#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 95: Hoare triple {158643#false} ~skip~0 := 0; {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 96: Hoare triple {158643#false} assume !false; {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 97: Hoare triple {158643#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 98: Hoare triple {158643#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 99: Hoare triple {158643#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 100: Hoare triple {158643#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,538 INFO L290 TraceCheckUtils]: 101: Hoare triple {158643#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 102: Hoare triple {158643#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 103: Hoare triple {158643#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 104: Hoare triple {158643#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 105: Hoare triple {158643#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 106: Hoare triple {158643#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 107: Hoare triple {158643#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 108: Hoare triple {158643#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 109: Hoare triple {158643#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 110: Hoare triple {158643#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,539 INFO L290 TraceCheckUtils]: 111: Hoare triple {158643#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 112: Hoare triple {158643#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 113: Hoare triple {158643#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 114: Hoare triple {158643#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 115: Hoare triple {158643#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 116: Hoare triple {158643#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 117: Hoare triple {158643#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 118: Hoare triple {158643#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 119: Hoare triple {158643#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 120: Hoare triple {158643#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,540 INFO L290 TraceCheckUtils]: 121: Hoare triple {158643#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 122: Hoare triple {158643#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 123: Hoare triple {158643#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 124: Hoare triple {158643#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 125: Hoare triple {158643#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 126: Hoare triple {158643#false} assume 8640 == #t~mem75;havoc #t~mem75; {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 127: Hoare triple {158643#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 128: Hoare triple {158643#false} assume !(9 == ~blastFlag~0); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 129: Hoare triple {158643#false} assume !(12 == ~blastFlag~0); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 130: Hoare triple {158643#false} assume !(15 == ~blastFlag~0); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 131: Hoare triple {158643#false} assume !(18 == ~blastFlag~0); {158643#false} is VALID [2022-04-15 11:45:54,541 INFO L290 TraceCheckUtils]: 132: Hoare triple {158643#false} assume 21 == ~blastFlag~0; {158643#false} is VALID [2022-04-15 11:45:54,542 INFO L290 TraceCheckUtils]: 133: Hoare triple {158643#false} assume !false; {158643#false} is VALID [2022-04-15 11:45:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:45:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:54,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983039441] [2022-04-15 11:45:54,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983039441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:54,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:54,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:54,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1363960299] [2022-04-15 11:45:54,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1363960299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:54,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:54,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:54,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824078752] [2022-04-15 11:45:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 11:45:54,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:54,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:54,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:54,632 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:54,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:54,633 INFO L87 Difference]: Start difference. First operand 1234 states and 1975 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:56,686 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-15 11:46:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:00,131 INFO L93 Difference]: Finished difference Result 2703 states and 4267 transitions. [2022-04-15 11:46:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 134 [2022-04-15 11:46:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-04-15 11:46:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-04-15 11:46:00,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 659 transitions. [2022-04-15 11:46:00,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 659 edges. 659 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:00,688 INFO L225 Difference]: With dead ends: 2703 [2022-04-15 11:46:00,688 INFO L226 Difference]: Without dead ends: 1495 [2022-04-15 11:46:00,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:00,690 INFO L913 BasicCegarLoop]: 152 mSDtfsCounter, 161 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:00,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 436 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 508 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:46:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-04-15 11:46:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1177. [2022-04-15 11:46:00,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:00,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1495 states. Second operand has 1177 states, 1172 states have (on average 1.5964163822525597) internal successors, (1871), 1172 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:00,768 INFO L74 IsIncluded]: Start isIncluded. First operand 1495 states. Second operand has 1177 states, 1172 states have (on average 1.5964163822525597) internal successors, (1871), 1172 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:00,769 INFO L87 Difference]: Start difference. First operand 1495 states. Second operand has 1177 states, 1172 states have (on average 1.5964163822525597) internal successors, (1871), 1172 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:00,825 INFO L93 Difference]: Finished difference Result 1495 states and 2307 transitions. [2022-04-15 11:46:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2307 transitions. [2022-04-15 11:46:00,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:00,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:00,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1172 states have (on average 1.5964163822525597) internal successors, (1871), 1172 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1495 states. [2022-04-15 11:46:00,828 INFO L87 Difference]: Start difference. First operand has 1177 states, 1172 states have (on average 1.5964163822525597) internal successors, (1871), 1172 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1495 states. [2022-04-15 11:46:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:00,885 INFO L93 Difference]: Finished difference Result 1495 states and 2307 transitions. [2022-04-15 11:46:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2307 transitions. [2022-04-15 11:46:00,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:00,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:00,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:00,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1172 states have (on average 1.5964163822525597) internal successors, (1871), 1172 states have internal predecessors, (1871), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1875 transitions. [2022-04-15 11:46:00,957 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1875 transitions. Word has length 134 [2022-04-15 11:46:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:00,957 INFO L478 AbstractCegarLoop]: Abstraction has 1177 states and 1875 transitions. [2022-04-15 11:46:00,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:00,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1177 states and 1875 transitions. [2022-04-15 11:46:04,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1875 edges. 1875 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1875 transitions. [2022-04-15 11:46:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 11:46:04,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:04,786 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:04,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:46:04,786 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 341501800, now seen corresponding path program 1 times [2022-04-15 11:46:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:04,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520593616] [2022-04-15 11:46:04,885 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:04,886 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:04,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash 341501800, now seen corresponding path program 2 times [2022-04-15 11:46:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:04,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680229195] [2022-04-15 11:46:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:05,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {169411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {169404#true} is VALID [2022-04-15 11:46:05,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {169404#true} assume true; {169404#true} is VALID [2022-04-15 11:46:05,062 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169404#true} {169404#true} #755#return; {169404#true} is VALID [2022-04-15 11:46:05,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {169404#true} call ULTIMATE.init(); {169411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:05,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {169411#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {169404#true} is VALID [2022-04-15 11:46:05,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {169404#true} assume true; {169404#true} is VALID [2022-04-15 11:46:05,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169404#true} {169404#true} #755#return; {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {169404#true} call #t~ret161 := main(); {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {169404#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {169404#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L272 TraceCheckUtils]: 7: Hoare triple {169404#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {169404#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {169404#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {169404#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {169404#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {169404#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {169404#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {169404#true} assume !false; {169404#true} is VALID [2022-04-15 11:46:05,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {169404#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {169404#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {169404#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {169404#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {169404#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {169404#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {169404#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {169404#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {169404#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {169404#true} assume 8464 == #t~mem55;havoc #t~mem55; {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {169404#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {169404#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {169404#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {169404#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {169404#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {169404#true} ~skip~0 := 0; {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {169404#true} assume !false; {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {169404#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {169404#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {169404#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {169404#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {169404#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {169404#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {169404#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {169404#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {169404#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {169404#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {169404#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {169404#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {169404#true} assume 8496 == #t~mem58;havoc #t~mem58; {169404#true} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {169404#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {169404#true} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {169404#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {169404#true} is VALID [2022-04-15 11:46:05,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {169404#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {169404#true} is VALID [2022-04-15 11:46:05,068 INFO L290 TraceCheckUtils]: 48: Hoare triple {169404#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,068 INFO L290 TraceCheckUtils]: 49: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,069 INFO L290 TraceCheckUtils]: 51: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 59: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,076 INFO L290 TraceCheckUtils]: 68: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,076 INFO L290 TraceCheckUtils]: 69: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,076 INFO L290 TraceCheckUtils]: 70: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,077 INFO L290 TraceCheckUtils]: 71: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,077 INFO L290 TraceCheckUtils]: 72: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,078 INFO L290 TraceCheckUtils]: 74: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,078 INFO L290 TraceCheckUtils]: 75: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,079 INFO L290 TraceCheckUtils]: 77: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,079 INFO L290 TraceCheckUtils]: 78: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,082 INFO L290 TraceCheckUtils]: 83: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:05,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {169409#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {169410#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-15 11:46:05,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {169410#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,082 INFO L290 TraceCheckUtils]: 86: Hoare triple {169405#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 87: Hoare triple {169405#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 88: Hoare triple {169405#false} assume 8673 == #t~mem80;havoc #t~mem80; {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 89: Hoare triple {169405#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 90: Hoare triple {169405#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 91: Hoare triple {169405#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {169405#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {169405#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {169405#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,083 INFO L290 TraceCheckUtils]: 95: Hoare triple {169405#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {169405#false} ~skip~0 := 0; {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {169405#false} assume !false; {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 98: Hoare triple {169405#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 99: Hoare triple {169405#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 100: Hoare triple {169405#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 101: Hoare triple {169405#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 102: Hoare triple {169405#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 103: Hoare triple {169405#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,084 INFO L290 TraceCheckUtils]: 104: Hoare triple {169405#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 105: Hoare triple {169405#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 106: Hoare triple {169405#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {169405#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {169405#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 109: Hoare triple {169405#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {169405#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 111: Hoare triple {169405#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 112: Hoare triple {169405#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 113: Hoare triple {169405#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,085 INFO L290 TraceCheckUtils]: 114: Hoare triple {169405#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 115: Hoare triple {169405#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 116: Hoare triple {169405#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 117: Hoare triple {169405#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 118: Hoare triple {169405#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 119: Hoare triple {169405#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 120: Hoare triple {169405#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 121: Hoare triple {169405#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 122: Hoare triple {169405#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 123: Hoare triple {169405#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,086 INFO L290 TraceCheckUtils]: 124: Hoare triple {169405#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 125: Hoare triple {169405#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 126: Hoare triple {169405#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 127: Hoare triple {169405#false} assume 8640 == #t~mem75;havoc #t~mem75; {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 128: Hoare triple {169405#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 129: Hoare triple {169405#false} assume !(9 == ~blastFlag~0); {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 130: Hoare triple {169405#false} assume !(12 == ~blastFlag~0); {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 131: Hoare triple {169405#false} assume !(15 == ~blastFlag~0); {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 132: Hoare triple {169405#false} assume !(18 == ~blastFlag~0); {169405#false} is VALID [2022-04-15 11:46:05,087 INFO L290 TraceCheckUtils]: 133: Hoare triple {169405#false} assume 21 == ~blastFlag~0; {169405#false} is VALID [2022-04-15 11:46:05,088 INFO L290 TraceCheckUtils]: 134: Hoare triple {169405#false} assume !false; {169405#false} is VALID [2022-04-15 11:46:05,088 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-15 11:46:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:05,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680229195] [2022-04-15 11:46:05,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680229195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:05,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:05,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:05,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:05,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520593616] [2022-04-15 11:46:05,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520593616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:05,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:05,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:05,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545950259] [2022-04-15 11:46:05,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:05,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 11:46:05,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:05,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:05,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:05,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:05,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:05,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:05,194 INFO L87 Difference]: Start difference. First operand 1177 states and 1875 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:11,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:18,399 INFO L93 Difference]: Finished difference Result 2598 states and 4111 transitions. [2022-04-15 11:46:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 11:46:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 11:46:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-15 11:46:18,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-15 11:46:18,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 593 edges. 593 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:18,896 INFO L225 Difference]: With dead ends: 2598 [2022-04-15 11:46:18,896 INFO L226 Difference]: Without dead ends: 1447 [2022-04-15 11:46:18,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:18,898 INFO L913 BasicCegarLoop]: 293 mSDtfsCounter, 71 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:18,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 723 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 11:46:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-04-15 11:46:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1306. [2022-04-15 11:46:19,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:19,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1447 states. Second operand has 1306 states, 1301 states have (on average 1.5972328977709453) internal successors, (2078), 1301 states have internal predecessors, (2078), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:19,028 INFO L74 IsIncluded]: Start isIncluded. First operand 1447 states. Second operand has 1306 states, 1301 states have (on average 1.5972328977709453) internal successors, (2078), 1301 states have internal predecessors, (2078), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:19,029 INFO L87 Difference]: Start difference. First operand 1447 states. Second operand has 1306 states, 1301 states have (on average 1.5972328977709453) internal successors, (2078), 1301 states have internal predecessors, (2078), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:19,114 INFO L93 Difference]: Finished difference Result 1447 states and 2266 transitions. [2022-04-15 11:46:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2266 transitions. [2022-04-15 11:46:19,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:19,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:19,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 1306 states, 1301 states have (on average 1.5972328977709453) internal successors, (2078), 1301 states have internal predecessors, (2078), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1447 states. [2022-04-15 11:46:19,119 INFO L87 Difference]: Start difference. First operand has 1306 states, 1301 states have (on average 1.5972328977709453) internal successors, (2078), 1301 states have internal predecessors, (2078), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1447 states. [2022-04-15 11:46:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:19,191 INFO L93 Difference]: Finished difference Result 1447 states and 2266 transitions. [2022-04-15 11:46:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2266 transitions. [2022-04-15 11:46:19,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:19,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:19,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:19,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1301 states have (on average 1.5972328977709453) internal successors, (2078), 1301 states have internal predecessors, (2078), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2082 transitions. [2022-04-15 11:46:19,269 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2082 transitions. Word has length 135 [2022-04-15 11:46:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:19,269 INFO L478 AbstractCegarLoop]: Abstraction has 1306 states and 2082 transitions. [2022-04-15 11:46:19,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:19,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1306 states and 2082 transitions. [2022-04-15 11:46:22,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2082 edges. 2082 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2082 transitions. [2022-04-15 11:46:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 11:46:22,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:22,668 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:22,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:46:22,668 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:22,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash -244774422, now seen corresponding path program 1 times [2022-04-15 11:46:22,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:22,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [92477708] [2022-04-15 11:46:22,749 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:22,750 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:22,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:22,750 INFO L85 PathProgramCache]: Analyzing trace with hash -244774422, now seen corresponding path program 2 times [2022-04-15 11:46:22,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:22,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775741080] [2022-04-15 11:46:22,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:22,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {180125#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {180118#true} is VALID [2022-04-15 11:46:22,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {180118#true} assume true; {180118#true} is VALID [2022-04-15 11:46:22,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180118#true} {180118#true} #755#return; {180118#true} is VALID [2022-04-15 11:46:22,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {180118#true} call ULTIMATE.init(); {180125#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:22,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {180125#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {180118#true} is VALID [2022-04-15 11:46:22,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {180118#true} assume true; {180118#true} is VALID [2022-04-15 11:46:22,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180118#true} {180118#true} #755#return; {180118#true} is VALID [2022-04-15 11:46:22,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {180118#true} call #t~ret161 := main(); {180118#true} is VALID [2022-04-15 11:46:22,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {180118#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {180118#true} is VALID [2022-04-15 11:46:22,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {180118#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,973 INFO L272 TraceCheckUtils]: 7: Hoare triple {180118#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {180118#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {180118#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {180118#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {180118#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {180118#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {180118#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {180118#true} assume !false; {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {180118#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {180118#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {180118#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {180118#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {180118#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {180118#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {180118#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {180118#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {180118#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {180118#true} assume 8464 == #t~mem55;havoc #t~mem55; {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {180118#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {180118#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {180118#true} is VALID [2022-04-15 11:46:22,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {180118#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {180118#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {180118#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {180118#true} ~skip~0 := 0; {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {180118#true} assume !false; {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {180118#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {180118#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {180118#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {180118#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {180118#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {180118#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {180118#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {180118#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {180118#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {180118#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {180118#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {180118#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {180118#true} assume 8496 == #t~mem58;havoc #t~mem58; {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {180118#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {180118#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {180118#true} is VALID [2022-04-15 11:46:22,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {180118#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {180118#true} is VALID [2022-04-15 11:46:22,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {180118#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,980 INFO L290 TraceCheckUtils]: 50: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,981 INFO L290 TraceCheckUtils]: 51: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,982 INFO L290 TraceCheckUtils]: 54: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,982 INFO L290 TraceCheckUtils]: 55: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,985 INFO L290 TraceCheckUtils]: 60: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,988 INFO L290 TraceCheckUtils]: 66: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,988 INFO L290 TraceCheckUtils]: 67: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,989 INFO L290 TraceCheckUtils]: 68: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,989 INFO L290 TraceCheckUtils]: 69: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,990 INFO L290 TraceCheckUtils]: 70: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,990 INFO L290 TraceCheckUtils]: 71: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,990 INFO L290 TraceCheckUtils]: 72: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,991 INFO L290 TraceCheckUtils]: 73: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,991 INFO L290 TraceCheckUtils]: 74: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,992 INFO L290 TraceCheckUtils]: 75: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,992 INFO L290 TraceCheckUtils]: 76: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,993 INFO L290 TraceCheckUtils]: 77: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,993 INFO L290 TraceCheckUtils]: 78: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,994 INFO L290 TraceCheckUtils]: 79: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,994 INFO L290 TraceCheckUtils]: 80: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,995 INFO L290 TraceCheckUtils]: 81: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,995 INFO L290 TraceCheckUtils]: 82: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,997 INFO L290 TraceCheckUtils]: 85: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,997 INFO L290 TraceCheckUtils]: 86: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:22,998 INFO L290 TraceCheckUtils]: 87: Hoare triple {180123#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {180124#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-15 11:46:22,998 INFO L290 TraceCheckUtils]: 88: Hoare triple {180124#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {180119#false} is VALID [2022-04-15 11:46:22,998 INFO L290 TraceCheckUtils]: 89: Hoare triple {180119#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {180119#false} is VALID [2022-04-15 11:46:22,998 INFO L290 TraceCheckUtils]: 90: Hoare triple {180119#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 91: Hoare triple {180119#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 92: Hoare triple {180119#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 93: Hoare triple {180119#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 94: Hoare triple {180119#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 95: Hoare triple {180119#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 96: Hoare triple {180119#false} ~skip~0 := 0; {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 97: Hoare triple {180119#false} assume !false; {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 98: Hoare triple {180119#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 99: Hoare triple {180119#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:22,999 INFO L290 TraceCheckUtils]: 100: Hoare triple {180119#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 101: Hoare triple {180119#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 102: Hoare triple {180119#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 103: Hoare triple {180119#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 104: Hoare triple {180119#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 105: Hoare triple {180119#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 106: Hoare triple {180119#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 107: Hoare triple {180119#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 108: Hoare triple {180119#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 109: Hoare triple {180119#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 110: Hoare triple {180119#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,000 INFO L290 TraceCheckUtils]: 111: Hoare triple {180119#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 112: Hoare triple {180119#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 113: Hoare triple {180119#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 114: Hoare triple {180119#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 115: Hoare triple {180119#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 116: Hoare triple {180119#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 117: Hoare triple {180119#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 118: Hoare triple {180119#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 119: Hoare triple {180119#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 120: Hoare triple {180119#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 121: Hoare triple {180119#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,001 INFO L290 TraceCheckUtils]: 122: Hoare triple {180119#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 123: Hoare triple {180119#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 124: Hoare triple {180119#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 125: Hoare triple {180119#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 126: Hoare triple {180119#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 127: Hoare triple {180119#false} assume 8640 == #t~mem75;havoc #t~mem75; {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 128: Hoare triple {180119#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 129: Hoare triple {180119#false} assume !(9 == ~blastFlag~0); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 130: Hoare triple {180119#false} assume !(12 == ~blastFlag~0); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 131: Hoare triple {180119#false} assume !(15 == ~blastFlag~0); {180119#false} is VALID [2022-04-15 11:46:23,002 INFO L290 TraceCheckUtils]: 132: Hoare triple {180119#false} assume !(18 == ~blastFlag~0); {180119#false} is VALID [2022-04-15 11:46:23,003 INFO L290 TraceCheckUtils]: 133: Hoare triple {180119#false} assume 21 == ~blastFlag~0; {180119#false} is VALID [2022-04-15 11:46:23,003 INFO L290 TraceCheckUtils]: 134: Hoare triple {180119#false} assume !false; {180119#false} is VALID [2022-04-15 11:46:23,003 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-15 11:46:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:23,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775741080] [2022-04-15 11:46:23,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775741080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:23,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:23,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:23,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:23,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [92477708] [2022-04-15 11:46:23,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [92477708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:23,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:23,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964932736] [2022-04-15 11:46:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 11:46:23,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:23,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:23,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:23,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:23,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:23,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:23,119 INFO L87 Difference]: Start difference. First operand 1306 states and 2082 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:27,681 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-15 11:46:30,874 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-15 11:46:33,991 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-15 11:46:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:37,665 INFO L93 Difference]: Finished difference Result 2847 states and 4482 transitions. [2022-04-15 11:46:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 135 [2022-04-15 11:46:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:37,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2022-04-15 11:46:37,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2022-04-15 11:46:37,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 658 transitions. [2022-04-15 11:46:38,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 658 edges. 658 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:38,251 INFO L225 Difference]: With dead ends: 2847 [2022-04-15 11:46:38,251 INFO L226 Difference]: Without dead ends: 1561 [2022-04-15 11:46:38,252 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:38,253 INFO L913 BasicCegarLoop]: 164 mSDtfsCounter, 134 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:38,253 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 460 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-15 11:46:38,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-04-15 11:46:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1312. [2022-04-15 11:46:38,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:38,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1561 states. Second operand has 1312 states, 1307 states have (on average 1.596786534047437) internal successors, (2087), 1307 states have internal predecessors, (2087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:38,348 INFO L74 IsIncluded]: Start isIncluded. First operand 1561 states. Second operand has 1312 states, 1307 states have (on average 1.596786534047437) internal successors, (2087), 1307 states have internal predecessors, (2087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:38,349 INFO L87 Difference]: Start difference. First operand 1561 states. Second operand has 1312 states, 1307 states have (on average 1.596786534047437) internal successors, (2087), 1307 states have internal predecessors, (2087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:38,422 INFO L93 Difference]: Finished difference Result 1561 states and 2421 transitions. [2022-04-15 11:46:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2421 transitions. [2022-04-15 11:46:38,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:38,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:38,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 1312 states, 1307 states have (on average 1.596786534047437) internal successors, (2087), 1307 states have internal predecessors, (2087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1561 states. [2022-04-15 11:46:38,426 INFO L87 Difference]: Start difference. First operand has 1312 states, 1307 states have (on average 1.596786534047437) internal successors, (2087), 1307 states have internal predecessors, (2087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1561 states. [2022-04-15 11:46:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:38,501 INFO L93 Difference]: Finished difference Result 1561 states and 2421 transitions. [2022-04-15 11:46:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2421 transitions. [2022-04-15 11:46:38,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:38,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:38,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:38,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1307 states have (on average 1.596786534047437) internal successors, (2087), 1307 states have internal predecessors, (2087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2091 transitions. [2022-04-15 11:46:38,569 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2091 transitions. Word has length 135 [2022-04-15 11:46:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:38,569 INFO L478 AbstractCegarLoop]: Abstraction has 1312 states and 2091 transitions. [2022-04-15 11:46:38,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:38,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1312 states and 2091 transitions. [2022-04-15 11:46:43,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2091 edges. 2090 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2091 transitions. [2022-04-15 11:46:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:46:43,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:43,192 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:43,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:46:43,193 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -379683827, now seen corresponding path program 1 times [2022-04-15 11:46:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [215040050] [2022-04-15 11:46:43,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:43,283 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:43,283 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:43,283 INFO L85 PathProgramCache]: Analyzing trace with hash -379683827, now seen corresponding path program 2 times [2022-04-15 11:46:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:43,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164990832] [2022-04-15 11:46:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:43,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:43,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {191577#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {191570#true} is VALID [2022-04-15 11:46:43,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {191570#true} assume true; {191570#true} is VALID [2022-04-15 11:46:43,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {191570#true} {191570#true} #755#return; {191570#true} is VALID [2022-04-15 11:46:43,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {191570#true} call ULTIMATE.init(); {191577#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:43,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {191577#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {191570#true} is VALID [2022-04-15 11:46:43,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {191570#true} assume true; {191570#true} is VALID [2022-04-15 11:46:43,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191570#true} {191570#true} #755#return; {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {191570#true} call #t~ret161 := main(); {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {191570#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {191570#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L272 TraceCheckUtils]: 7: Hoare triple {191570#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {191570#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {191570#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {191570#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {191570#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {191570#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {191570#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {191570#true} is VALID [2022-04-15 11:46:43,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {191570#true} assume !false; {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {191570#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {191570#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {191570#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {191570#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {191570#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {191570#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {191570#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {191570#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {191570#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {191570#true} assume 8464 == #t~mem55;havoc #t~mem55; {191570#true} is VALID [2022-04-15 11:46:43,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {191570#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {191570#true} is VALID [2022-04-15 11:46:43,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {191570#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {191570#true} is VALID [2022-04-15 11:46:43,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {191570#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {191570#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {191570#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 30: Hoare triple {191570#true} ~skip~0 := 0; {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {191570#true} assume !false; {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {191570#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {191570#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {191570#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 35: Hoare triple {191570#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {191570#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {191570#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {191570#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {191570#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {191570#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {191570#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {191570#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {191570#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {191570#true} assume 8496 == #t~mem58;havoc #t~mem58; {191570#true} is VALID [2022-04-15 11:46:43,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {191570#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {191570#true} is VALID [2022-04-15 11:46:43,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {191570#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {191570#true} is VALID [2022-04-15 11:46:43,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {191570#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {191570#true} is VALID [2022-04-15 11:46:43,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {191570#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,521 INFO L290 TraceCheckUtils]: 53: Hoare triple {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:43,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {191575#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {191576#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {191576#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {191571#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 57: Hoare triple {191571#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 58: Hoare triple {191571#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 59: Hoare triple {191571#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 60: Hoare triple {191571#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 61: Hoare triple {191571#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 62: Hoare triple {191571#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 63: Hoare triple {191571#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 64: Hoare triple {191571#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {191571#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {191571#false} is VALID [2022-04-15 11:46:43,523 INFO L290 TraceCheckUtils]: 66: Hoare triple {191571#false} ~skip~0 := 0; {191571#false} is VALID [2022-04-15 11:46:43,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {191571#false} assume !false; {191571#false} is VALID [2022-04-15 11:46:43,523 INFO L290 TraceCheckUtils]: 68: Hoare triple {191571#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {191571#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {191571#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {191571#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {191571#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 73: Hoare triple {191571#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 74: Hoare triple {191571#false} assume 8480 == #t~mem52;havoc #t~mem52; {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 75: Hoare triple {191571#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 76: Hoare triple {191571#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 77: Hoare triple {191571#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,524 INFO L290 TraceCheckUtils]: 78: Hoare triple {191571#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 79: Hoare triple {191571#false} ~skip~0 := 0; {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 80: Hoare triple {191571#false} assume !false; {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 81: Hoare triple {191571#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 82: Hoare triple {191571#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 83: Hoare triple {191571#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 84: Hoare triple {191571#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 85: Hoare triple {191571#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 86: Hoare triple {191571#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 87: Hoare triple {191571#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {191571#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {191571#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {191571#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 91: Hoare triple {191571#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {191571#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {191571#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {191571#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 95: Hoare triple {191571#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {191571#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 97: Hoare triple {191571#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 98: Hoare triple {191571#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 99: Hoare triple {191571#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,526 INFO L290 TraceCheckUtils]: 100: Hoare triple {191571#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 101: Hoare triple {191571#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 102: Hoare triple {191571#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 103: Hoare triple {191571#false} assume 8448 == #t~mem68;havoc #t~mem68; {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 104: Hoare triple {191571#false} assume !(~num1~0 > 0); {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 105: Hoare triple {191571#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 106: Hoare triple {191571#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 107: Hoare triple {191571#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 108: Hoare triple {191571#false} ~skip~0 := 0; {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 109: Hoare triple {191571#false} assume !false; {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 110: Hoare triple {191571#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,527 INFO L290 TraceCheckUtils]: 111: Hoare triple {191571#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 112: Hoare triple {191571#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 113: Hoare triple {191571#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 114: Hoare triple {191571#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 115: Hoare triple {191571#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 116: Hoare triple {191571#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 117: Hoare triple {191571#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 118: Hoare triple {191571#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 119: Hoare triple {191571#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,528 INFO L290 TraceCheckUtils]: 120: Hoare triple {191571#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 121: Hoare triple {191571#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 122: Hoare triple {191571#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 123: Hoare triple {191571#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 124: Hoare triple {191571#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 125: Hoare triple {191571#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 126: Hoare triple {191571#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 127: Hoare triple {191571#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 128: Hoare triple {191571#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 129: Hoare triple {191571#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 130: Hoare triple {191571#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,529 INFO L290 TraceCheckUtils]: 131: Hoare triple {191571#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 132: Hoare triple {191571#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {191571#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 134: Hoare triple {191571#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 135: Hoare triple {191571#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 136: Hoare triple {191571#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 137: Hoare triple {191571#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 138: Hoare triple {191571#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 139: Hoare triple {191571#false} assume 8640 == #t~mem75;havoc #t~mem75; {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 140: Hoare triple {191571#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 141: Hoare triple {191571#false} assume !(9 == ~blastFlag~0); {191571#false} is VALID [2022-04-15 11:46:43,530 INFO L290 TraceCheckUtils]: 142: Hoare triple {191571#false} assume !(12 == ~blastFlag~0); {191571#false} is VALID [2022-04-15 11:46:43,531 INFO L290 TraceCheckUtils]: 143: Hoare triple {191571#false} assume !(15 == ~blastFlag~0); {191571#false} is VALID [2022-04-15 11:46:43,531 INFO L290 TraceCheckUtils]: 144: Hoare triple {191571#false} assume !(18 == ~blastFlag~0); {191571#false} is VALID [2022-04-15 11:46:43,531 INFO L290 TraceCheckUtils]: 145: Hoare triple {191571#false} assume 21 == ~blastFlag~0; {191571#false} is VALID [2022-04-15 11:46:43,531 INFO L290 TraceCheckUtils]: 146: Hoare triple {191571#false} assume !false; {191571#false} is VALID [2022-04-15 11:46:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:46:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164990832] [2022-04-15 11:46:43,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164990832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:43,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:43,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:43,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:43,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [215040050] [2022-04-15 11:46:43,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [215040050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:43,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:43,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344128978] [2022-04-15 11:46:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:43,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 11:46:43,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:43,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:43,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:43,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:43,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:43,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:43,627 INFO L87 Difference]: Start difference. First operand 1312 states and 2091 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:45,688 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-15 11:46:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:49,231 INFO L93 Difference]: Finished difference Result 2433 states and 3822 transitions. [2022-04-15 11:46:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 11:46:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2022-04-15 11:46:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2022-04-15 11:46:49,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 655 transitions. [2022-04-15 11:46:49,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 655 edges. 655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:49,815 INFO L225 Difference]: With dead ends: 2433 [2022-04-15 11:46:49,815 INFO L226 Difference]: Without dead ends: 1541 [2022-04-15 11:46:49,816 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:49,816 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 164 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:49,817 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 466 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 517 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:46:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2022-04-15 11:46:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1312. [2022-04-15 11:46:49,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:49,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1541 states. Second operand has 1312 states, 1307 states have (on average 1.5791889824024483) internal successors, (2064), 1307 states have internal predecessors, (2064), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,925 INFO L74 IsIncluded]: Start isIncluded. First operand 1541 states. Second operand has 1312 states, 1307 states have (on average 1.5791889824024483) internal successors, (2064), 1307 states have internal predecessors, (2064), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,926 INFO L87 Difference]: Start difference. First operand 1541 states. Second operand has 1312 states, 1307 states have (on average 1.5791889824024483) internal successors, (2064), 1307 states have internal predecessors, (2064), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:49,992 INFO L93 Difference]: Finished difference Result 1541 states and 2374 transitions. [2022-04-15 11:46:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2374 transitions. [2022-04-15 11:46:49,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:49,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:49,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 1312 states, 1307 states have (on average 1.5791889824024483) internal successors, (2064), 1307 states have internal predecessors, (2064), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1541 states. [2022-04-15 11:46:49,995 INFO L87 Difference]: Start difference. First operand has 1312 states, 1307 states have (on average 1.5791889824024483) internal successors, (2064), 1307 states have internal predecessors, (2064), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1541 states. [2022-04-15 11:46:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:50,067 INFO L93 Difference]: Finished difference Result 1541 states and 2374 transitions. [2022-04-15 11:46:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2374 transitions. [2022-04-15 11:46:50,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:50,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:50,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:50,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1307 states have (on average 1.5791889824024483) internal successors, (2064), 1307 states have internal predecessors, (2064), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2068 transitions. [2022-04-15 11:46:50,146 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2068 transitions. Word has length 147 [2022-04-15 11:46:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:50,146 INFO L478 AbstractCegarLoop]: Abstraction has 1312 states and 2068 transitions. [2022-04-15 11:46:50,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:50,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1312 states and 2068 transitions. [2022-04-15 11:46:53,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2068 edges. 2068 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2068 transitions. [2022-04-15 11:46:53,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:46:53,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:53,756 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:46:53,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:46:53,757 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:53,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash -735212620, now seen corresponding path program 1 times [2022-04-15 11:46:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1902265947] [2022-04-15 11:46:53,865 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:53,865 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:53,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash -735212620, now seen corresponding path program 2 times [2022-04-15 11:46:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:53,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097397001] [2022-04-15 11:46:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:54,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:54,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {202161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {202154#true} is VALID [2022-04-15 11:46:54,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {202154#true} assume true; {202154#true} is VALID [2022-04-15 11:46:54,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {202154#true} {202154#true} #755#return; {202154#true} is VALID [2022-04-15 11:46:54,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {202154#true} call ULTIMATE.init(); {202161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:46:54,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {202161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {202154#true} assume true; {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {202154#true} {202154#true} #755#return; {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {202154#true} call #t~ret161 := main(); {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {202154#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {202154#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L272 TraceCheckUtils]: 7: Hoare triple {202154#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {202154#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {202154#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {202154#true} is VALID [2022-04-15 11:46:54,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {202154#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {202154#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {202154#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {202154#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {202154#true} assume !false; {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {202154#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {202154#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {202154#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {202154#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {202154#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {202154#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {202154#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {202154#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {202154#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 24: Hoare triple {202154#true} assume 8464 == #t~mem55;havoc #t~mem55; {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {202154#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {202154#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {202154#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {202154#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {202154#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {202154#true} is VALID [2022-04-15 11:46:54,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {202154#true} ~skip~0 := 0; {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {202154#true} assume !false; {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {202154#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {202154#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {202154#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {202154#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {202154#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {202154#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {202154#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {202154#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {202154#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {202154#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {202154#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {202154#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {202154#true} assume 8496 == #t~mem58;havoc #t~mem58; {202154#true} is VALID [2022-04-15 11:46:54,107 INFO L290 TraceCheckUtils]: 45: Hoare triple {202154#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {202154#true} is VALID [2022-04-15 11:46:54,107 INFO L290 TraceCheckUtils]: 46: Hoare triple {202154#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {202154#true} is VALID [2022-04-15 11:46:54,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {202154#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {202154#true} is VALID [2022-04-15 11:46:54,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {202154#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,110 INFO L290 TraceCheckUtils]: 50: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,110 INFO L290 TraceCheckUtils]: 51: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,111 INFO L290 TraceCheckUtils]: 52: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,111 INFO L290 TraceCheckUtils]: 53: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:46:54,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {202159#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {202160#(= |ssl3_accept_#t~mem66| 8656)} is VALID [2022-04-15 11:46:54,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {202160#(= |ssl3_accept_#t~mem66| 8656)} assume 8560 == #t~mem66;havoc #t~mem66; {202155#false} is VALID [2022-04-15 11:46:54,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {202155#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {202155#false} is VALID [2022-04-15 11:46:54,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {202155#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {202155#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {202155#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {202155#false} ~skip~0 := 0; {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {202155#false} assume !false; {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 81: Hoare triple {202155#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 82: Hoare triple {202155#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 83: Hoare triple {202155#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 84: Hoare triple {202155#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 85: Hoare triple {202155#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 86: Hoare triple {202155#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 87: Hoare triple {202155#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 88: Hoare triple {202155#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,122 INFO L290 TraceCheckUtils]: 89: Hoare triple {202155#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 90: Hoare triple {202155#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 91: Hoare triple {202155#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 92: Hoare triple {202155#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 93: Hoare triple {202155#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 94: Hoare triple {202155#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 95: Hoare triple {202155#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 96: Hoare triple {202155#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 97: Hoare triple {202155#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 98: Hoare triple {202155#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,123 INFO L290 TraceCheckUtils]: 99: Hoare triple {202155#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 100: Hoare triple {202155#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 101: Hoare triple {202155#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 102: Hoare triple {202155#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 103: Hoare triple {202155#false} assume 8448 == #t~mem68;havoc #t~mem68; {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 104: Hoare triple {202155#false} assume !(~num1~0 > 0); {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 105: Hoare triple {202155#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 106: Hoare triple {202155#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 107: Hoare triple {202155#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 108: Hoare triple {202155#false} ~skip~0 := 0; {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 109: Hoare triple {202155#false} assume !false; {202155#false} is VALID [2022-04-15 11:46:54,124 INFO L290 TraceCheckUtils]: 110: Hoare triple {202155#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 111: Hoare triple {202155#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 112: Hoare triple {202155#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 113: Hoare triple {202155#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 114: Hoare triple {202155#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 115: Hoare triple {202155#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 116: Hoare triple {202155#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 117: Hoare triple {202155#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 118: Hoare triple {202155#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 119: Hoare triple {202155#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,125 INFO L290 TraceCheckUtils]: 120: Hoare triple {202155#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 121: Hoare triple {202155#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 122: Hoare triple {202155#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 123: Hoare triple {202155#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 124: Hoare triple {202155#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 125: Hoare triple {202155#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 126: Hoare triple {202155#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 127: Hoare triple {202155#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 128: Hoare triple {202155#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 129: Hoare triple {202155#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,126 INFO L290 TraceCheckUtils]: 130: Hoare triple {202155#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 131: Hoare triple {202155#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 132: Hoare triple {202155#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 133: Hoare triple {202155#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 134: Hoare triple {202155#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 135: Hoare triple {202155#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 136: Hoare triple {202155#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 137: Hoare triple {202155#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 138: Hoare triple {202155#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 139: Hoare triple {202155#false} assume 8640 == #t~mem75;havoc #t~mem75; {202155#false} is VALID [2022-04-15 11:46:54,127 INFO L290 TraceCheckUtils]: 140: Hoare triple {202155#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {202155#false} is VALID [2022-04-15 11:46:54,128 INFO L290 TraceCheckUtils]: 141: Hoare triple {202155#false} assume !(9 == ~blastFlag~0); {202155#false} is VALID [2022-04-15 11:46:54,128 INFO L290 TraceCheckUtils]: 142: Hoare triple {202155#false} assume !(12 == ~blastFlag~0); {202155#false} is VALID [2022-04-15 11:46:54,128 INFO L290 TraceCheckUtils]: 143: Hoare triple {202155#false} assume !(15 == ~blastFlag~0); {202155#false} is VALID [2022-04-15 11:46:54,128 INFO L290 TraceCheckUtils]: 144: Hoare triple {202155#false} assume !(18 == ~blastFlag~0); {202155#false} is VALID [2022-04-15 11:46:54,128 INFO L290 TraceCheckUtils]: 145: Hoare triple {202155#false} assume 21 == ~blastFlag~0; {202155#false} is VALID [2022-04-15 11:46:54,128 INFO L290 TraceCheckUtils]: 146: Hoare triple {202155#false} assume !false; {202155#false} is VALID [2022-04-15 11:46:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:46:54,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:54,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097397001] [2022-04-15 11:46:54,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097397001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:54,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:54,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:54,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:54,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1902265947] [2022-04-15 11:46:54,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1902265947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:54,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:54,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:54,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900426017] [2022-04-15 11:46:54,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:54,130 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 147 [2022-04-15 11:46:54,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:54,131 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-15 11:46:54,222 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-15 11:46:54,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:54,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:54,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:54,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:54,223 INFO L87 Difference]: Start difference. First operand 1312 states and 2068 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-15 11:46:57,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:59,142 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-15 11:47:01,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:04,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:08,958 INFO L93 Difference]: Finished difference Result 2719 states and 4263 transitions. [2022-04-15 11:47:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:08,959 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 147 [2022-04-15 11:47:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:08,959 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-15 11:47:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-15 11:47:08,962 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-15 11:47:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-15 11:47:08,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-15 11:47:09,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:09,455 INFO L225 Difference]: With dead ends: 2719 [2022-04-15 11:47:09,455 INFO L226 Difference]: Without dead ends: 1433 [2022-04-15 11:47:09,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:09,457 INFO L913 BasicCegarLoop]: 292 mSDtfsCounter, 80 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:09,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 721 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 619 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-04-15 11:47:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-04-15 11:47:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1312. [2022-04-15 11:47:09,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:09,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1433 states. Second operand has 1312 states, 1307 states have (on average 1.576893649579189) internal successors, (2061), 1307 states have internal predecessors, (2061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:09,557 INFO L74 IsIncluded]: Start isIncluded. First operand 1433 states. Second operand has 1312 states, 1307 states have (on average 1.576893649579189) internal successors, (2061), 1307 states have internal predecessors, (2061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:09,558 INFO L87 Difference]: Start difference. First operand 1433 states. Second operand has 1312 states, 1307 states have (on average 1.576893649579189) internal successors, (2061), 1307 states have internal predecessors, (2061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:09,623 INFO L93 Difference]: Finished difference Result 1433 states and 2225 transitions. [2022-04-15 11:47:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2225 transitions. [2022-04-15 11:47:09,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:09,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:09,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 1312 states, 1307 states have (on average 1.576893649579189) internal successors, (2061), 1307 states have internal predecessors, (2061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1433 states. [2022-04-15 11:47:09,626 INFO L87 Difference]: Start difference. First operand has 1312 states, 1307 states have (on average 1.576893649579189) internal successors, (2061), 1307 states have internal predecessors, (2061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1433 states. [2022-04-15 11:47:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:09,678 INFO L93 Difference]: Finished difference Result 1433 states and 2225 transitions. [2022-04-15 11:47:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2225 transitions. [2022-04-15 11:47:09,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:09,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:09,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:09,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:09,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1307 states have (on average 1.576893649579189) internal successors, (2061), 1307 states have internal predecessors, (2061), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2065 transitions. [2022-04-15 11:47:09,747 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2065 transitions. Word has length 147 [2022-04-15 11:47:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:09,747 INFO L478 AbstractCegarLoop]: Abstraction has 1312 states and 2065 transitions. [2022-04-15 11:47:09,748 INFO L479 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-15 11:47:09,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1312 states and 2065 transitions. [2022-04-15 11:47:13,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2065 edges. 2065 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2065 transitions. [2022-04-15 11:47:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:47:13,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:13,484 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:47:13,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 11:47:13,484 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 295828278, now seen corresponding path program 1 times [2022-04-15 11:47:13,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:13,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1600609614] [2022-04-15 11:47:13,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:13,570 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:13,570 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 295828278, now seen corresponding path program 2 times [2022-04-15 11:47:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:13,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986699529] [2022-04-15 11:47:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:13,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {213101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {213094#true} is VALID [2022-04-15 11:47:13,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {213094#true} assume true; {213094#true} is VALID [2022-04-15 11:47:13,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213094#true} {213094#true} #755#return; {213094#true} is VALID [2022-04-15 11:47:13,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {213094#true} call ULTIMATE.init(); {213101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:13,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {213101#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {213094#true} is VALID [2022-04-15 11:47:13,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {213094#true} assume true; {213094#true} is VALID [2022-04-15 11:47:13,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213094#true} {213094#true} #755#return; {213094#true} is VALID [2022-04-15 11:47:13,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {213094#true} call #t~ret161 := main(); {213094#true} is VALID [2022-04-15 11:47:13,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {213094#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {213094#true} is VALID [2022-04-15 11:47:13,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {213094#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,769 INFO L272 TraceCheckUtils]: 7: Hoare triple {213094#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {213094#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {213094#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {213094#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {213094#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {213094#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {213094#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {213094#true} assume !false; {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {213094#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {213094#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {213094#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {213094#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {213094#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {213094#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {213094#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {213094#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {213094#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {213094#true} assume 8464 == #t~mem55;havoc #t~mem55; {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {213094#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {213094#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {213094#true} is VALID [2022-04-15 11:47:13,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {213094#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {213094#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {213094#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {213094#true} ~skip~0 := 0; {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {213094#true} assume !false; {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {213094#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {213094#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {213094#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {213094#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {213094#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {213094#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {213094#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {213094#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {213094#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {213094#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {213094#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {213094#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {213094#true} assume 8496 == #t~mem58;havoc #t~mem58; {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {213094#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 46: Hoare triple {213094#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {213094#true} is VALID [2022-04-15 11:47:13,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {213094#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {213094#true} is VALID [2022-04-15 11:47:13,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {213094#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,775 INFO L290 TraceCheckUtils]: 49: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,776 INFO L290 TraceCheckUtils]: 50: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,776 INFO L290 TraceCheckUtils]: 51: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,778 INFO L290 TraceCheckUtils]: 54: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,780 INFO L290 TraceCheckUtils]: 58: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,780 INFO L290 TraceCheckUtils]: 59: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,780 INFO L290 TraceCheckUtils]: 60: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,781 INFO L290 TraceCheckUtils]: 62: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,784 INFO L290 TraceCheckUtils]: 67: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,786 INFO L290 TraceCheckUtils]: 71: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,786 INFO L290 TraceCheckUtils]: 72: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:13,786 INFO L290 TraceCheckUtils]: 73: Hoare triple {213099#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {213100#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-15 11:47:13,787 INFO L290 TraceCheckUtils]: 74: Hoare triple {213100#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {213095#false} is VALID [2022-04-15 11:47:13,787 INFO L290 TraceCheckUtils]: 75: Hoare triple {213095#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {213095#false} is VALID [2022-04-15 11:47:13,787 INFO L290 TraceCheckUtils]: 76: Hoare triple {213095#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,787 INFO L290 TraceCheckUtils]: 77: Hoare triple {213095#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,787 INFO L290 TraceCheckUtils]: 78: Hoare triple {213095#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213095#false} is VALID [2022-04-15 11:47:13,787 INFO L290 TraceCheckUtils]: 79: Hoare triple {213095#false} ~skip~0 := 0; {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 80: Hoare triple {213095#false} assume !false; {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 81: Hoare triple {213095#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 82: Hoare triple {213095#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 83: Hoare triple {213095#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 84: Hoare triple {213095#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 85: Hoare triple {213095#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 86: Hoare triple {213095#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 87: Hoare triple {213095#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 88: Hoare triple {213095#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 89: Hoare triple {213095#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,788 INFO L290 TraceCheckUtils]: 90: Hoare triple {213095#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 91: Hoare triple {213095#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 92: Hoare triple {213095#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 93: Hoare triple {213095#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 94: Hoare triple {213095#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 95: Hoare triple {213095#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {213095#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {213095#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {213095#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,789 INFO L290 TraceCheckUtils]: 99: Hoare triple {213095#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {213095#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 101: Hoare triple {213095#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 102: Hoare triple {213095#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 103: Hoare triple {213095#false} assume 8448 == #t~mem68;havoc #t~mem68; {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 104: Hoare triple {213095#false} assume !(~num1~0 > 0); {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 105: Hoare triple {213095#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 106: Hoare triple {213095#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 107: Hoare triple {213095#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 108: Hoare triple {213095#false} ~skip~0 := 0; {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 109: Hoare triple {213095#false} assume !false; {213095#false} is VALID [2022-04-15 11:47:13,790 INFO L290 TraceCheckUtils]: 110: Hoare triple {213095#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 111: Hoare triple {213095#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 112: Hoare triple {213095#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 113: Hoare triple {213095#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 114: Hoare triple {213095#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 115: Hoare triple {213095#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 116: Hoare triple {213095#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 117: Hoare triple {213095#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 118: Hoare triple {213095#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,791 INFO L290 TraceCheckUtils]: 119: Hoare triple {213095#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 120: Hoare triple {213095#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 121: Hoare triple {213095#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 122: Hoare triple {213095#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 123: Hoare triple {213095#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 124: Hoare triple {213095#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 125: Hoare triple {213095#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 126: Hoare triple {213095#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 127: Hoare triple {213095#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 128: Hoare triple {213095#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 129: Hoare triple {213095#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,792 INFO L290 TraceCheckUtils]: 130: Hoare triple {213095#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 131: Hoare triple {213095#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 132: Hoare triple {213095#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 133: Hoare triple {213095#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 134: Hoare triple {213095#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 135: Hoare triple {213095#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 136: Hoare triple {213095#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 137: Hoare triple {213095#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 138: Hoare triple {213095#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 139: Hoare triple {213095#false} assume 8640 == #t~mem75;havoc #t~mem75; {213095#false} is VALID [2022-04-15 11:47:13,793 INFO L290 TraceCheckUtils]: 140: Hoare triple {213095#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {213095#false} is VALID [2022-04-15 11:47:13,794 INFO L290 TraceCheckUtils]: 141: Hoare triple {213095#false} assume !(9 == ~blastFlag~0); {213095#false} is VALID [2022-04-15 11:47:13,794 INFO L290 TraceCheckUtils]: 142: Hoare triple {213095#false} assume !(12 == ~blastFlag~0); {213095#false} is VALID [2022-04-15 11:47:13,794 INFO L290 TraceCheckUtils]: 143: Hoare triple {213095#false} assume !(15 == ~blastFlag~0); {213095#false} is VALID [2022-04-15 11:47:13,794 INFO L290 TraceCheckUtils]: 144: Hoare triple {213095#false} assume !(18 == ~blastFlag~0); {213095#false} is VALID [2022-04-15 11:47:13,794 INFO L290 TraceCheckUtils]: 145: Hoare triple {213095#false} assume 21 == ~blastFlag~0; {213095#false} is VALID [2022-04-15 11:47:13,794 INFO L290 TraceCheckUtils]: 146: Hoare triple {213095#false} assume !false; {213095#false} is VALID [2022-04-15 11:47:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:47:13,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:13,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986699529] [2022-04-15 11:47:13,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986699529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:13,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:13,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:13,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:13,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1600609614] [2022-04-15 11:47:13,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1600609614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:13,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:13,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:13,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71441764] [2022-04-15 11:47:13,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:13,796 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 147 [2022-04-15 11:47:13,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:13,797 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-15 11:47:13,889 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-15 11:47:13,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:13,890 INFO L87 Difference]: Start difference. First operand 1312 states and 2065 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-15 11:47:15,938 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-15 11:47:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:19,688 INFO L93 Difference]: Finished difference Result 2953 states and 4607 transitions. [2022-04-15 11:47:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:19,688 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 147 [2022-04-15 11:47:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:19,689 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-15 11:47:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-04-15 11:47:19,691 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-15 11:47:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-04-15 11:47:19,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 654 transitions. [2022-04-15 11:47:20,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 654 edges. 654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:20,274 INFO L225 Difference]: With dead ends: 2953 [2022-04-15 11:47:20,275 INFO L226 Difference]: Without dead ends: 1667 [2022-04-15 11:47:20,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:20,277 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:20,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 466 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 520 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:47:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-04-15 11:47:20,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1402. [2022-04-15 11:47:20,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:20,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1667 states. Second operand has 1402 states, 1397 states have (on average 1.5697924123120974) internal successors, (2193), 1397 states have internal predecessors, (2193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:20,400 INFO L74 IsIncluded]: Start isIncluded. First operand 1667 states. Second operand has 1402 states, 1397 states have (on average 1.5697924123120974) internal successors, (2193), 1397 states have internal predecessors, (2193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:20,401 INFO L87 Difference]: Start difference. First operand 1667 states. Second operand has 1402 states, 1397 states have (on average 1.5697924123120974) internal successors, (2193), 1397 states have internal predecessors, (2193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:20,479 INFO L93 Difference]: Finished difference Result 1667 states and 2557 transitions. [2022-04-15 11:47:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2557 transitions. [2022-04-15 11:47:20,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:20,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:20,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 1402 states, 1397 states have (on average 1.5697924123120974) internal successors, (2193), 1397 states have internal predecessors, (2193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1667 states. [2022-04-15 11:47:20,483 INFO L87 Difference]: Start difference. First operand has 1402 states, 1397 states have (on average 1.5697924123120974) internal successors, (2193), 1397 states have internal predecessors, (2193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1667 states. [2022-04-15 11:47:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:20,557 INFO L93 Difference]: Finished difference Result 1667 states and 2557 transitions. [2022-04-15 11:47:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2557 transitions. [2022-04-15 11:47:20,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:20,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:20,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:20,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1397 states have (on average 1.5697924123120974) internal successors, (2193), 1397 states have internal predecessors, (2193), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2197 transitions. [2022-04-15 11:47:20,632 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2197 transitions. Word has length 147 [2022-04-15 11:47:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:20,632 INFO L478 AbstractCegarLoop]: Abstraction has 1402 states and 2197 transitions. [2022-04-15 11:47:20,632 INFO L479 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-15 11:47:20,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1402 states and 2197 transitions. [2022-04-15 11:47:25,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2197 edges. 2197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2197 transitions. [2022-04-15 11:47:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-15 11:47:25,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:25,133 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:47:25,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 11:47:25,134 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2018925445, now seen corresponding path program 1 times [2022-04-15 11:47:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:25,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [139812922] [2022-04-15 11:47:25,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:25,219 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:25,219 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2018925445, now seen corresponding path program 2 times [2022-04-15 11:47:25,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:25,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905800334] [2022-04-15 11:47:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:25,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:25,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {225157#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {225150#true} is VALID [2022-04-15 11:47:25,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {225150#true} assume true; {225150#true} is VALID [2022-04-15 11:47:25,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {225150#true} {225150#true} #755#return; {225150#true} is VALID [2022-04-15 11:47:25,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {225150#true} call ULTIMATE.init(); {225157#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:25,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {225157#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {225150#true} assume true; {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {225150#true} {225150#true} #755#return; {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {225150#true} call #t~ret161 := main(); {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {225150#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {225150#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L272 TraceCheckUtils]: 7: Hoare triple {225150#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {225150#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {225150#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {225150#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {225150#true} is VALID [2022-04-15 11:47:25,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {225150#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {225150#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {225150#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {225150#true} assume !false; {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {225150#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {225150#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {225150#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {225150#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {225150#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {225150#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {225150#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {225150#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {225150#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {225150#true} assume 8464 == #t~mem55;havoc #t~mem55; {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {225150#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {225150#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {225150#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {225150#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {225150#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {225150#true} ~skip~0 := 0; {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {225150#true} assume !false; {225150#true} is VALID [2022-04-15 11:47:25,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {225150#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {225150#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {225150#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {225150#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {225150#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {225150#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {225150#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {225150#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {225150#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {225150#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {225150#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,425 INFO L290 TraceCheckUtils]: 43: Hoare triple {225150#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,426 INFO L290 TraceCheckUtils]: 44: Hoare triple {225150#true} assume 8496 == #t~mem58;havoc #t~mem58; {225150#true} is VALID [2022-04-15 11:47:25,426 INFO L290 TraceCheckUtils]: 45: Hoare triple {225150#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {225150#true} is VALID [2022-04-15 11:47:25,426 INFO L290 TraceCheckUtils]: 46: Hoare triple {225150#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {225150#true} is VALID [2022-04-15 11:47:25,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {225150#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {225150#true} is VALID [2022-04-15 11:47:25,427 INFO L290 TraceCheckUtils]: 48: Hoare triple {225150#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,429 INFO L290 TraceCheckUtils]: 52: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,430 INFO L290 TraceCheckUtils]: 53: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,430 INFO L290 TraceCheckUtils]: 54: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,432 INFO L290 TraceCheckUtils]: 58: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,432 INFO L290 TraceCheckUtils]: 59: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,436 INFO L290 TraceCheckUtils]: 68: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,438 INFO L290 TraceCheckUtils]: 71: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,438 INFO L290 TraceCheckUtils]: 72: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,439 INFO L290 TraceCheckUtils]: 73: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:25,439 INFO L290 TraceCheckUtils]: 74: Hoare triple {225155#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {225156#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 75: Hoare triple {225156#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 76: Hoare triple {225151#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 77: Hoare triple {225151#false} assume !(~ret~0 <= 0);call #t~mem131.base, #t~mem131.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem131.base, 844 + #t~mem131.offset, 4);havoc #t~mem131.base, #t~mem131.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 78: Hoare triple {225151#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 79: Hoare triple {225151#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {225151#false} ~skip~0 := 0; {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 81: Hoare triple {225151#false} assume !false; {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 82: Hoare triple {225151#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 83: Hoare triple {225151#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,440 INFO L290 TraceCheckUtils]: 84: Hoare triple {225151#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 85: Hoare triple {225151#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 86: Hoare triple {225151#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 87: Hoare triple {225151#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 88: Hoare triple {225151#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 89: Hoare triple {225151#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 90: Hoare triple {225151#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 91: Hoare triple {225151#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 92: Hoare triple {225151#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,441 INFO L290 TraceCheckUtils]: 93: Hoare triple {225151#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 94: Hoare triple {225151#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 95: Hoare triple {225151#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 96: Hoare triple {225151#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 97: Hoare triple {225151#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 98: Hoare triple {225151#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 99: Hoare triple {225151#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 100: Hoare triple {225151#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 101: Hoare triple {225151#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 102: Hoare triple {225151#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 103: Hoare triple {225151#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,442 INFO L290 TraceCheckUtils]: 104: Hoare triple {225151#false} assume 8448 == #t~mem68;havoc #t~mem68; {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 105: Hoare triple {225151#false} assume !(~num1~0 > 0); {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 106: Hoare triple {225151#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 107: Hoare triple {225151#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 108: Hoare triple {225151#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 109: Hoare triple {225151#false} ~skip~0 := 0; {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 110: Hoare triple {225151#false} assume !false; {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 111: Hoare triple {225151#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 112: Hoare triple {225151#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 113: Hoare triple {225151#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,443 INFO L290 TraceCheckUtils]: 114: Hoare triple {225151#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 115: Hoare triple {225151#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 116: Hoare triple {225151#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 117: Hoare triple {225151#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 118: Hoare triple {225151#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 119: Hoare triple {225151#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 120: Hoare triple {225151#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 121: Hoare triple {225151#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 122: Hoare triple {225151#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 123: Hoare triple {225151#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 124: Hoare triple {225151#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,444 INFO L290 TraceCheckUtils]: 125: Hoare triple {225151#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 126: Hoare triple {225151#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 127: Hoare triple {225151#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 128: Hoare triple {225151#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 129: Hoare triple {225151#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 130: Hoare triple {225151#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 131: Hoare triple {225151#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 132: Hoare triple {225151#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 133: Hoare triple {225151#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 134: Hoare triple {225151#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 135: Hoare triple {225151#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,445 INFO L290 TraceCheckUtils]: 136: Hoare triple {225151#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 137: Hoare triple {225151#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 138: Hoare triple {225151#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 139: Hoare triple {225151#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 140: Hoare triple {225151#false} assume 8640 == #t~mem75;havoc #t~mem75; {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 141: Hoare triple {225151#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 142: Hoare triple {225151#false} assume !(9 == ~blastFlag~0); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 143: Hoare triple {225151#false} assume !(12 == ~blastFlag~0); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 144: Hoare triple {225151#false} assume !(15 == ~blastFlag~0); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 145: Hoare triple {225151#false} assume !(18 == ~blastFlag~0); {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 146: Hoare triple {225151#false} assume 21 == ~blastFlag~0; {225151#false} is VALID [2022-04-15 11:47:25,446 INFO L290 TraceCheckUtils]: 147: Hoare triple {225151#false} assume !false; {225151#false} is VALID [2022-04-15 11:47:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:47:25,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:25,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905800334] [2022-04-15 11:47:25,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905800334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:25,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:25,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:25,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:25,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [139812922] [2022-04-15 11:47:25,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [139812922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:25,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:25,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125813129] [2022-04-15 11:47:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:25,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 11:47:25,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:25,449 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-15 11:47:25,543 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-15 11:47:25,543 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:25,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:25,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:25,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:25,544 INFO L87 Difference]: Start difference. First operand 1402 states and 2197 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-15 11:47:27,588 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-15 11:47:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:31,359 INFO L93 Difference]: Finished difference Result 3007 states and 4667 transitions. [2022-04-15 11:47:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:31,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 11:47:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:31,359 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-15 11:47:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-04-15 11:47:31,361 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-15 11:47:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-04-15 11:47:31,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 654 transitions. [2022-04-15 11:47:31,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 654 edges. 654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:31,932 INFO L225 Difference]: With dead ends: 3007 [2022-04-15 11:47:31,932 INFO L226 Difference]: Without dead ends: 1631 [2022-04-15 11:47:31,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:31,934 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 143 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:31,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 466 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 517 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:47:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-04-15 11:47:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1402. [2022-04-15 11:47:32,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:32,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1402 states, 1397 states have (on average 1.5547602004294918) internal successors, (2172), 1397 states have internal predecessors, (2172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,062 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1402 states, 1397 states have (on average 1.5547602004294918) internal successors, (2172), 1397 states have internal predecessors, (2172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,063 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1402 states, 1397 states have (on average 1.5547602004294918) internal successors, (2172), 1397 states have internal predecessors, (2172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:32,139 INFO L93 Difference]: Finished difference Result 1631 states and 2482 transitions. [2022-04-15 11:47:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2482 transitions. [2022-04-15 11:47:32,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:32,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:32,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 1402 states, 1397 states have (on average 1.5547602004294918) internal successors, (2172), 1397 states have internal predecessors, (2172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1631 states. [2022-04-15 11:47:32,156 INFO L87 Difference]: Start difference. First operand has 1402 states, 1397 states have (on average 1.5547602004294918) internal successors, (2172), 1397 states have internal predecessors, (2172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1631 states. [2022-04-15 11:47:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:32,229 INFO L93 Difference]: Finished difference Result 1631 states and 2482 transitions. [2022-04-15 11:47:32,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2482 transitions. [2022-04-15 11:47:32,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:32,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:32,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:32,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1397 states have (on average 1.5547602004294918) internal successors, (2172), 1397 states have internal predecessors, (2172), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2176 transitions. [2022-04-15 11:47:32,307 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2176 transitions. Word has length 148 [2022-04-15 11:47:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:32,307 INFO L478 AbstractCegarLoop]: Abstraction has 1402 states and 2176 transitions. [2022-04-15 11:47:32,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:32,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1402 states and 2176 transitions. [2022-04-15 11:47:36,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2176 edges. 2176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2176 transitions. [2022-04-15 11:47:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 11:47:36,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:36,610 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:36,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 11:47:36,610 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash 224574598, now seen corresponding path program 1 times [2022-04-15 11:47:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:36,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324962996] [2022-04-15 11:47:36,695 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:36,695 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:36,695 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash 224574598, now seen corresponding path program 2 times [2022-04-15 11:47:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:36,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816890131] [2022-04-15 11:47:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:36,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:36,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {237249#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {237242#true} is VALID [2022-04-15 11:47:36,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {237242#true} assume true; {237242#true} is VALID [2022-04-15 11:47:36,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {237242#true} {237242#true} #755#return; {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {237242#true} call ULTIMATE.init(); {237249#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:36,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {237249#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {237242#true} assume true; {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {237242#true} {237242#true} #755#return; {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {237242#true} call #t~ret161 := main(); {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {237242#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {237242#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L272 TraceCheckUtils]: 7: Hoare triple {237242#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {237242#true} is VALID [2022-04-15 11:47:36,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {237242#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {237242#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {237242#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {237242#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {237242#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {237242#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {237242#true} assume !false; {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {237242#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {237242#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {237242#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {237242#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {237242#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {237242#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {237242#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {237242#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {237242#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {237242#true} assume 8464 == #t~mem55;havoc #t~mem55; {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {237242#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {237242#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {237242#true} is VALID [2022-04-15 11:47:36,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {237242#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {237242#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {237242#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {237242#true} ~skip~0 := 0; {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {237242#true} assume !false; {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {237242#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 33: Hoare triple {237242#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {237242#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {237242#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {237242#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {237242#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {237242#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {237242#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {237242#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {237242#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {237242#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 43: Hoare triple {237242#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {237242#true} assume 8496 == #t~mem58;havoc #t~mem58; {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {237242#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {237242#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {237242#true} is VALID [2022-04-15 11:47:36,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {237242#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {237242#true} is VALID [2022-04-15 11:47:36,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {237242#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:36,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {237247#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {237248#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {237248#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {237243#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {237243#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {237243#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {237243#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {237243#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {237243#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {237243#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,911 INFO L290 TraceCheckUtils]: 66: Hoare triple {237243#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {237243#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {237243#false} ~skip~0 := 0; {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {237243#false} assume !false; {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {237243#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 71: Hoare triple {237243#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {237243#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 73: Hoare triple {237243#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 74: Hoare triple {237243#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {237243#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,912 INFO L290 TraceCheckUtils]: 76: Hoare triple {237243#false} assume 8480 == #t~mem52;havoc #t~mem52; {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {237243#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {237243#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {237243#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {237243#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {237243#false} ~skip~0 := 0; {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {237243#false} assume !false; {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 83: Hoare triple {237243#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 84: Hoare triple {237243#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 85: Hoare triple {237243#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,913 INFO L290 TraceCheckUtils]: 86: Hoare triple {237243#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {237243#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {237243#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {237243#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 90: Hoare triple {237243#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 91: Hoare triple {237243#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 92: Hoare triple {237243#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 93: Hoare triple {237243#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 94: Hoare triple {237243#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {237243#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 96: Hoare triple {237243#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,914 INFO L290 TraceCheckUtils]: 97: Hoare triple {237243#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 98: Hoare triple {237243#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 99: Hoare triple {237243#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 100: Hoare triple {237243#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 101: Hoare triple {237243#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {237243#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 103: Hoare triple {237243#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 104: Hoare triple {237243#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 105: Hoare triple {237243#false} assume 8448 == #t~mem68;havoc #t~mem68; {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 106: Hoare triple {237243#false} assume !(~num1~0 > 0); {237243#false} is VALID [2022-04-15 11:47:36,915 INFO L290 TraceCheckUtils]: 107: Hoare triple {237243#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 108: Hoare triple {237243#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 109: Hoare triple {237243#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 110: Hoare triple {237243#false} ~skip~0 := 0; {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 111: Hoare triple {237243#false} assume !false; {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 112: Hoare triple {237243#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 113: Hoare triple {237243#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 114: Hoare triple {237243#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 115: Hoare triple {237243#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 116: Hoare triple {237243#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 117: Hoare triple {237243#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,916 INFO L290 TraceCheckUtils]: 118: Hoare triple {237243#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 119: Hoare triple {237243#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 120: Hoare triple {237243#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 121: Hoare triple {237243#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 122: Hoare triple {237243#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 123: Hoare triple {237243#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 124: Hoare triple {237243#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 125: Hoare triple {237243#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 126: Hoare triple {237243#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,917 INFO L290 TraceCheckUtils]: 127: Hoare triple {237243#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 128: Hoare triple {237243#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 129: Hoare triple {237243#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 130: Hoare triple {237243#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 131: Hoare triple {237243#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 132: Hoare triple {237243#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 133: Hoare triple {237243#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 134: Hoare triple {237243#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 135: Hoare triple {237243#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 136: Hoare triple {237243#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 137: Hoare triple {237243#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,918 INFO L290 TraceCheckUtils]: 138: Hoare triple {237243#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 139: Hoare triple {237243#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 140: Hoare triple {237243#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 141: Hoare triple {237243#false} assume 8640 == #t~mem75;havoc #t~mem75; {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 142: Hoare triple {237243#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 143: Hoare triple {237243#false} assume !(9 == ~blastFlag~0); {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 144: Hoare triple {237243#false} assume !(12 == ~blastFlag~0); {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 145: Hoare triple {237243#false} assume !(15 == ~blastFlag~0); {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 146: Hoare triple {237243#false} assume !(18 == ~blastFlag~0); {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 147: Hoare triple {237243#false} assume 21 == ~blastFlag~0; {237243#false} is VALID [2022-04-15 11:47:36,919 INFO L290 TraceCheckUtils]: 148: Hoare triple {237243#false} assume !false; {237243#false} is VALID [2022-04-15 11:47:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:47:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:36,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816890131] [2022-04-15 11:47:36,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816890131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:36,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:36,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:36,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:36,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324962996] [2022-04-15 11:47:36,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324962996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:36,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:36,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:36,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830081971] [2022-04-15 11:47:36,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:36,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 11:47:36,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:36,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:36,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:36,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:36,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:36,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:36,994 INFO L87 Difference]: Start difference. First operand 1402 states and 2176 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:40,320 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:46,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:48,430 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-15 11:47:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:52,033 INFO L93 Difference]: Finished difference Result 2583 states and 3963 transitions. [2022-04-15 11:47:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 149 [2022-04-15 11:47:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-04-15 11:47:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 653 transitions. [2022-04-15 11:47:52,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 653 transitions. [2022-04-15 11:47:52,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 653 edges. 653 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:52,618 INFO L225 Difference]: With dead ends: 2583 [2022-04-15 11:47:52,618 INFO L226 Difference]: Without dead ends: 1631 [2022-04-15 11:47:52,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:52,620 INFO L913 BasicCegarLoop]: 159 mSDtfsCounter, 159 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:52,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 450 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 512 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2022-04-15 11:47:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-04-15 11:47:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1402. [2022-04-15 11:47:52,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:52,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1631 states. Second operand has 1402 states, 1397 states have (on average 1.5354330708661417) internal successors, (2145), 1397 states have internal predecessors, (2145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:52,756 INFO L74 IsIncluded]: Start isIncluded. First operand 1631 states. Second operand has 1402 states, 1397 states have (on average 1.5354330708661417) internal successors, (2145), 1397 states have internal predecessors, (2145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:52,757 INFO L87 Difference]: Start difference. First operand 1631 states. Second operand has 1402 states, 1397 states have (on average 1.5354330708661417) internal successors, (2145), 1397 states have internal predecessors, (2145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:52,834 INFO L93 Difference]: Finished difference Result 1631 states and 2455 transitions. [2022-04-15 11:47:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2455 transitions. [2022-04-15 11:47:52,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:52,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:52,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 1402 states, 1397 states have (on average 1.5354330708661417) internal successors, (2145), 1397 states have internal predecessors, (2145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1631 states. [2022-04-15 11:47:52,838 INFO L87 Difference]: Start difference. First operand has 1402 states, 1397 states have (on average 1.5354330708661417) internal successors, (2145), 1397 states have internal predecessors, (2145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1631 states. [2022-04-15 11:47:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:52,912 INFO L93 Difference]: Finished difference Result 1631 states and 2455 transitions. [2022-04-15 11:47:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2455 transitions. [2022-04-15 11:47:52,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:52,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:52,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:52,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1397 states have (on average 1.5354330708661417) internal successors, (2145), 1397 states have internal predecessors, (2145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2149 transitions. [2022-04-15 11:47:53,002 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2149 transitions. Word has length 149 [2022-04-15 11:47:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:53,002 INFO L478 AbstractCegarLoop]: Abstraction has 1402 states and 2149 transitions. [2022-04-15 11:47:53,002 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:53,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1402 states and 2149 transitions. [2022-04-15 11:47:57,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2149 edges. 2149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2149 transitions. [2022-04-15 11:47:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-15 11:47:57,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:57,736 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:57,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 11:47:57,736 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1557624599, now seen corresponding path program 1 times [2022-04-15 11:47:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:57,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [316437807] [2022-04-15 11:47:57,824 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:57,825 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:57,825 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:57,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1557624599, now seen corresponding path program 2 times [2022-04-15 11:47:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:57,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566916432] [2022-04-15 11:47:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:58,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:58,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {248493#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {248486#true} is VALID [2022-04-15 11:47:58,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {248486#true} assume true; {248486#true} is VALID [2022-04-15 11:47:58,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {248486#true} {248486#true} #755#return; {248486#true} is VALID [2022-04-15 11:47:58,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {248486#true} call ULTIMATE.init(); {248493#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:47:58,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {248493#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {248486#true} is VALID [2022-04-15 11:47:58,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {248486#true} assume true; {248486#true} is VALID [2022-04-15 11:47:58,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {248486#true} {248486#true} #755#return; {248486#true} is VALID [2022-04-15 11:47:58,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {248486#true} call #t~ret161 := main(); {248486#true} is VALID [2022-04-15 11:47:58,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {248486#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {248486#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L272 TraceCheckUtils]: 7: Hoare triple {248486#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {248486#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {248486#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {248486#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {248486#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {248486#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {248486#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {248486#true} assume !false; {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {248486#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {248486#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {248486#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {248486#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {248486#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {248486#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {248486#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {248486#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {248486#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {248486#true} assume 8464 == #t~mem55;havoc #t~mem55; {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {248486#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {248486#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {248486#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {248486#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 29: Hoare triple {248486#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {248486#true} is VALID [2022-04-15 11:47:58,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {248486#true} ~skip~0 := 0; {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 31: Hoare triple {248486#true} assume !false; {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {248486#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {248486#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {248486#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 35: Hoare triple {248486#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {248486#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {248486#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 38: Hoare triple {248486#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 39: Hoare triple {248486#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 40: Hoare triple {248486#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {248486#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {248486#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {248486#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {248486#true} assume 8496 == #t~mem58;havoc #t~mem58; {248486#true} is VALID [2022-04-15 11:47:58,020 INFO L290 TraceCheckUtils]: 45: Hoare triple {248486#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {248486#true} is VALID [2022-04-15 11:47:58,020 INFO L290 TraceCheckUtils]: 46: Hoare triple {248486#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {248486#true} is VALID [2022-04-15 11:47:58,020 INFO L290 TraceCheckUtils]: 47: Hoare triple {248486#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {248486#true} is VALID [2022-04-15 11:47:58,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {248486#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,023 INFO L290 TraceCheckUtils]: 52: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:47:58,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {248491#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {248492#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-15 11:47:58,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {248492#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {248487#false} is VALID [2022-04-15 11:47:58,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {248487#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {248487#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {248487#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {248487#false} assume !(3 != #t~mem82 / 256);havoc #t~mem82;call write~int(8192, ~s.base, 4 + ~s.offset, 4);call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~s.base, 60 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {248487#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 65: Hoare triple {248487#false} assume !(0 == ~tmp___4~0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call #t~mem85 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {248487#false} assume !(12292 != #t~mem85);havoc #t~mem85;call #t~mem88.base, #t~mem88.offset := read~$Pointer$(~s.base, 204 + ~s.offset, 4);call #t~mem89 := read~int(#t~mem88.base, 76 + #t~mem88.offset, 4);call write~int(1 + #t~mem89, #t~mem88.base, 76 + #t~mem88.offset, 4);havoc #t~mem88.base, #t~mem88.offset;havoc #t~mem89;call write~int(8480, ~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 67: Hoare triple {248487#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {248487#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 69: Hoare triple {248487#false} ~skip~0 := 0; {248487#false} is VALID [2022-04-15 11:47:58,027 INFO L290 TraceCheckUtils]: 70: Hoare triple {248487#false} assume !false; {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {248487#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 72: Hoare triple {248487#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {248487#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 74: Hoare triple {248487#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {248487#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 76: Hoare triple {248487#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {248487#false} assume 8480 == #t~mem52;havoc #t~mem52; {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 78: Hoare triple {248487#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet90 && #t~nondet90 <= 2147483647;~ret~0 := #t~nondet90;havoc #t~nondet90; {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 79: Hoare triple {248487#false} assume !(~ret~0 <= 0);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8482, #t~mem91.base, 844 + #t~mem91.offset, 4);havoc #t~mem91.base, #t~mem91.offset;call write~int(8448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {248487#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {248487#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {248487#false} is VALID [2022-04-15 11:47:58,028 INFO L290 TraceCheckUtils]: 82: Hoare triple {248487#false} ~skip~0 := 0; {248487#false} is VALID [2022-04-15 11:47:58,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {248487#false} assume !false; {248487#false} is VALID [2022-04-15 11:47:58,039 INFO L290 TraceCheckUtils]: 84: Hoare triple {248487#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,039 INFO L290 TraceCheckUtils]: 85: Hoare triple {248487#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,039 INFO L290 TraceCheckUtils]: 86: Hoare triple {248487#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {248487#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {248487#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 89: Hoare triple {248487#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 90: Hoare triple {248487#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 91: Hoare triple {248487#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 92: Hoare triple {248487#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 93: Hoare triple {248487#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 94: Hoare triple {248487#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 95: Hoare triple {248487#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,040 INFO L290 TraceCheckUtils]: 96: Hoare triple {248487#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 97: Hoare triple {248487#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 98: Hoare triple {248487#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 99: Hoare triple {248487#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 100: Hoare triple {248487#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 101: Hoare triple {248487#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 102: Hoare triple {248487#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 103: Hoare triple {248487#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 104: Hoare triple {248487#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 105: Hoare triple {248487#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,041 INFO L290 TraceCheckUtils]: 106: Hoare triple {248487#false} assume 8448 == #t~mem68;havoc #t~mem68; {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 107: Hoare triple {248487#false} assume !(~num1~0 > 0); {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 108: Hoare triple {248487#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 109: Hoare triple {248487#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 110: Hoare triple {248487#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 111: Hoare triple {248487#false} ~skip~0 := 0; {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 112: Hoare triple {248487#false} assume !false; {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 113: Hoare triple {248487#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 114: Hoare triple {248487#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 115: Hoare triple {248487#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,042 INFO L290 TraceCheckUtils]: 116: Hoare triple {248487#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 117: Hoare triple {248487#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 118: Hoare triple {248487#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 119: Hoare triple {248487#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 120: Hoare triple {248487#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 121: Hoare triple {248487#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 122: Hoare triple {248487#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 123: Hoare triple {248487#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 124: Hoare triple {248487#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 125: Hoare triple {248487#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 126: Hoare triple {248487#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,043 INFO L290 TraceCheckUtils]: 127: Hoare triple {248487#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 128: Hoare triple {248487#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 129: Hoare triple {248487#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 130: Hoare triple {248487#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 131: Hoare triple {248487#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 132: Hoare triple {248487#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 133: Hoare triple {248487#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 134: Hoare triple {248487#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 135: Hoare triple {248487#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 136: Hoare triple {248487#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,044 INFO L290 TraceCheckUtils]: 137: Hoare triple {248487#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 138: Hoare triple {248487#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 139: Hoare triple {248487#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 140: Hoare triple {248487#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 141: Hoare triple {248487#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 142: Hoare triple {248487#false} assume 8640 == #t~mem75;havoc #t~mem75; {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 143: Hoare triple {248487#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 144: Hoare triple {248487#false} assume !(9 == ~blastFlag~0); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 145: Hoare triple {248487#false} assume !(12 == ~blastFlag~0); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 146: Hoare triple {248487#false} assume !(15 == ~blastFlag~0); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 147: Hoare triple {248487#false} assume !(18 == ~blastFlag~0); {248487#false} is VALID [2022-04-15 11:47:58,045 INFO L290 TraceCheckUtils]: 148: Hoare triple {248487#false} assume 21 == ~blastFlag~0; {248487#false} is VALID [2022-04-15 11:47:58,046 INFO L290 TraceCheckUtils]: 149: Hoare triple {248487#false} assume !false; {248487#false} is VALID [2022-04-15 11:47:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:47:58,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:58,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566916432] [2022-04-15 11:47:58,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566916432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:58,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:58,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:58,047 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:58,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [316437807] [2022-04-15 11:47:58,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [316437807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:58,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:58,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:58,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743890582] [2022-04-15 11:47:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-15 11:47:58,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:58,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:58,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:58,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:58,134 INFO L87 Difference]: Start difference. First operand 1402 states and 2149 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:00,187 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-15 11:48:03,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:03,980 INFO L93 Difference]: Finished difference Result 2563 states and 3892 transitions. [2022-04-15 11:48:03,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:03,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-15 11:48:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2022-04-15 11:48:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:03,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2022-04-15 11:48:03,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 639 transitions. [2022-04-15 11:48:04,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 639 edges. 639 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:04,544 INFO L225 Difference]: With dead ends: 2563 [2022-04-15 11:48:04,544 INFO L226 Difference]: Without dead ends: 1611 [2022-04-15 11:48:04,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:04,546 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:04,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 470 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 498 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:48:04,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2022-04-15 11:48:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1402. [2022-04-15 11:48:04,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:04,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1611 states. Second operand has 1402 states, 1397 states have (on average 1.5161059413027917) internal successors, (2118), 1397 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,686 INFO L74 IsIncluded]: Start isIncluded. First operand 1611 states. Second operand has 1402 states, 1397 states have (on average 1.5161059413027917) internal successors, (2118), 1397 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,687 INFO L87 Difference]: Start difference. First operand 1611 states. Second operand has 1402 states, 1397 states have (on average 1.5161059413027917) internal successors, (2118), 1397 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:04,756 INFO L93 Difference]: Finished difference Result 1611 states and 2402 transitions. [2022-04-15 11:48:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2402 transitions. [2022-04-15 11:48:04,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:04,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:04,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 1402 states, 1397 states have (on average 1.5161059413027917) internal successors, (2118), 1397 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1611 states. [2022-04-15 11:48:04,761 INFO L87 Difference]: Start difference. First operand has 1402 states, 1397 states have (on average 1.5161059413027917) internal successors, (2118), 1397 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1611 states. [2022-04-15 11:48:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:04,842 INFO L93 Difference]: Finished difference Result 1611 states and 2402 transitions. [2022-04-15 11:48:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2402 transitions. [2022-04-15 11:48:04,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:04,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:04,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:04,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:04,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1397 states have (on average 1.5161059413027917) internal successors, (2118), 1397 states have internal predecessors, (2118), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2122 transitions. [2022-04-15 11:48:04,931 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2122 transitions. Word has length 150 [2022-04-15 11:48:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:04,931 INFO L478 AbstractCegarLoop]: Abstraction has 1402 states and 2122 transitions. [2022-04-15 11:48:04,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:04,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1402 states and 2122 transitions. [2022-04-15 11:48:09,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2122 edges. 2122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2122 transitions. [2022-04-15 11:48:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 11:48:09,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:09,493 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-15 11:48:09,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 11:48:09,493 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1355169351, now seen corresponding path program 1 times [2022-04-15 11:48:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:09,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1846141458] [2022-04-15 11:48:09,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:09,632 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:09,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1355169351, now seen corresponding path program 2 times [2022-04-15 11:48:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:09,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266084858] [2022-04-15 11:48:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:09,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:09,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {259657#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {259650#true} is VALID [2022-04-15 11:48:09,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {259650#true} assume true; {259650#true} is VALID [2022-04-15 11:48:09,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {259650#true} {259650#true} #755#return; {259650#true} is VALID [2022-04-15 11:48:09,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {259650#true} call ULTIMATE.init(); {259657#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:09,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {259657#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {259650#true} is VALID [2022-04-15 11:48:09,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {259650#true} assume true; {259650#true} is VALID [2022-04-15 11:48:09,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259650#true} {259650#true} #755#return; {259650#true} is VALID [2022-04-15 11:48:09,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {259650#true} call #t~ret161 := main(); {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {259650#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {259650#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L272 TraceCheckUtils]: 7: Hoare triple {259650#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {259650#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {259650#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {259650#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {259650#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {259650#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {259650#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {259650#true} is VALID [2022-04-15 11:48:09,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {259650#true} assume !false; {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {259650#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {259650#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {259650#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {259650#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {259650#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {259650#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {259650#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {259650#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {259650#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {259650#true} assume 8464 == #t~mem55;havoc #t~mem55; {259650#true} is VALID [2022-04-15 11:48:09,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {259650#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {259650#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {259650#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {259650#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {259650#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 30: Hoare triple {259650#true} ~skip~0 := 0; {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {259650#true} assume !false; {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {259650#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {259650#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {259650#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {259650#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {259650#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {259650#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {259650#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {259650#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {259650#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {259650#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {259650#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {259650#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {259650#true} assume 8496 == #t~mem58;havoc #t~mem58; {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {259650#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 46: Hoare triple {259650#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {259650#true} is VALID [2022-04-15 11:48:09,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {259650#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {259650#true} is VALID [2022-04-15 11:48:09,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {259650#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,836 INFO L290 TraceCheckUtils]: 51: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,836 INFO L290 TraceCheckUtils]: 53: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,840 INFO L290 TraceCheckUtils]: 60: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,840 INFO L290 TraceCheckUtils]: 61: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,843 INFO L290 TraceCheckUtils]: 66: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,843 INFO L290 TraceCheckUtils]: 67: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,844 INFO L290 TraceCheckUtils]: 70: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:09,845 INFO L290 TraceCheckUtils]: 71: Hoare triple {259655#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {259656#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-15 11:48:09,845 INFO L290 TraceCheckUtils]: 72: Hoare triple {259656#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {259651#false} is VALID [2022-04-15 11:48:09,845 INFO L290 TraceCheckUtils]: 73: Hoare triple {259651#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {259651#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {259651#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {259651#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {259651#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {259651#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 79: Hoare triple {259651#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 80: Hoare triple {259651#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {259651#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {259651#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 83: Hoare triple {259651#false} ~skip~0 := 0; {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {259651#false} assume !false; {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 85: Hoare triple {259651#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 86: Hoare triple {259651#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 87: Hoare triple {259651#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {259651#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {259651#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {259651#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 91: Hoare triple {259651#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,847 INFO L290 TraceCheckUtils]: 92: Hoare triple {259651#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {259651#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 94: Hoare triple {259651#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 95: Hoare triple {259651#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 96: Hoare triple {259651#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 97: Hoare triple {259651#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 98: Hoare triple {259651#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 99: Hoare triple {259651#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 100: Hoare triple {259651#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 101: Hoare triple {259651#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,848 INFO L290 TraceCheckUtils]: 102: Hoare triple {259651#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 103: Hoare triple {259651#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 104: Hoare triple {259651#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 105: Hoare triple {259651#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 106: Hoare triple {259651#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 107: Hoare triple {259651#false} assume 8448 == #t~mem68;havoc #t~mem68; {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {259651#false} assume !(~num1~0 > 0); {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 109: Hoare triple {259651#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {259651#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 111: Hoare triple {259651#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {259651#false} is VALID [2022-04-15 11:48:09,849 INFO L290 TraceCheckUtils]: 112: Hoare triple {259651#false} ~skip~0 := 0; {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 113: Hoare triple {259651#false} assume !false; {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 114: Hoare triple {259651#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 115: Hoare triple {259651#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 116: Hoare triple {259651#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 117: Hoare triple {259651#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 118: Hoare triple {259651#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 119: Hoare triple {259651#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 120: Hoare triple {259651#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 121: Hoare triple {259651#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,850 INFO L290 TraceCheckUtils]: 122: Hoare triple {259651#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 123: Hoare triple {259651#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 124: Hoare triple {259651#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 125: Hoare triple {259651#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 126: Hoare triple {259651#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 127: Hoare triple {259651#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 128: Hoare triple {259651#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 129: Hoare triple {259651#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 130: Hoare triple {259651#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 131: Hoare triple {259651#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 132: Hoare triple {259651#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 133: Hoare triple {259651#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 134: Hoare triple {259651#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,851 INFO L290 TraceCheckUtils]: 135: Hoare triple {259651#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 136: Hoare triple {259651#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 137: Hoare triple {259651#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 138: Hoare triple {259651#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 139: Hoare triple {259651#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 140: Hoare triple {259651#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 141: Hoare triple {259651#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 142: Hoare triple {259651#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 143: Hoare triple {259651#false} assume 8640 == #t~mem75;havoc #t~mem75; {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 144: Hoare triple {259651#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 145: Hoare triple {259651#false} assume !(9 == ~blastFlag~0); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 146: Hoare triple {259651#false} assume !(12 == ~blastFlag~0); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 147: Hoare triple {259651#false} assume !(15 == ~blastFlag~0); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 148: Hoare triple {259651#false} assume !(18 == ~blastFlag~0); {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 149: Hoare triple {259651#false} assume 21 == ~blastFlag~0; {259651#false} is VALID [2022-04-15 11:48:09,852 INFO L290 TraceCheckUtils]: 150: Hoare triple {259651#false} assume !false; {259651#false} is VALID [2022-04-15 11:48:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:48:09,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:09,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266084858] [2022-04-15 11:48:09,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266084858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:09,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:09,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:09,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:09,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1846141458] [2022-04-15 11:48:09,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1846141458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:09,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:09,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:09,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306011308] [2022-04-15 11:48:09,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:09,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 11:48:09,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:09,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:09,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:09,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:09,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:09,934 INFO L87 Difference]: Start difference. First operand 1402 states and 2122 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:13,629 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-15 11:48:15,874 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-15 11:48:18,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:24,949 INFO L93 Difference]: Finished difference Result 3113 states and 4685 transitions. [2022-04-15 11:48:24,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 151 [2022-04-15 11:48:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-04-15 11:48:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-04-15 11:48:24,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 638 transitions. [2022-04-15 11:48:25,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:25,535 INFO L225 Difference]: With dead ends: 3113 [2022-04-15 11:48:25,535 INFO L226 Difference]: Without dead ends: 1737 [2022-04-15 11:48:25,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:25,537 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 136 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:25,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 470 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-04-15 11:48:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2022-04-15 11:48:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1486. [2022-04-15 11:48:25,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:25,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1737 states. Second operand has 1486 states, 1481 states have (on average 1.5030384875084402) internal successors, (2226), 1481 states have internal predecessors, (2226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:25,694 INFO L74 IsIncluded]: Start isIncluded. First operand 1737 states. Second operand has 1486 states, 1481 states have (on average 1.5030384875084402) internal successors, (2226), 1481 states have internal predecessors, (2226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:25,695 INFO L87 Difference]: Start difference. First operand 1737 states. Second operand has 1486 states, 1481 states have (on average 1.5030384875084402) internal successors, (2226), 1481 states have internal predecessors, (2226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:25,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:25,781 INFO L93 Difference]: Finished difference Result 1737 states and 2570 transitions. [2022-04-15 11:48:25,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2570 transitions. [2022-04-15 11:48:25,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:25,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:25,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 1486 states, 1481 states have (on average 1.5030384875084402) internal successors, (2226), 1481 states have internal predecessors, (2226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1737 states. [2022-04-15 11:48:25,785 INFO L87 Difference]: Start difference. First operand has 1486 states, 1481 states have (on average 1.5030384875084402) internal successors, (2226), 1481 states have internal predecessors, (2226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1737 states. [2022-04-15 11:48:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:25,870 INFO L93 Difference]: Finished difference Result 1737 states and 2570 transitions. [2022-04-15 11:48:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2570 transitions. [2022-04-15 11:48:25,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:25,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:25,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:25,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1481 states have (on average 1.5030384875084402) internal successors, (2226), 1481 states have internal predecessors, (2226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2230 transitions. [2022-04-15 11:48:25,969 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2230 transitions. Word has length 151 [2022-04-15 11:48:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:25,969 INFO L478 AbstractCegarLoop]: Abstraction has 1486 states and 2230 transitions. [2022-04-15 11:48:25,970 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:25,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1486 states and 2230 transitions. [2022-04-15 11:48:30,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2230 edges. 2230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2230 transitions. [2022-04-15 11:48:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-04-15 11:48:30,541 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:30,541 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-15 11:48:30,541 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 11:48:30,542 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash -288018326, now seen corresponding path program 1 times [2022-04-15 11:48:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:30,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230053478] [2022-04-15 11:48:30,680 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:30,680 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:30,680 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash -288018326, now seen corresponding path program 2 times [2022-04-15 11:48:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:30,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200257485] [2022-04-15 11:48:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:30,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:30,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {272341#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {272334#true} is VALID [2022-04-15 11:48:30,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {272334#true} assume true; {272334#true} is VALID [2022-04-15 11:48:30,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {272334#true} {272334#true} #755#return; {272334#true} is VALID [2022-04-15 11:48:30,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {272334#true} call ULTIMATE.init(); {272341#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:30,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {272341#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {272334#true} assume true; {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {272334#true} {272334#true} #755#return; {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {272334#true} call #t~ret161 := main(); {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {272334#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {272334#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L272 TraceCheckUtils]: 7: Hoare triple {272334#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {272334#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {272334#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {272334#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {272334#true} is VALID [2022-04-15 11:48:30,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {272334#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {272334#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {272334#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {272334#true} assume !false; {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {272334#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {272334#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {272334#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {272334#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {272334#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {272334#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {272334#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {272334#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {272334#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {272334#true} assume 8464 == #t~mem55;havoc #t~mem55; {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {272334#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {272334#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {272334#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {272334#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {272334#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {272334#true} ~skip~0 := 0; {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {272334#true} assume !false; {272334#true} is VALID [2022-04-15 11:48:30,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {272334#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {272334#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {272334#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {272334#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {272334#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {272334#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {272334#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {272334#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {272334#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {272334#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {272334#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,862 INFO L290 TraceCheckUtils]: 43: Hoare triple {272334#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {272334#true} assume 8496 == #t~mem58;havoc #t~mem58; {272334#true} is VALID [2022-04-15 11:48:30,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {272334#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {272334#true} is VALID [2022-04-15 11:48:30,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {272334#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {272334#true} is VALID [2022-04-15 11:48:30,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {272334#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {272334#true} is VALID [2022-04-15 11:48:30,864 INFO L290 TraceCheckUtils]: 48: Hoare triple {272334#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,866 INFO L290 TraceCheckUtils]: 51: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,866 INFO L290 TraceCheckUtils]: 52: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,867 INFO L290 TraceCheckUtils]: 54: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,868 INFO L290 TraceCheckUtils]: 57: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,871 INFO L290 TraceCheckUtils]: 62: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,871 INFO L290 TraceCheckUtils]: 63: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,872 INFO L290 TraceCheckUtils]: 64: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,872 INFO L290 TraceCheckUtils]: 65: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,873 INFO L290 TraceCheckUtils]: 66: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,873 INFO L290 TraceCheckUtils]: 67: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,874 INFO L290 TraceCheckUtils]: 68: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,874 INFO L290 TraceCheckUtils]: 69: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,874 INFO L290 TraceCheckUtils]: 70: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,875 INFO L290 TraceCheckUtils]: 71: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:30,875 INFO L290 TraceCheckUtils]: 72: Hoare triple {272339#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272340#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-15 11:48:30,876 INFO L290 TraceCheckUtils]: 73: Hoare triple {272340#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {272335#false} is VALID [2022-04-15 11:48:30,876 INFO L290 TraceCheckUtils]: 74: Hoare triple {272335#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,876 INFO L290 TraceCheckUtils]: 75: Hoare triple {272335#false} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,876 INFO L290 TraceCheckUtils]: 76: Hoare triple {272335#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {272335#false} is VALID [2022-04-15 11:48:30,876 INFO L290 TraceCheckUtils]: 77: Hoare triple {272335#false} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,876 INFO L290 TraceCheckUtils]: 78: Hoare triple {272335#false} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {272335#false} is VALID [2022-04-15 11:48:30,876 INFO L290 TraceCheckUtils]: 79: Hoare triple {272335#false} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 80: Hoare triple {272335#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 81: Hoare triple {272335#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 82: Hoare triple {272335#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 83: Hoare triple {272335#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 84: Hoare triple {272335#false} ~skip~0 := 0; {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 85: Hoare triple {272335#false} assume !false; {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 86: Hoare triple {272335#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 87: Hoare triple {272335#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 88: Hoare triple {272335#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,877 INFO L290 TraceCheckUtils]: 89: Hoare triple {272335#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 90: Hoare triple {272335#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 91: Hoare triple {272335#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {272335#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {272335#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 94: Hoare triple {272335#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 95: Hoare triple {272335#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 96: Hoare triple {272335#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 97: Hoare triple {272335#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 98: Hoare triple {272335#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,878 INFO L290 TraceCheckUtils]: 99: Hoare triple {272335#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 100: Hoare triple {272335#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 101: Hoare triple {272335#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {272335#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 103: Hoare triple {272335#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {272335#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 105: Hoare triple {272335#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 106: Hoare triple {272335#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 107: Hoare triple {272335#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,879 INFO L290 TraceCheckUtils]: 108: Hoare triple {272335#false} assume 8448 == #t~mem68;havoc #t~mem68; {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 109: Hoare triple {272335#false} assume !(~num1~0 > 0); {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 110: Hoare triple {272335#false} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 111: Hoare triple {272335#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 112: Hoare triple {272335#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 113: Hoare triple {272335#false} ~skip~0 := 0; {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 114: Hoare triple {272335#false} assume !false; {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {272335#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,880 INFO L290 TraceCheckUtils]: 116: Hoare triple {272335#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,881 INFO L290 TraceCheckUtils]: 117: Hoare triple {272335#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 118: Hoare triple {272335#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 119: Hoare triple {272335#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 120: Hoare triple {272335#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 121: Hoare triple {272335#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 122: Hoare triple {272335#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 123: Hoare triple {272335#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 124: Hoare triple {272335#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 125: Hoare triple {272335#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 126: Hoare triple {272335#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,882 INFO L290 TraceCheckUtils]: 127: Hoare triple {272335#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 128: Hoare triple {272335#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 129: Hoare triple {272335#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 130: Hoare triple {272335#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 131: Hoare triple {272335#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 132: Hoare triple {272335#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 133: Hoare triple {272335#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 134: Hoare triple {272335#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 135: Hoare triple {272335#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 136: Hoare triple {272335#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 137: Hoare triple {272335#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,883 INFO L290 TraceCheckUtils]: 138: Hoare triple {272335#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 139: Hoare triple {272335#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 140: Hoare triple {272335#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 141: Hoare triple {272335#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 142: Hoare triple {272335#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 143: Hoare triple {272335#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 144: Hoare triple {272335#false} assume 8640 == #t~mem75;havoc #t~mem75; {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 145: Hoare triple {272335#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 146: Hoare triple {272335#false} assume !(9 == ~blastFlag~0); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 147: Hoare triple {272335#false} assume !(12 == ~blastFlag~0); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 148: Hoare triple {272335#false} assume !(15 == ~blastFlag~0); {272335#false} is VALID [2022-04-15 11:48:30,884 INFO L290 TraceCheckUtils]: 149: Hoare triple {272335#false} assume !(18 == ~blastFlag~0); {272335#false} is VALID [2022-04-15 11:48:30,885 INFO L290 TraceCheckUtils]: 150: Hoare triple {272335#false} assume 21 == ~blastFlag~0; {272335#false} is VALID [2022-04-15 11:48:30,885 INFO L290 TraceCheckUtils]: 151: Hoare triple {272335#false} assume !false; {272335#false} is VALID [2022-04-15 11:48:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:48:30,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:30,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200257485] [2022-04-15 11:48:30,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200257485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:30,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:30,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:30,886 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230053478] [2022-04-15 11:48:30,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230053478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:30,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:30,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492671201] [2022-04-15 11:48:30,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:30,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 11:48:30,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:30,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:30,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:30,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:30,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:30,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:30,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:30,987 INFO L87 Difference]: Start difference. First operand 1486 states and 2230 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:33,029 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-15 11:48:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:36,883 INFO L93 Difference]: Finished difference Result 3155 states and 4709 transitions. [2022-04-15 11:48:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:36,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 152 [2022-04-15 11:48:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:36,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-04-15 11:48:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2022-04-15 11:48:36,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 638 transitions. [2022-04-15 11:48:37,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 638 edges. 638 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:37,503 INFO L225 Difference]: With dead ends: 3155 [2022-04-15 11:48:37,503 INFO L226 Difference]: Without dead ends: 1695 [2022-04-15 11:48:37,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:37,506 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 135 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:37,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 438 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:48:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-04-15 11:48:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1486. [2022-04-15 11:48:37,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:37,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1695 states. Second operand has 1486 states, 1481 states have (on average 1.486833220796759) internal successors, (2202), 1481 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,753 INFO L74 IsIncluded]: Start isIncluded. First operand 1695 states. Second operand has 1486 states, 1481 states have (on average 1.486833220796759) internal successors, (2202), 1481 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,754 INFO L87 Difference]: Start difference. First operand 1695 states. Second operand has 1486 states, 1481 states have (on average 1.486833220796759) internal successors, (2202), 1481 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:37,840 INFO L93 Difference]: Finished difference Result 1695 states and 2486 transitions. [2022-04-15 11:48:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2486 transitions. [2022-04-15 11:48:37,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:37,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:37,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 1486 states, 1481 states have (on average 1.486833220796759) internal successors, (2202), 1481 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1695 states. [2022-04-15 11:48:37,844 INFO L87 Difference]: Start difference. First operand has 1486 states, 1481 states have (on average 1.486833220796759) internal successors, (2202), 1481 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1695 states. [2022-04-15 11:48:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:37,924 INFO L93 Difference]: Finished difference Result 1695 states and 2486 transitions. [2022-04-15 11:48:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2486 transitions. [2022-04-15 11:48:37,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:37,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:37,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:37,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1481 states have (on average 1.486833220796759) internal successors, (2202), 1481 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2206 transitions. [2022-04-15 11:48:38,025 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2206 transitions. Word has length 152 [2022-04-15 11:48:38,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:38,026 INFO L478 AbstractCegarLoop]: Abstraction has 1486 states and 2206 transitions. [2022-04-15 11:48:38,026 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:38,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1486 states and 2206 transitions. [2022-04-15 11:48:42,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2206 edges. 2206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2206 transitions. [2022-04-15 11:48:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-15 11:48:42,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:42,403 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:48:42,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 11:48:42,403 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:42,404 INFO L85 PathProgramCache]: Analyzing trace with hash 395352204, now seen corresponding path program 1 times [2022-04-15 11:48:42,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:42,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691762112] [2022-04-15 11:48:42,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:42,495 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:42,495 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 395352204, now seen corresponding path program 2 times [2022-04-15 11:48:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:42,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459951268] [2022-04-15 11:48:42,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:42,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:42,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {285025#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {285018#true} is VALID [2022-04-15 11:48:42,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {285018#true} assume true; {285018#true} is VALID [2022-04-15 11:48:42,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {285018#true} {285018#true} #755#return; {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {285018#true} call ULTIMATE.init(); {285025#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:48:42,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {285025#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {285018#true} assume true; {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285018#true} {285018#true} #755#return; {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {285018#true} call #t~ret161 := main(); {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {285018#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {285018#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L272 TraceCheckUtils]: 7: Hoare triple {285018#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {285018#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {285018#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {285018#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {285018#true} is VALID [2022-04-15 11:48:42,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {285018#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {285018#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {285018#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {285018#true} assume !false; {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {285018#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {285018#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {285018#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {285018#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {285018#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {285018#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {285018#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {285018#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {285018#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {285018#true} assume 8464 == #t~mem55;havoc #t~mem55; {285018#true} is VALID [2022-04-15 11:48:42,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {285018#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {285018#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {285018#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {285018#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {285018#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {285018#true} ~skip~0 := 0; {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {285018#true} assume !false; {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {285018#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {285018#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {285018#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {285018#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {285018#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {285018#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {285018#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {285018#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 40: Hoare triple {285018#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 41: Hoare triple {285018#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 42: Hoare triple {285018#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 43: Hoare triple {285018#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 44: Hoare triple {285018#true} assume 8496 == #t~mem58;havoc #t~mem58; {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 45: Hoare triple {285018#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {285018#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {285018#true} is VALID [2022-04-15 11:48:42,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {285018#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {285018#true} is VALID [2022-04-15 11:48:42,681 INFO L290 TraceCheckUtils]: 48: Hoare triple {285018#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,682 INFO L290 TraceCheckUtils]: 49: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,682 INFO L290 TraceCheckUtils]: 50: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,683 INFO L290 TraceCheckUtils]: 52: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,684 INFO L290 TraceCheckUtils]: 55: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,692 INFO L290 TraceCheckUtils]: 63: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,694 INFO L290 TraceCheckUtils]: 66: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,694 INFO L290 TraceCheckUtils]: 67: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,695 INFO L290 TraceCheckUtils]: 68: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,695 INFO L290 TraceCheckUtils]: 69: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,696 INFO L290 TraceCheckUtils]: 70: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,696 INFO L290 TraceCheckUtils]: 71: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,697 INFO L290 TraceCheckUtils]: 72: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,697 INFO L290 TraceCheckUtils]: 73: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,698 INFO L290 TraceCheckUtils]: 74: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,698 INFO L290 TraceCheckUtils]: 75: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:42,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {285023#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {285024#(= |ssl3_accept_#t~mem71| 8656)} is VALID [2022-04-15 11:48:42,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {285024#(= |ssl3_accept_#t~mem71| 8656)} assume 8592 == #t~mem71;havoc #t~mem71; {285019#false} is VALID [2022-04-15 11:48:42,702 INFO L290 TraceCheckUtils]: 80: Hoare triple {285019#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {285019#false} is VALID [2022-04-15 11:48:42,702 INFO L290 TraceCheckUtils]: 81: Hoare triple {285019#false} assume !(7 == ~blastFlag~0); {285019#false} is VALID [2022-04-15 11:48:42,702 INFO L290 TraceCheckUtils]: 82: Hoare triple {285019#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,702 INFO L290 TraceCheckUtils]: 83: Hoare triple {285019#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {285019#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {285019#false} is VALID [2022-04-15 11:48:42,702 INFO L290 TraceCheckUtils]: 85: Hoare triple {285019#false} ~skip~0 := 0; {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 86: Hoare triple {285019#false} assume !false; {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 87: Hoare triple {285019#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 88: Hoare triple {285019#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 89: Hoare triple {285019#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 90: Hoare triple {285019#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 91: Hoare triple {285019#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 92: Hoare triple {285019#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 93: Hoare triple {285019#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 94: Hoare triple {285019#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,703 INFO L290 TraceCheckUtils]: 95: Hoare triple {285019#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 96: Hoare triple {285019#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 97: Hoare triple {285019#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 98: Hoare triple {285019#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 99: Hoare triple {285019#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 100: Hoare triple {285019#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 101: Hoare triple {285019#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 102: Hoare triple {285019#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 103: Hoare triple {285019#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 104: Hoare triple {285019#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 105: Hoare triple {285019#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,704 INFO L290 TraceCheckUtils]: 106: Hoare triple {285019#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 107: Hoare triple {285019#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 108: Hoare triple {285019#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 109: Hoare triple {285019#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 110: Hoare triple {285019#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 111: Hoare triple {285019#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 112: Hoare triple {285019#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 113: Hoare triple {285019#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 114: Hoare triple {285019#false} assume 8608 == #t~mem73;havoc #t~mem73; {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 115: Hoare triple {285019#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {285019#false} is VALID [2022-04-15 11:48:42,705 INFO L290 TraceCheckUtils]: 116: Hoare triple {285019#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 117: Hoare triple {285019#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 118: Hoare triple {285019#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 119: Hoare triple {285019#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 120: Hoare triple {285019#false} ~skip~0 := 0; {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 121: Hoare triple {285019#false} assume !false; {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 122: Hoare triple {285019#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 123: Hoare triple {285019#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 124: Hoare triple {285019#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,706 INFO L290 TraceCheckUtils]: 125: Hoare triple {285019#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 126: Hoare triple {285019#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 127: Hoare triple {285019#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 128: Hoare triple {285019#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 129: Hoare triple {285019#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 130: Hoare triple {285019#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 131: Hoare triple {285019#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 132: Hoare triple {285019#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 133: Hoare triple {285019#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 134: Hoare triple {285019#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,707 INFO L290 TraceCheckUtils]: 135: Hoare triple {285019#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 136: Hoare triple {285019#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 137: Hoare triple {285019#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 138: Hoare triple {285019#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 139: Hoare triple {285019#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 140: Hoare triple {285019#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 141: Hoare triple {285019#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 142: Hoare triple {285019#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 143: Hoare triple {285019#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 144: Hoare triple {285019#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,708 INFO L290 TraceCheckUtils]: 145: Hoare triple {285019#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 146: Hoare triple {285019#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 147: Hoare triple {285019#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 148: Hoare triple {285019#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 149: Hoare triple {285019#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 150: Hoare triple {285019#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 151: Hoare triple {285019#false} assume 8640 == #t~mem75;havoc #t~mem75; {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 152: Hoare triple {285019#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 153: Hoare triple {285019#false} assume !(9 == ~blastFlag~0); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 154: Hoare triple {285019#false} assume !(12 == ~blastFlag~0); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 155: Hoare triple {285019#false} assume !(15 == ~blastFlag~0); {285019#false} is VALID [2022-04-15 11:48:42,709 INFO L290 TraceCheckUtils]: 156: Hoare triple {285019#false} assume !(18 == ~blastFlag~0); {285019#false} is VALID [2022-04-15 11:48:42,710 INFO L290 TraceCheckUtils]: 157: Hoare triple {285019#false} assume 21 == ~blastFlag~0; {285019#false} is VALID [2022-04-15 11:48:42,710 INFO L290 TraceCheckUtils]: 158: Hoare triple {285019#false} assume !false; {285019#false} is VALID [2022-04-15 11:48:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:48:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:42,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459951268] [2022-04-15 11:48:42,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459951268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:42,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:42,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:42,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:42,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691762112] [2022-04-15 11:48:42,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691762112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:42,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:42,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:42,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237247577] [2022-04-15 11:48:42,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-15 11:48:42,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:42,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:42,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:42,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:42,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:42,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:42,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:42,800 INFO L87 Difference]: Start difference. First operand 1486 states and 2206 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:49,011 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-15 11:48:52,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:58,446 INFO L93 Difference]: Finished difference Result 3017 states and 4470 transitions. [2022-04-15 11:48:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:58,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-15 11:48:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2022-04-15 11:48:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2022-04-15 11:48:58,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 556 transitions. [2022-04-15 11:48:58,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:58,933 INFO L225 Difference]: With dead ends: 3017 [2022-04-15 11:48:58,934 INFO L226 Difference]: Without dead ends: 1557 [2022-04-15 11:48:58,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:58,936 INFO L913 BasicCegarLoop]: 276 mSDtfsCounter, 52 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:58,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 689 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 11:48:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2022-04-15 11:48:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1486. [2022-04-15 11:48:59,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:59,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1557 states. Second operand has 1486 states, 1481 states have (on average 1.4848075624577988) internal successors, (2199), 1481 states have internal predecessors, (2199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:59,087 INFO L74 IsIncluded]: Start isIncluded. First operand 1557 states. Second operand has 1486 states, 1481 states have (on average 1.4848075624577988) internal successors, (2199), 1481 states have internal predecessors, (2199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:59,088 INFO L87 Difference]: Start difference. First operand 1557 states. Second operand has 1486 states, 1481 states have (on average 1.4848075624577988) internal successors, (2199), 1481 states have internal predecessors, (2199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:59,159 INFO L93 Difference]: Finished difference Result 1557 states and 2292 transitions. [2022-04-15 11:48:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2292 transitions. [2022-04-15 11:48:59,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:59,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:59,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 1486 states, 1481 states have (on average 1.4848075624577988) internal successors, (2199), 1481 states have internal predecessors, (2199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1557 states. [2022-04-15 11:48:59,163 INFO L87 Difference]: Start difference. First operand has 1486 states, 1481 states have (on average 1.4848075624577988) internal successors, (2199), 1481 states have internal predecessors, (2199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1557 states. [2022-04-15 11:48:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:59,246 INFO L93 Difference]: Finished difference Result 1557 states and 2292 transitions. [2022-04-15 11:48:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2292 transitions. [2022-04-15 11:48:59,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:59,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:59,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:59,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1481 states have (on average 1.4848075624577988) internal successors, (2199), 1481 states have internal predecessors, (2199), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2203 transitions. [2022-04-15 11:48:59,328 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2203 transitions. Word has length 159 [2022-04-15 11:48:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:59,328 INFO L478 AbstractCegarLoop]: Abstraction has 1486 states and 2203 transitions. [2022-04-15 11:48:59,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:59,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1486 states and 2203 transitions. [2022-04-15 11:49:04,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2203 edges. 2203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2203 transitions. [2022-04-15 11:49:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-15 11:49:04,317 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:04,317 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:49:04,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 11:49:04,318 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1252010738, now seen corresponding path program 1 times [2022-04-15 11:49:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:04,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [241127848] [2022-04-15 11:49:04,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:04,408 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:04,408 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:04,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1252010738, now seen corresponding path program 2 times [2022-04-15 11:49:04,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:04,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528119760] [2022-04-15 11:49:04,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:04,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {297157#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {297150#true} is VALID [2022-04-15 11:49:04,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {297150#true} assume true; {297150#true} is VALID [2022-04-15 11:49:04,610 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {297150#true} {297150#true} #755#return; {297150#true} is VALID [2022-04-15 11:49:04,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {297150#true} call ULTIMATE.init(); {297157#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:49:04,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {297157#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {297150#true} is VALID [2022-04-15 11:49:04,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {297150#true} assume true; {297150#true} is VALID [2022-04-15 11:49:04,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {297150#true} {297150#true} #755#return; {297150#true} is VALID [2022-04-15 11:49:04,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {297150#true} call #t~ret161 := main(); {297150#true} is VALID [2022-04-15 11:49:04,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {297150#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {297150#true} is VALID [2022-04-15 11:49:04,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {297150#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L272 TraceCheckUtils]: 7: Hoare triple {297150#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {297150#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {297150#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {297150#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {297150#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {297150#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {297150#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {297150#true} assume !false; {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {297150#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {297150#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {297150#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {297150#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {297150#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {297150#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {297150#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {297150#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 23: Hoare triple {297150#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {297150#true} assume 8464 == #t~mem55;havoc #t~mem55; {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {297150#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {297150#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {297150#true} is VALID [2022-04-15 11:49:04,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {297150#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {297150#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {297150#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {297150#true} ~skip~0 := 0; {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {297150#true} assume !false; {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {297150#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {297150#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {297150#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {297150#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {297150#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {297150#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 38: Hoare triple {297150#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {297150#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {297150#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {297150#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {297150#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {297150#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {297150#true} assume 8496 == #t~mem58;havoc #t~mem58; {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {297150#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {297150#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {297150#true} is VALID [2022-04-15 11:49:04,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {297150#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {297150#true} is VALID [2022-04-15 11:49:04,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {297150#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,620 INFO L290 TraceCheckUtils]: 53: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,622 INFO L290 TraceCheckUtils]: 59: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,623 INFO L290 TraceCheckUtils]: 61: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,623 INFO L290 TraceCheckUtils]: 62: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,624 INFO L290 TraceCheckUtils]: 64: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,625 INFO L290 TraceCheckUtils]: 67: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,625 INFO L290 TraceCheckUtils]: 68: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,626 INFO L290 TraceCheckUtils]: 69: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,626 INFO L290 TraceCheckUtils]: 70: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,626 INFO L290 TraceCheckUtils]: 71: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,627 INFO L290 TraceCheckUtils]: 72: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,627 INFO L290 TraceCheckUtils]: 73: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,628 INFO L290 TraceCheckUtils]: 75: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,628 INFO L290 TraceCheckUtils]: 76: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,629 INFO L290 TraceCheckUtils]: 77: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:04,629 INFO L290 TraceCheckUtils]: 78: Hoare triple {297155#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {297156#(not (= |ssl3_accept_#t~mem71| 8592))} is VALID [2022-04-15 11:49:04,629 INFO L290 TraceCheckUtils]: 79: Hoare triple {297156#(not (= |ssl3_accept_#t~mem71| 8592))} assume 8592 == #t~mem71;havoc #t~mem71; {297151#false} is VALID [2022-04-15 11:49:04,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {297151#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {297151#false} is VALID [2022-04-15 11:49:04,629 INFO L290 TraceCheckUtils]: 81: Hoare triple {297151#false} assume !(7 == ~blastFlag~0); {297151#false} is VALID [2022-04-15 11:49:04,629 INFO L290 TraceCheckUtils]: 82: Hoare triple {297151#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 83: Hoare triple {297151#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 84: Hoare triple {297151#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 85: Hoare triple {297151#false} ~skip~0 := 0; {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 86: Hoare triple {297151#false} assume !false; {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 87: Hoare triple {297151#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 88: Hoare triple {297151#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 89: Hoare triple {297151#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 90: Hoare triple {297151#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 91: Hoare triple {297151#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 92: Hoare triple {297151#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 93: Hoare triple {297151#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 94: Hoare triple {297151#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 95: Hoare triple {297151#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,630 INFO L290 TraceCheckUtils]: 96: Hoare triple {297151#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 97: Hoare triple {297151#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 98: Hoare triple {297151#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 99: Hoare triple {297151#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 100: Hoare triple {297151#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 101: Hoare triple {297151#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 102: Hoare triple {297151#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 103: Hoare triple {297151#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 104: Hoare triple {297151#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 105: Hoare triple {297151#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 106: Hoare triple {297151#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 107: Hoare triple {297151#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 108: Hoare triple {297151#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 109: Hoare triple {297151#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,631 INFO L290 TraceCheckUtils]: 110: Hoare triple {297151#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 111: Hoare triple {297151#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 112: Hoare triple {297151#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 113: Hoare triple {297151#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 114: Hoare triple {297151#false} assume 8608 == #t~mem73;havoc #t~mem73; {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 115: Hoare triple {297151#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 116: Hoare triple {297151#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 117: Hoare triple {297151#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 118: Hoare triple {297151#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 119: Hoare triple {297151#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 120: Hoare triple {297151#false} ~skip~0 := 0; {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 121: Hoare triple {297151#false} assume !false; {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 122: Hoare triple {297151#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 123: Hoare triple {297151#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,632 INFO L290 TraceCheckUtils]: 124: Hoare triple {297151#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 125: Hoare triple {297151#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 126: Hoare triple {297151#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 127: Hoare triple {297151#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 128: Hoare triple {297151#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 129: Hoare triple {297151#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 130: Hoare triple {297151#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 131: Hoare triple {297151#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 132: Hoare triple {297151#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 133: Hoare triple {297151#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 134: Hoare triple {297151#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 135: Hoare triple {297151#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 136: Hoare triple {297151#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 137: Hoare triple {297151#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,633 INFO L290 TraceCheckUtils]: 138: Hoare triple {297151#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 139: Hoare triple {297151#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 140: Hoare triple {297151#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 141: Hoare triple {297151#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 142: Hoare triple {297151#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 143: Hoare triple {297151#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 144: Hoare triple {297151#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 145: Hoare triple {297151#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 146: Hoare triple {297151#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 147: Hoare triple {297151#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 148: Hoare triple {297151#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 149: Hoare triple {297151#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 150: Hoare triple {297151#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 151: Hoare triple {297151#false} assume 8640 == #t~mem75;havoc #t~mem75; {297151#false} is VALID [2022-04-15 11:49:04,634 INFO L290 TraceCheckUtils]: 152: Hoare triple {297151#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {297151#false} is VALID [2022-04-15 11:49:04,635 INFO L290 TraceCheckUtils]: 153: Hoare triple {297151#false} assume !(9 == ~blastFlag~0); {297151#false} is VALID [2022-04-15 11:49:04,635 INFO L290 TraceCheckUtils]: 154: Hoare triple {297151#false} assume !(12 == ~blastFlag~0); {297151#false} is VALID [2022-04-15 11:49:04,635 INFO L290 TraceCheckUtils]: 155: Hoare triple {297151#false} assume !(15 == ~blastFlag~0); {297151#false} is VALID [2022-04-15 11:49:04,635 INFO L290 TraceCheckUtils]: 156: Hoare triple {297151#false} assume !(18 == ~blastFlag~0); {297151#false} is VALID [2022-04-15 11:49:04,635 INFO L290 TraceCheckUtils]: 157: Hoare triple {297151#false} assume 21 == ~blastFlag~0; {297151#false} is VALID [2022-04-15 11:49:04,635 INFO L290 TraceCheckUtils]: 158: Hoare triple {297151#false} assume !false; {297151#false} is VALID [2022-04-15 11:49:04,635 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:49:04,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:04,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528119760] [2022-04-15 11:49:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528119760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:04,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:04,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [241127848] [2022-04-15 11:49:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [241127848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:04,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:04,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535437646] [2022-04-15 11:49:04,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:04,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-15 11:49:04,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:04,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:04,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:04,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:04,723 INFO L87 Difference]: Start difference. First operand 1486 states and 2203 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:08,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:14,671 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-15 11:49:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:18,243 INFO L93 Difference]: Finished difference Result 3281 states and 4841 transitions. [2022-04-15 11:49:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 159 [2022-04-15 11:49:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2022-04-15 11:49:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2022-04-15 11:49:18,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 637 transitions. [2022-04-15 11:49:18,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 637 edges. 637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:18,925 INFO L225 Difference]: With dead ends: 3281 [2022-04-15 11:49:18,926 INFO L226 Difference]: Without dead ends: 1821 [2022-04-15 11:49:18,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:18,928 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 128 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:18,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 438 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 11:49:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-04-15 11:49:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1591. [2022-04-15 11:49:19,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:19,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1821 states. Second operand has 1591 states, 1586 states have (on average 1.4791929382093316) internal successors, (2346), 1586 states have internal predecessors, (2346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,163 INFO L74 IsIncluded]: Start isIncluded. First operand 1821 states. Second operand has 1591 states, 1586 states have (on average 1.4791929382093316) internal successors, (2346), 1586 states have internal predecessors, (2346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,164 INFO L87 Difference]: Start difference. First operand 1821 states. Second operand has 1591 states, 1586 states have (on average 1.4791929382093316) internal successors, (2346), 1586 states have internal predecessors, (2346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:19,255 INFO L93 Difference]: Finished difference Result 1821 states and 2657 transitions. [2022-04-15 11:49:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2657 transitions. [2022-04-15 11:49:19,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:19,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:19,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 1591 states, 1586 states have (on average 1.4791929382093316) internal successors, (2346), 1586 states have internal predecessors, (2346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1821 states. [2022-04-15 11:49:19,259 INFO L87 Difference]: Start difference. First operand has 1591 states, 1586 states have (on average 1.4791929382093316) internal successors, (2346), 1586 states have internal predecessors, (2346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1821 states. [2022-04-15 11:49:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:19,346 INFO L93 Difference]: Finished difference Result 1821 states and 2657 transitions. [2022-04-15 11:49:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2657 transitions. [2022-04-15 11:49:19,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:19,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:19,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:19,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1586 states have (on average 1.4791929382093316) internal successors, (2346), 1586 states have internal predecessors, (2346), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2350 transitions. [2022-04-15 11:49:19,472 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2350 transitions. Word has length 159 [2022-04-15 11:49:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:19,472 INFO L478 AbstractCegarLoop]: Abstraction has 1591 states and 2350 transitions. [2022-04-15 11:49:19,472 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:19,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1591 states and 2350 transitions. [2022-04-15 11:49:23,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2350 edges. 2350 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2350 transitions. [2022-04-15 11:49:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-15 11:49:23,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:23,879 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:49:23,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 11:49:23,879 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:23,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:23,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1175319176, now seen corresponding path program 1 times [2022-04-15 11:49:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:23,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1873202749] [2022-04-15 11:49:23,973 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:23,973 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:23,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1175319176, now seen corresponding path program 2 times [2022-04-15 11:49:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:23,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935859092] [2022-04-15 11:49:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:24,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:24,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {310555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {310548#true} is VALID [2022-04-15 11:49:24,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {310548#true} assume true; {310548#true} is VALID [2022-04-15 11:49:24,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {310548#true} {310548#true} #755#return; {310548#true} is VALID [2022-04-15 11:49:24,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {310548#true} call ULTIMATE.init(); {310555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:49:24,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {310555#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {310548#true} is VALID [2022-04-15 11:49:24,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {310548#true} assume true; {310548#true} is VALID [2022-04-15 11:49:24,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {310548#true} {310548#true} #755#return; {310548#true} is VALID [2022-04-15 11:49:24,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {310548#true} call #t~ret161 := main(); {310548#true} is VALID [2022-04-15 11:49:24,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {310548#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {310548#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L272 TraceCheckUtils]: 7: Hoare triple {310548#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {310548#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {310548#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {310548#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {310548#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {310548#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {310548#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {310548#true} assume !false; {310548#true} is VALID [2022-04-15 11:49:24,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {310548#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {310548#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {310548#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {310548#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {310548#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {310548#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {310548#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {310548#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {310548#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {310548#true} assume 8464 == #t~mem55;havoc #t~mem55; {310548#true} is VALID [2022-04-15 11:49:24,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {310548#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {310548#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {310548#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {310548#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {310548#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {310548#true} ~skip~0 := 0; {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {310548#true} assume !false; {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {310548#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {310548#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {310548#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {310548#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {310548#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {310548#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {310548#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {310548#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {310548#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {310548#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 42: Hoare triple {310548#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {310548#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 44: Hoare triple {310548#true} assume 8496 == #t~mem58;havoc #t~mem58; {310548#true} is VALID [2022-04-15 11:49:24,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {310548#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {310548#true} is VALID [2022-04-15 11:49:24,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {310548#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {310548#true} is VALID [2022-04-15 11:49:24,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {310548#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {310548#true} is VALID [2022-04-15 11:49:24,126 INFO L290 TraceCheckUtils]: 48: Hoare triple {310548#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,128 INFO L290 TraceCheckUtils]: 51: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,128 INFO L290 TraceCheckUtils]: 52: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,128 INFO L290 TraceCheckUtils]: 53: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,129 INFO L290 TraceCheckUtils]: 54: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,131 INFO L290 TraceCheckUtils]: 59: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,132 INFO L290 TraceCheckUtils]: 60: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,132 INFO L290 TraceCheckUtils]: 61: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,133 INFO L290 TraceCheckUtils]: 62: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,133 INFO L290 TraceCheckUtils]: 63: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,134 INFO L290 TraceCheckUtils]: 66: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,135 INFO L290 TraceCheckUtils]: 67: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,135 INFO L290 TraceCheckUtils]: 68: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,136 INFO L290 TraceCheckUtils]: 69: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,136 INFO L290 TraceCheckUtils]: 70: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 71: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,137 INFO L290 TraceCheckUtils]: 73: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 74: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,138 INFO L290 TraceCheckUtils]: 75: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:24,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {310553#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {310554#(= |ssl3_accept_#t~mem72| 8656)} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {310554#(= |ssl3_accept_#t~mem72| 8656)} assume 8593 == #t~mem72;havoc #t~mem72; {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 81: Hoare triple {310549#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 82: Hoare triple {310549#false} assume !(7 == ~blastFlag~0); {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 83: Hoare triple {310549#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {310549#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {310549#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {310549#false} ~skip~0 := 0; {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {310549#false} assume !false; {310549#false} is VALID [2022-04-15 11:49:24,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {310549#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 89: Hoare triple {310549#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 90: Hoare triple {310549#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {310549#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 92: Hoare triple {310549#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 93: Hoare triple {310549#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 94: Hoare triple {310549#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 95: Hoare triple {310549#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 96: Hoare triple {310549#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 97: Hoare triple {310549#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 98: Hoare triple {310549#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,142 INFO L290 TraceCheckUtils]: 99: Hoare triple {310549#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 100: Hoare triple {310549#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 101: Hoare triple {310549#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 102: Hoare triple {310549#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 103: Hoare triple {310549#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 104: Hoare triple {310549#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 105: Hoare triple {310549#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 106: Hoare triple {310549#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 107: Hoare triple {310549#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 108: Hoare triple {310549#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,143 INFO L290 TraceCheckUtils]: 109: Hoare triple {310549#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 110: Hoare triple {310549#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 111: Hoare triple {310549#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 112: Hoare triple {310549#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 113: Hoare triple {310549#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 114: Hoare triple {310549#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 115: Hoare triple {310549#false} assume 8608 == #t~mem73;havoc #t~mem73; {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 116: Hoare triple {310549#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 117: Hoare triple {310549#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 118: Hoare triple {310549#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 119: Hoare triple {310549#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,144 INFO L290 TraceCheckUtils]: 120: Hoare triple {310549#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 121: Hoare triple {310549#false} ~skip~0 := 0; {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 122: Hoare triple {310549#false} assume !false; {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 123: Hoare triple {310549#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 124: Hoare triple {310549#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 125: Hoare triple {310549#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 126: Hoare triple {310549#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 127: Hoare triple {310549#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 128: Hoare triple {310549#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 129: Hoare triple {310549#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,145 INFO L290 TraceCheckUtils]: 130: Hoare triple {310549#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 131: Hoare triple {310549#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 132: Hoare triple {310549#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 133: Hoare triple {310549#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 134: Hoare triple {310549#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 135: Hoare triple {310549#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 136: Hoare triple {310549#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 137: Hoare triple {310549#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 138: Hoare triple {310549#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 139: Hoare triple {310549#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 140: Hoare triple {310549#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,146 INFO L290 TraceCheckUtils]: 141: Hoare triple {310549#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 142: Hoare triple {310549#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 143: Hoare triple {310549#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 144: Hoare triple {310549#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 145: Hoare triple {310549#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 146: Hoare triple {310549#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 147: Hoare triple {310549#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 148: Hoare triple {310549#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 149: Hoare triple {310549#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 150: Hoare triple {310549#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,147 INFO L290 TraceCheckUtils]: 151: Hoare triple {310549#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 152: Hoare triple {310549#false} assume 8640 == #t~mem75;havoc #t~mem75; {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 153: Hoare triple {310549#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 154: Hoare triple {310549#false} assume !(9 == ~blastFlag~0); {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 155: Hoare triple {310549#false} assume !(12 == ~blastFlag~0); {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 156: Hoare triple {310549#false} assume !(15 == ~blastFlag~0); {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 157: Hoare triple {310549#false} assume !(18 == ~blastFlag~0); {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 158: Hoare triple {310549#false} assume 21 == ~blastFlag~0; {310549#false} is VALID [2022-04-15 11:49:24,148 INFO L290 TraceCheckUtils]: 159: Hoare triple {310549#false} assume !false; {310549#false} is VALID [2022-04-15 11:49:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:49:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:24,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935859092] [2022-04-15 11:49:24,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935859092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:24,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:24,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:24,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1873202749] [2022-04-15 11:49:24,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1873202749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:24,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:24,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467442662] [2022-04-15 11:49:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:24,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 160 [2022-04-15 11:49:24,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:24,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:24,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:24,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:24,245 INFO L87 Difference]: Start difference. First operand 1591 states and 2350 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:27,594 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-15 11:49:30,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:32,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:34,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:37,529 INFO L93 Difference]: Finished difference Result 3218 states and 4748 transitions. [2022-04-15 11:49:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:37,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 160 [2022-04-15 11:49:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:37,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-04-15 11:49:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-04-15 11:49:37,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 551 transitions. [2022-04-15 11:49:37,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 551 edges. 551 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:38,000 INFO L225 Difference]: With dead ends: 3218 [2022-04-15 11:49:38,000 INFO L226 Difference]: Without dead ends: 1653 [2022-04-15 11:49:38,002 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:38,002 INFO L913 BasicCegarLoop]: 272 mSDtfsCounter, 47 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:38,002 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 681 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:49:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-04-15 11:49:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1591. [2022-04-15 11:49:38,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:38,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1653 states. Second operand has 1591 states, 1586 states have (on average 1.4773013871374527) internal successors, (2343), 1586 states have internal predecessors, (2343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,178 INFO L74 IsIncluded]: Start isIncluded. First operand 1653 states. Second operand has 1591 states, 1586 states have (on average 1.4773013871374527) internal successors, (2343), 1586 states have internal predecessors, (2343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,179 INFO L87 Difference]: Start difference. First operand 1653 states. Second operand has 1591 states, 1586 states have (on average 1.4773013871374527) internal successors, (2343), 1586 states have internal predecessors, (2343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:38,254 INFO L93 Difference]: Finished difference Result 1653 states and 2426 transitions. [2022-04-15 11:49:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2426 transitions. [2022-04-15 11:49:38,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:38,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:38,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 1591 states, 1586 states have (on average 1.4773013871374527) internal successors, (2343), 1586 states have internal predecessors, (2343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1653 states. [2022-04-15 11:49:38,257 INFO L87 Difference]: Start difference. First operand has 1591 states, 1586 states have (on average 1.4773013871374527) internal successors, (2343), 1586 states have internal predecessors, (2343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1653 states. [2022-04-15 11:49:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:38,327 INFO L93 Difference]: Finished difference Result 1653 states and 2426 transitions. [2022-04-15 11:49:38,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2426 transitions. [2022-04-15 11:49:38,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:38,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:38,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:38,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1586 states have (on average 1.4773013871374527) internal successors, (2343), 1586 states have internal predecessors, (2343), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2347 transitions. [2022-04-15 11:49:38,449 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2347 transitions. Word has length 160 [2022-04-15 11:49:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:38,449 INFO L478 AbstractCegarLoop]: Abstraction has 1591 states and 2347 transitions. [2022-04-15 11:49:38,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1591 states and 2347 transitions. [2022-04-15 11:49:42,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2347 edges. 2347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2347 transitions. [2022-04-15 11:49:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-15 11:49:42,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:42,757 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-15 11:49:42,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 11:49:42,757 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash -703962826, now seen corresponding path program 1 times [2022-04-15 11:49:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:42,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623916436] [2022-04-15 11:49:42,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:42,855 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:42,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash -703962826, now seen corresponding path program 2 times [2022-04-15 11:49:42,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:42,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76327501] [2022-04-15 11:49:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:43,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {323491#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {323484#true} is VALID [2022-04-15 11:49:43,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {323484#true} assume true; {323484#true} is VALID [2022-04-15 11:49:43,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {323484#true} {323484#true} #755#return; {323484#true} is VALID [2022-04-15 11:49:43,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {323484#true} call ULTIMATE.init(); {323491#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:49:43,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {323491#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {323484#true} assume true; {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {323484#true} {323484#true} #755#return; {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {323484#true} call #t~ret161 := main(); {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {323484#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {323484#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L272 TraceCheckUtils]: 7: Hoare triple {323484#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {323484#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {323484#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {323484#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {323484#true} is VALID [2022-04-15 11:49:43,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {323484#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {323484#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {323484#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {323484#true} assume !false; {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {323484#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {323484#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {323484#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {323484#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {323484#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {323484#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {323484#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {323484#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {323484#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {323484#true} assume 8464 == #t~mem55;havoc #t~mem55; {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {323484#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {323484#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {323484#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {323484#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {323484#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {323484#true} ~skip~0 := 0; {323484#true} is VALID [2022-04-15 11:49:43,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {323484#true} assume !false; {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {323484#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 33: Hoare triple {323484#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {323484#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {323484#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {323484#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {323484#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 38: Hoare triple {323484#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {323484#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {323484#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,033 INFO L290 TraceCheckUtils]: 41: Hoare triple {323484#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {323484#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,034 INFO L290 TraceCheckUtils]: 43: Hoare triple {323484#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {323484#true} assume 8496 == #t~mem58;havoc #t~mem58; {323484#true} is VALID [2022-04-15 11:49:43,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {323484#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {323484#true} is VALID [2022-04-15 11:49:43,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {323484#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {323484#true} is VALID [2022-04-15 11:49:43,034 INFO L290 TraceCheckUtils]: 47: Hoare triple {323484#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {323484#true} is VALID [2022-04-15 11:49:43,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {323484#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,037 INFO L290 TraceCheckUtils]: 51: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,040 INFO L290 TraceCheckUtils]: 59: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,041 INFO L290 TraceCheckUtils]: 61: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,042 INFO L290 TraceCheckUtils]: 63: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:49:43,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {323489#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {323490#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-15 11:49:43,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {323490#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {323485#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {323485#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {323485#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 72: Hoare triple {323485#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 73: Hoare triple {323485#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {323485#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {323485#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {323485#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {323485#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {323485#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {323485#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {323485#false} assume 8593 == #t~mem72;havoc #t~mem72; {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {323485#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {323485#false} assume !(7 == ~blastFlag~0); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 83: Hoare triple {323485#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,045 INFO L290 TraceCheckUtils]: 84: Hoare triple {323485#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {323485#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 86: Hoare triple {323485#false} ~skip~0 := 0; {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 87: Hoare triple {323485#false} assume !false; {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 88: Hoare triple {323485#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 89: Hoare triple {323485#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 90: Hoare triple {323485#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 91: Hoare triple {323485#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 92: Hoare triple {323485#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 93: Hoare triple {323485#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 94: Hoare triple {323485#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 95: Hoare triple {323485#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {323485#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 97: Hoare triple {323485#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {323485#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,046 INFO L290 TraceCheckUtils]: 99: Hoare triple {323485#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 100: Hoare triple {323485#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 101: Hoare triple {323485#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 102: Hoare triple {323485#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 103: Hoare triple {323485#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 104: Hoare triple {323485#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 105: Hoare triple {323485#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 106: Hoare triple {323485#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 107: Hoare triple {323485#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 108: Hoare triple {323485#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 109: Hoare triple {323485#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 110: Hoare triple {323485#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 111: Hoare triple {323485#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 112: Hoare triple {323485#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,047 INFO L290 TraceCheckUtils]: 113: Hoare triple {323485#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {323485#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 115: Hoare triple {323485#false} assume 8608 == #t~mem73;havoc #t~mem73; {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 116: Hoare triple {323485#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 117: Hoare triple {323485#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 118: Hoare triple {323485#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 119: Hoare triple {323485#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 120: Hoare triple {323485#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 121: Hoare triple {323485#false} ~skip~0 := 0; {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 122: Hoare triple {323485#false} assume !false; {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 123: Hoare triple {323485#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 124: Hoare triple {323485#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 125: Hoare triple {323485#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 126: Hoare triple {323485#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 127: Hoare triple {323485#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,048 INFO L290 TraceCheckUtils]: 128: Hoare triple {323485#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 129: Hoare triple {323485#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 130: Hoare triple {323485#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 131: Hoare triple {323485#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 132: Hoare triple {323485#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 133: Hoare triple {323485#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 134: Hoare triple {323485#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 135: Hoare triple {323485#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 136: Hoare triple {323485#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 137: Hoare triple {323485#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 138: Hoare triple {323485#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 139: Hoare triple {323485#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 140: Hoare triple {323485#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 141: Hoare triple {323485#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,049 INFO L290 TraceCheckUtils]: 142: Hoare triple {323485#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 143: Hoare triple {323485#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 144: Hoare triple {323485#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 145: Hoare triple {323485#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 146: Hoare triple {323485#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 147: Hoare triple {323485#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 148: Hoare triple {323485#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 149: Hoare triple {323485#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 150: Hoare triple {323485#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 151: Hoare triple {323485#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 152: Hoare triple {323485#false} assume 8640 == #t~mem75;havoc #t~mem75; {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 153: Hoare triple {323485#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 154: Hoare triple {323485#false} assume !(9 == ~blastFlag~0); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 155: Hoare triple {323485#false} assume !(12 == ~blastFlag~0); {323485#false} is VALID [2022-04-15 11:49:43,050 INFO L290 TraceCheckUtils]: 156: Hoare triple {323485#false} assume !(15 == ~blastFlag~0); {323485#false} is VALID [2022-04-15 11:49:43,051 INFO L290 TraceCheckUtils]: 157: Hoare triple {323485#false} assume !(18 == ~blastFlag~0); {323485#false} is VALID [2022-04-15 11:49:43,051 INFO L290 TraceCheckUtils]: 158: Hoare triple {323485#false} assume 21 == ~blastFlag~0; {323485#false} is VALID [2022-04-15 11:49:43,051 INFO L290 TraceCheckUtils]: 159: Hoare triple {323485#false} assume !false; {323485#false} is VALID [2022-04-15 11:49:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-15 11:49:43,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:43,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76327501] [2022-04-15 11:49:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76327501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:43,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:43,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:43,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:43,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623916436] [2022-04-15 11:49:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623916436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:43,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:43,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:43,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144228572] [2022-04-15 11:49:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:43,053 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 160 [2022-04-15 11:49:43,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:43,053 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-15 11:49:43,123 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-15 11:49:43,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:43,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:43,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:43,124 INFO L87 Difference]: Start difference. First operand 1591 states and 2347 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-15 11:49:46,724 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-15 11:49:48,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:50,302 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-15 11:49:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:52,923 INFO L93 Difference]: Finished difference Result 3263 states and 4815 transitions. [2022-04-15 11:49:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:52,923 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 160 [2022-04-15 11:49:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:52,923 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-15 11:49:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-15 11:49:52,926 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-15 11:49:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-15 11:49:52,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 514 transitions. [2022-04-15 11:49:53,249 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-15 11:49:53,428 INFO L225 Difference]: With dead ends: 3263 [2022-04-15 11:49:53,428 INFO L226 Difference]: Without dead ends: 1698 [2022-04-15 11:49:53,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:53,430 INFO L913 BasicCegarLoop]: 262 mSDtfsCounter, 28 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:53,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 661 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 454 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-04-15 11:49:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2022-04-15 11:49:53,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1663. [2022-04-15 11:49:53,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:53,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1698 states. Second operand has 1663 states, 1658 states have (on average 1.476477683956574) internal successors, (2448), 1658 states have internal predecessors, (2448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,654 INFO L74 IsIncluded]: Start isIncluded. First operand 1698 states. Second operand has 1663 states, 1658 states have (on average 1.476477683956574) internal successors, (2448), 1658 states have internal predecessors, (2448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,655 INFO L87 Difference]: Start difference. First operand 1698 states. Second operand has 1663 states, 1658 states have (on average 1.476477683956574) internal successors, (2448), 1658 states have internal predecessors, (2448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:53,732 INFO L93 Difference]: Finished difference Result 1698 states and 2496 transitions. [2022-04-15 11:49:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2496 transitions. [2022-04-15 11:49:53,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:53,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:53,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 1663 states, 1658 states have (on average 1.476477683956574) internal successors, (2448), 1658 states have internal predecessors, (2448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1698 states. [2022-04-15 11:49:53,735 INFO L87 Difference]: Start difference. First operand has 1663 states, 1658 states have (on average 1.476477683956574) internal successors, (2448), 1658 states have internal predecessors, (2448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1698 states. [2022-04-15 11:49:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:53,816 INFO L93 Difference]: Finished difference Result 1698 states and 2496 transitions. [2022-04-15 11:49:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2496 transitions. [2022-04-15 11:49:53,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:53,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:53,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:53,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1658 states have (on average 1.476477683956574) internal successors, (2448), 1658 states have internal predecessors, (2448), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2452 transitions. [2022-04-15 11:49:53,932 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2452 transitions. Word has length 160 [2022-04-15 11:49:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:53,933 INFO L478 AbstractCegarLoop]: Abstraction has 1663 states and 2452 transitions. [2022-04-15 11:49:53,933 INFO L479 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-15 11:49:53,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1663 states and 2452 transitions. [2022-04-15 11:49:59,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2452 edges. 2452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2452 transitions. [2022-04-15 11:49:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-15 11:49:59,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:59,316 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:59,316 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 11:49:59,316 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:59,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1782170288, now seen corresponding path program 1 times [2022-04-15 11:49:59,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:59,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1706759959] [2022-04-15 11:49:59,425 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:59,426 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:59,426 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:59,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1782170288, now seen corresponding path program 2 times [2022-04-15 11:49:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:59,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331448630] [2022-04-15 11:49:59,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:59,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:59,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {336751#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {336744#true} is VALID [2022-04-15 11:49:59,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {336744#true} assume true; {336744#true} is VALID [2022-04-15 11:49:59,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {336744#true} {336744#true} #755#return; {336744#true} is VALID [2022-04-15 11:49:59,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {336744#true} call ULTIMATE.init(); {336751#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:49:59,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {336751#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {336744#true} is VALID [2022-04-15 11:49:59,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {336744#true} assume true; {336744#true} is VALID [2022-04-15 11:49:59,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {336744#true} {336744#true} #755#return; {336744#true} is VALID [2022-04-15 11:49:59,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {336744#true} call #t~ret161 := main(); {336744#true} is VALID [2022-04-15 11:49:59,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {336744#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {336744#true} is VALID [2022-04-15 11:49:59,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {336744#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,571 INFO L272 TraceCheckUtils]: 7: Hoare triple {336744#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {336744#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {336744#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {336744#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {336744#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {336744#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {336744#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {336744#true} assume !false; {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {336744#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {336744#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {336744#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {336744#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {336744#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {336744#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {336744#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {336744#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {336744#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {336744#true} assume 8464 == #t~mem55;havoc #t~mem55; {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {336744#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {336744#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {336744#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {336744#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {336744#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {336744#true} ~skip~0 := 0; {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {336744#true} assume !false; {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {336744#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {336744#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {336744#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {336744#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {336744#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {336744#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {336744#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {336744#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {336744#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {336744#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {336744#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {336744#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {336744#true} assume 8496 == #t~mem58;havoc #t~mem58; {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {336744#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 46: Hoare triple {336744#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {336744#true} is VALID [2022-04-15 11:49:59,574 INFO L290 TraceCheckUtils]: 47: Hoare triple {336744#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {336744#true} is VALID [2022-04-15 11:49:59,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {336744#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,578 INFO L290 TraceCheckUtils]: 54: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,578 INFO L290 TraceCheckUtils]: 55: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,579 INFO L290 TraceCheckUtils]: 56: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,579 INFO L290 TraceCheckUtils]: 57: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:59,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {336749#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {336750#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-15 11:49:59,582 INFO L290 TraceCheckUtils]: 62: Hoare triple {336750#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {336745#false} is VALID [2022-04-15 11:49:59,582 INFO L290 TraceCheckUtils]: 63: Hoare triple {336745#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,582 INFO L290 TraceCheckUtils]: 64: Hoare triple {336745#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,582 INFO L290 TraceCheckUtils]: 65: Hoare triple {336745#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {336745#false} is VALID [2022-04-15 11:49:59,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {336745#false} ~skip~0 := 0; {336745#false} is VALID [2022-04-15 11:49:59,582 INFO L290 TraceCheckUtils]: 67: Hoare triple {336745#false} assume !false; {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 68: Hoare triple {336745#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 69: Hoare triple {336745#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 70: Hoare triple {336745#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 71: Hoare triple {336745#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 72: Hoare triple {336745#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 73: Hoare triple {336745#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 74: Hoare triple {336745#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {336745#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {336745#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 77: Hoare triple {336745#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {336745#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 79: Hoare triple {336745#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {336745#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {336745#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 82: Hoare triple {336745#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 83: Hoare triple {336745#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,584 INFO L290 TraceCheckUtils]: 84: Hoare triple {336745#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 85: Hoare triple {336745#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 86: Hoare triple {336745#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 87: Hoare triple {336745#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 88: Hoare triple {336745#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 89: Hoare triple {336745#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {336745#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 91: Hoare triple {336745#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 92: Hoare triple {336745#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,585 INFO L290 TraceCheckUtils]: 93: Hoare triple {336745#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 94: Hoare triple {336745#false} assume 8593 == #t~mem72;havoc #t~mem72; {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 95: Hoare triple {336745#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 96: Hoare triple {336745#false} assume !(7 == ~blastFlag~0); {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 97: Hoare triple {336745#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 98: Hoare triple {336745#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 99: Hoare triple {336745#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 100: Hoare triple {336745#false} ~skip~0 := 0; {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 101: Hoare triple {336745#false} assume !false; {336745#false} is VALID [2022-04-15 11:49:59,586 INFO L290 TraceCheckUtils]: 102: Hoare triple {336745#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 103: Hoare triple {336745#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 104: Hoare triple {336745#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 105: Hoare triple {336745#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 106: Hoare triple {336745#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 107: Hoare triple {336745#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 108: Hoare triple {336745#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 109: Hoare triple {336745#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 110: Hoare triple {336745#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,587 INFO L290 TraceCheckUtils]: 111: Hoare triple {336745#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 112: Hoare triple {336745#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 113: Hoare triple {336745#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 114: Hoare triple {336745#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 115: Hoare triple {336745#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 116: Hoare triple {336745#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 117: Hoare triple {336745#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 118: Hoare triple {336745#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 119: Hoare triple {336745#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 120: Hoare triple {336745#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,588 INFO L290 TraceCheckUtils]: 121: Hoare triple {336745#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 122: Hoare triple {336745#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 123: Hoare triple {336745#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 124: Hoare triple {336745#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 125: Hoare triple {336745#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 126: Hoare triple {336745#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 127: Hoare triple {336745#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 128: Hoare triple {336745#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 129: Hoare triple {336745#false} assume 8608 == #t~mem73;havoc #t~mem73; {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 130: Hoare triple {336745#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {336745#false} is VALID [2022-04-15 11:49:59,589 INFO L290 TraceCheckUtils]: 131: Hoare triple {336745#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 132: Hoare triple {336745#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 133: Hoare triple {336745#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 134: Hoare triple {336745#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 135: Hoare triple {336745#false} ~skip~0 := 0; {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 136: Hoare triple {336745#false} assume !false; {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 137: Hoare triple {336745#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 138: Hoare triple {336745#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 139: Hoare triple {336745#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 140: Hoare triple {336745#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,590 INFO L290 TraceCheckUtils]: 141: Hoare triple {336745#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 142: Hoare triple {336745#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 143: Hoare triple {336745#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 144: Hoare triple {336745#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 145: Hoare triple {336745#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 146: Hoare triple {336745#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 147: Hoare triple {336745#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 148: Hoare triple {336745#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 149: Hoare triple {336745#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 150: Hoare triple {336745#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,591 INFO L290 TraceCheckUtils]: 151: Hoare triple {336745#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 152: Hoare triple {336745#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 153: Hoare triple {336745#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 154: Hoare triple {336745#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 155: Hoare triple {336745#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 156: Hoare triple {336745#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 157: Hoare triple {336745#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 158: Hoare triple {336745#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 159: Hoare triple {336745#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 160: Hoare triple {336745#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,592 INFO L290 TraceCheckUtils]: 161: Hoare triple {336745#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 162: Hoare triple {336745#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 163: Hoare triple {336745#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 164: Hoare triple {336745#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 165: Hoare triple {336745#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 166: Hoare triple {336745#false} assume 8640 == #t~mem75;havoc #t~mem75; {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 167: Hoare triple {336745#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 168: Hoare triple {336745#false} assume !(9 == ~blastFlag~0); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 169: Hoare triple {336745#false} assume !(12 == ~blastFlag~0); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 170: Hoare triple {336745#false} assume !(15 == ~blastFlag~0); {336745#false} is VALID [2022-04-15 11:49:59,593 INFO L290 TraceCheckUtils]: 171: Hoare triple {336745#false} assume !(18 == ~blastFlag~0); {336745#false} is VALID [2022-04-15 11:49:59,594 INFO L290 TraceCheckUtils]: 172: Hoare triple {336745#false} assume 21 == ~blastFlag~0; {336745#false} is VALID [2022-04-15 11:49:59,594 INFO L290 TraceCheckUtils]: 173: Hoare triple {336745#false} assume !false; {336745#false} is VALID [2022-04-15 11:49:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-15 11:49:59,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:59,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331448630] [2022-04-15 11:49:59,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331448630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:59,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:59,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:59,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:59,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1706759959] [2022-04-15 11:49:59,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1706759959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:59,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:59,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:59,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491237128] [2022-04-15 11:49:59,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-15 11:49:59,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:59,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:59,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:59,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:59,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:59,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:59,683 INFO L87 Difference]: Start difference. First operand 1663 states and 2452 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:03,006 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-15 11:50:04,651 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-15 11:50:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:09,508 INFO L93 Difference]: Finished difference Result 2309 states and 3416 transitions. [2022-04-15 11:50:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:09,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 174 [2022-04-15 11:50:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2022-04-15 11:50:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2022-04-15 11:50:09,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 636 transitions. [2022-04-15 11:50:09,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:09,943 INFO L225 Difference]: With dead ends: 2309 [2022-04-15 11:50:09,943 INFO L226 Difference]: Without dead ends: 672 [2022-04-15 11:50:09,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:09,945 INFO L913 BasicCegarLoop]: 154 mSDtfsCounter, 145 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:09,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 440 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:50:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-04-15 11:50:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 600. [2022-04-15 11:50:09,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:09,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 672 states. Second operand has 600 states, 595 states have (on average 1.4655462184873949) internal successors, (872), 595 states have internal predecessors, (872), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,990 INFO L74 IsIncluded]: Start isIncluded. First operand 672 states. Second operand has 600 states, 595 states have (on average 1.4655462184873949) internal successors, (872), 595 states have internal predecessors, (872), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,990 INFO L87 Difference]: Start difference. First operand 672 states. Second operand has 600 states, 595 states have (on average 1.4655462184873949) internal successors, (872), 595 states have internal predecessors, (872), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:10,003 INFO L93 Difference]: Finished difference Result 672 states and 983 transitions. [2022-04-15 11:50:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 983 transitions. [2022-04-15 11:50:10,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:10,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:10,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 600 states, 595 states have (on average 1.4655462184873949) internal successors, (872), 595 states have internal predecessors, (872), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 672 states. [2022-04-15 11:50:10,004 INFO L87 Difference]: Start difference. First operand has 600 states, 595 states have (on average 1.4655462184873949) internal successors, (872), 595 states have internal predecessors, (872), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 672 states. [2022-04-15 11:50:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:10,017 INFO L93 Difference]: Finished difference Result 672 states and 983 transitions. [2022-04-15 11:50:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 983 transitions. [2022-04-15 11:50:10,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:10,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:10,017 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:10,017 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 595 states have (on average 1.4655462184873949) internal successors, (872), 595 states have internal predecessors, (872), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 876 transitions. [2022-04-15 11:50:10,044 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 876 transitions. Word has length 174 [2022-04-15 11:50:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:10,045 INFO L478 AbstractCegarLoop]: Abstraction has 600 states and 876 transitions. [2022-04-15 11:50:10,045 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:10,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 600 states and 876 transitions. [2022-04-15 11:50:11,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 876 edges. 876 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 876 transitions. [2022-04-15 11:50:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 11:50:11,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:11,018 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:11,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 11:50:11,019 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:11,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 987162018, now seen corresponding path program 1 times [2022-04-15 11:50:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:11,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1055186591] [2022-04-15 11:50:11,134 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:11,134 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:11,134 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:11,134 INFO L85 PathProgramCache]: Analyzing trace with hash 987162018, now seen corresponding path program 2 times [2022-04-15 11:50:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:11,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795073359] [2022-04-15 11:50:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:11,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:11,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {343924#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {343918#true} is VALID [2022-04-15 11:50:11,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {343918#true} assume true; {343918#true} is VALID [2022-04-15 11:50:11,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343918#true} {343918#true} #755#return; {343918#true} is VALID [2022-04-15 11:50:11,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {343918#true} call ULTIMATE.init(); {343924#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:11,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {343924#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {343918#true} is VALID [2022-04-15 11:50:11,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {343918#true} assume true; {343918#true} is VALID [2022-04-15 11:50:11,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343918#true} {343918#true} #755#return; {343918#true} is VALID [2022-04-15 11:50:11,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {343918#true} call #t~ret161 := main(); {343918#true} is VALID [2022-04-15 11:50:11,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {343918#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {343918#true} is VALID [2022-04-15 11:50:11,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {343918#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,276 INFO L272 TraceCheckUtils]: 7: Hoare triple {343918#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {343918#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {343918#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {343918#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {343918#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {343918#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {343918#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {343918#true} assume !false; {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {343918#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {343918#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {343918#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {343918#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {343918#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {343918#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {343918#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {343918#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {343918#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {343918#true} assume 8464 == #t~mem55;havoc #t~mem55; {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {343918#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {343918#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {343918#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {343918#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {343918#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {343918#true} ~skip~0 := 0; {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {343918#true} assume !false; {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {343918#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {343918#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {343918#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {343918#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 36: Hoare triple {343918#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {343918#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {343918#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {343918#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {343918#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {343918#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {343918#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {343918#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {343918#true} assume 8496 == #t~mem58;havoc #t~mem58; {343918#true} is VALID [2022-04-15 11:50:11,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {343918#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {343918#true} is VALID [2022-04-15 11:50:11,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {343918#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,281 INFO L290 TraceCheckUtils]: 47: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,284 INFO L290 TraceCheckUtils]: 55: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,285 INFO L290 TraceCheckUtils]: 58: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,285 INFO L290 TraceCheckUtils]: 59: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,285 INFO L290 TraceCheckUtils]: 60: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,286 INFO L290 TraceCheckUtils]: 61: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,287 INFO L290 TraceCheckUtils]: 64: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,287 INFO L290 TraceCheckUtils]: 65: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,288 INFO L290 TraceCheckUtils]: 67: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,288 INFO L290 TraceCheckUtils]: 68: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,288 INFO L290 TraceCheckUtils]: 69: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,289 INFO L290 TraceCheckUtils]: 71: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,289 INFO L290 TraceCheckUtils]: 73: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,290 INFO L290 TraceCheckUtils]: 75: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,290 INFO L290 TraceCheckUtils]: 76: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,290 INFO L290 TraceCheckUtils]: 77: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,291 INFO L290 TraceCheckUtils]: 78: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,291 INFO L290 TraceCheckUtils]: 79: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,291 INFO L290 TraceCheckUtils]: 80: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,291 INFO L290 TraceCheckUtils]: 81: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem77;havoc #t~mem77; {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,293 INFO L290 TraceCheckUtils]: 86: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,293 INFO L290 TraceCheckUtils]: 87: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {343923#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:11,293 INFO L290 TraceCheckUtils]: 88: Hoare triple {343923#(= 2 ssl3_accept_~blastFlag~0)} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 89: Hoare triple {343919#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 90: Hoare triple {343919#false} assume !(0 == ~tmp___10~0); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 91: Hoare triple {343919#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 92: Hoare triple {343919#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 93: Hoare triple {343919#false} ~skip~0 := 0; {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 94: Hoare triple {343919#false} assume !false; {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 95: Hoare triple {343919#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 96: Hoare triple {343919#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 97: Hoare triple {343919#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 98: Hoare triple {343919#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 99: Hoare triple {343919#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 100: Hoare triple {343919#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 101: Hoare triple {343919#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 102: Hoare triple {343919#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,294 INFO L290 TraceCheckUtils]: 103: Hoare triple {343919#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 104: Hoare triple {343919#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 105: Hoare triple {343919#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 106: Hoare triple {343919#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 107: Hoare triple {343919#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 108: Hoare triple {343919#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 109: Hoare triple {343919#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 110: Hoare triple {343919#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 111: Hoare triple {343919#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 112: Hoare triple {343919#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 113: Hoare triple {343919#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 114: Hoare triple {343919#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 115: Hoare triple {343919#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 116: Hoare triple {343919#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,295 INFO L290 TraceCheckUtils]: 117: Hoare triple {343919#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 118: Hoare triple {343919#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 119: Hoare triple {343919#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 120: Hoare triple {343919#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 121: Hoare triple {343919#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 122: Hoare triple {343919#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 123: Hoare triple {343919#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 124: Hoare triple {343919#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 125: Hoare triple {343919#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 126: Hoare triple {343919#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 127: Hoare triple {343919#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 128: Hoare triple {343919#false} assume 8672 == #t~mem79;havoc #t~mem79; {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 129: Hoare triple {343919#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 130: Hoare triple {343919#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 131: Hoare triple {343919#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,296 INFO L290 TraceCheckUtils]: 132: Hoare triple {343919#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 133: Hoare triple {343919#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 134: Hoare triple {343919#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 135: Hoare triple {343919#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 136: Hoare triple {343919#false} ~skip~0 := 0; {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 137: Hoare triple {343919#false} assume !false; {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 138: Hoare triple {343919#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 139: Hoare triple {343919#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 140: Hoare triple {343919#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 141: Hoare triple {343919#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 142: Hoare triple {343919#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 143: Hoare triple {343919#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 144: Hoare triple {343919#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 145: Hoare triple {343919#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 146: Hoare triple {343919#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,297 INFO L290 TraceCheckUtils]: 147: Hoare triple {343919#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 148: Hoare triple {343919#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 149: Hoare triple {343919#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 150: Hoare triple {343919#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 151: Hoare triple {343919#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 152: Hoare triple {343919#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 153: Hoare triple {343919#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 154: Hoare triple {343919#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 155: Hoare triple {343919#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 156: Hoare triple {343919#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 157: Hoare triple {343919#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 158: Hoare triple {343919#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 159: Hoare triple {343919#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 160: Hoare triple {343919#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 161: Hoare triple {343919#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,298 INFO L290 TraceCheckUtils]: 162: Hoare triple {343919#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 163: Hoare triple {343919#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 164: Hoare triple {343919#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 165: Hoare triple {343919#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 166: Hoare triple {343919#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 167: Hoare triple {343919#false} assume 8640 == #t~mem75;havoc #t~mem75; {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 168: Hoare triple {343919#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 169: Hoare triple {343919#false} assume !(9 == ~blastFlag~0); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 170: Hoare triple {343919#false} assume !(12 == ~blastFlag~0); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 171: Hoare triple {343919#false} assume !(15 == ~blastFlag~0); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 172: Hoare triple {343919#false} assume !(18 == ~blastFlag~0); {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 173: Hoare triple {343919#false} assume 21 == ~blastFlag~0; {343919#false} is VALID [2022-04-15 11:50:11,299 INFO L290 TraceCheckUtils]: 174: Hoare triple {343919#false} assume !false; {343919#false} is VALID [2022-04-15 11:50:11,300 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-15 11:50:11,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:11,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795073359] [2022-04-15 11:50:11,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795073359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:11,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:11,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:50:11,300 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:11,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1055186591] [2022-04-15 11:50:11,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1055186591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:11,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:11,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:50:11,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33733580] [2022-04-15 11:50:11,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:11,302 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-15 11:50:11,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:11,303 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-15 11:50:11,392 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-15 11:50:11,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:50:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:11,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:50:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:50:11,393 INFO L87 Difference]: Start difference. First operand 600 states and 876 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-15 11:50:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:18,193 INFO L93 Difference]: Finished difference Result 1741 states and 2562 transitions. [2022-04-15 11:50:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:50:18,193 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-15 11:50:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:18,193 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-15 11:50:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:50:18,195 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-15 11:50:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:50:18,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 677 transitions. [2022-04-15 11:50:18,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:18,667 INFO L225 Difference]: With dead ends: 1741 [2022-04-15 11:50:18,667 INFO L226 Difference]: Without dead ends: 1169 [2022-04-15 11:50:18,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:50:18,668 INFO L913 BasicCegarLoop]: 273 mSDtfsCounter, 154 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:18,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 467 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:50:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-04-15 11:50:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1169. [2022-04-15 11:50:18,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:18,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1169 states. Second operand has 1169 states, 1164 states have (on average 1.4536082474226804) internal successors, (1692), 1164 states have internal predecessors, (1692), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:18,767 INFO L74 IsIncluded]: Start isIncluded. First operand 1169 states. Second operand has 1169 states, 1164 states have (on average 1.4536082474226804) internal successors, (1692), 1164 states have internal predecessors, (1692), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:18,767 INFO L87 Difference]: Start difference. First operand 1169 states. Second operand has 1169 states, 1164 states have (on average 1.4536082474226804) internal successors, (1692), 1164 states have internal predecessors, (1692), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:18,803 INFO L93 Difference]: Finished difference Result 1169 states and 1696 transitions. [2022-04-15 11:50:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1696 transitions. [2022-04-15 11:50:18,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:18,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:18,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 1169 states, 1164 states have (on average 1.4536082474226804) internal successors, (1692), 1164 states have internal predecessors, (1692), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1169 states. [2022-04-15 11:50:18,805 INFO L87 Difference]: Start difference. First operand has 1169 states, 1164 states have (on average 1.4536082474226804) internal successors, (1692), 1164 states have internal predecessors, (1692), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1169 states. [2022-04-15 11:50:18,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:18,840 INFO L93 Difference]: Finished difference Result 1169 states and 1696 transitions. [2022-04-15 11:50:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1696 transitions. [2022-04-15 11:50:18,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:18,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:18,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:18,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1164 states have (on average 1.4536082474226804) internal successors, (1692), 1164 states have internal predecessors, (1692), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1696 transitions. [2022-04-15 11:50:18,892 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1696 transitions. Word has length 175 [2022-04-15 11:50:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:18,892 INFO L478 AbstractCegarLoop]: Abstraction has 1169 states and 1696 transitions. [2022-04-15 11:50:18,892 INFO L479 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-15 11:50:18,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1169 states and 1696 transitions. [2022-04-15 11:50:20,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1696 edges. 1696 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1696 transitions. [2022-04-15 11:50:20,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 11:50:20,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:20,796 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:20,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 11:50:20,796 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 39110052, now seen corresponding path program 1 times [2022-04-15 11:50:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:20,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [474892125] [2022-04-15 11:50:20,905 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:20,905 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:20,905 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:20,905 INFO L85 PathProgramCache]: Analyzing trace with hash 39110052, now seen corresponding path program 2 times [2022-04-15 11:50:20,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:20,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841697624] [2022-04-15 11:50:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:20,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:21,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {352091#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {352085#true} is VALID [2022-04-15 11:50:21,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {352085#true} assume true; {352085#true} is VALID [2022-04-15 11:50:21,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {352085#true} {352085#true} #755#return; {352085#true} is VALID [2022-04-15 11:50:21,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {352085#true} call ULTIMATE.init(); {352091#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:21,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {352091#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {352085#true} assume true; {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {352085#true} {352085#true} #755#return; {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {352085#true} call #t~ret161 := main(); {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {352085#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {352085#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L272 TraceCheckUtils]: 7: Hoare triple {352085#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {352085#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {352085#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {352085#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {352085#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {352085#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {352085#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {352085#true} assume !false; {352085#true} is VALID [2022-04-15 11:50:21,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {352085#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {352085#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {352085#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {352085#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {352085#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {352085#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {352085#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {352085#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {352085#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {352085#true} assume 8464 == #t~mem55;havoc #t~mem55; {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {352085#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {352085#true} is VALID [2022-04-15 11:50:21,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {352085#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !false; {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {352090#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {352090#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {352086#false} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {352086#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {352086#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {352086#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {352086#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 51: Hoare triple {352086#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {352086#false} is VALID [2022-04-15 11:50:21,038 INFO L290 TraceCheckUtils]: 52: Hoare triple {352086#false} ~skip~0 := 0; {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {352086#false} assume !false; {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {352086#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {352086#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {352086#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 57: Hoare triple {352086#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {352086#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {352086#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 60: Hoare triple {352086#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {352086#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 62: Hoare triple {352086#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {352086#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {352086#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {352086#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {352086#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,039 INFO L290 TraceCheckUtils]: 67: Hoare triple {352086#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {352086#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 69: Hoare triple {352086#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 70: Hoare triple {352086#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 71: Hoare triple {352086#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 72: Hoare triple {352086#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {352086#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {352086#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {352086#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {352086#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {352086#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {352086#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {352086#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {352086#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {352086#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {352086#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {352086#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {352086#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {352086#false} assume 8656 == #t~mem77;havoc #t~mem77; {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {352086#false} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 87: Hoare triple {352086#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {352086#false} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {352086#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {352086#false} assume !(0 == ~tmp___10~0); {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 91: Hoare triple {352086#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {352086#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {352086#false} ~skip~0 := 0; {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 94: Hoare triple {352086#false} assume !false; {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 95: Hoare triple {352086#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,041 INFO L290 TraceCheckUtils]: 96: Hoare triple {352086#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {352086#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {352086#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 99: Hoare triple {352086#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 100: Hoare triple {352086#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 101: Hoare triple {352086#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 102: Hoare triple {352086#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 103: Hoare triple {352086#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 104: Hoare triple {352086#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 105: Hoare triple {352086#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 106: Hoare triple {352086#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 107: Hoare triple {352086#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 108: Hoare triple {352086#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 109: Hoare triple {352086#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 110: Hoare triple {352086#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,042 INFO L290 TraceCheckUtils]: 111: Hoare triple {352086#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 112: Hoare triple {352086#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 113: Hoare triple {352086#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 114: Hoare triple {352086#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 115: Hoare triple {352086#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 116: Hoare triple {352086#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 117: Hoare triple {352086#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 118: Hoare triple {352086#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 119: Hoare triple {352086#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 120: Hoare triple {352086#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,043 INFO L290 TraceCheckUtils]: 121: Hoare triple {352086#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 122: Hoare triple {352086#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 123: Hoare triple {352086#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 124: Hoare triple {352086#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 125: Hoare triple {352086#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 126: Hoare triple {352086#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 127: Hoare triple {352086#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 128: Hoare triple {352086#false} assume 8672 == #t~mem79;havoc #t~mem79; {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 129: Hoare triple {352086#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {352086#false} is VALID [2022-04-15 11:50:21,044 INFO L290 TraceCheckUtils]: 130: Hoare triple {352086#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 131: Hoare triple {352086#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 132: Hoare triple {352086#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 133: Hoare triple {352086#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 134: Hoare triple {352086#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 135: Hoare triple {352086#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 136: Hoare triple {352086#false} ~skip~0 := 0; {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 137: Hoare triple {352086#false} assume !false; {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 138: Hoare triple {352086#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 139: Hoare triple {352086#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,045 INFO L290 TraceCheckUtils]: 140: Hoare triple {352086#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 141: Hoare triple {352086#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 142: Hoare triple {352086#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 143: Hoare triple {352086#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 144: Hoare triple {352086#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 145: Hoare triple {352086#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 146: Hoare triple {352086#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 147: Hoare triple {352086#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 148: Hoare triple {352086#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 149: Hoare triple {352086#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,046 INFO L290 TraceCheckUtils]: 150: Hoare triple {352086#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 151: Hoare triple {352086#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 152: Hoare triple {352086#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 153: Hoare triple {352086#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 154: Hoare triple {352086#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 155: Hoare triple {352086#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 156: Hoare triple {352086#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 157: Hoare triple {352086#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 158: Hoare triple {352086#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 159: Hoare triple {352086#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,047 INFO L290 TraceCheckUtils]: 160: Hoare triple {352086#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 161: Hoare triple {352086#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 162: Hoare triple {352086#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 163: Hoare triple {352086#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 164: Hoare triple {352086#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 165: Hoare triple {352086#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 166: Hoare triple {352086#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 167: Hoare triple {352086#false} assume 8640 == #t~mem75;havoc #t~mem75; {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 168: Hoare triple {352086#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 169: Hoare triple {352086#false} assume !(9 == ~blastFlag~0); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 170: Hoare triple {352086#false} assume !(12 == ~blastFlag~0); {352086#false} is VALID [2022-04-15 11:50:21,048 INFO L290 TraceCheckUtils]: 171: Hoare triple {352086#false} assume !(15 == ~blastFlag~0); {352086#false} is VALID [2022-04-15 11:50:21,049 INFO L290 TraceCheckUtils]: 172: Hoare triple {352086#false} assume !(18 == ~blastFlag~0); {352086#false} is VALID [2022-04-15 11:50:21,049 INFO L290 TraceCheckUtils]: 173: Hoare triple {352086#false} assume 21 == ~blastFlag~0; {352086#false} is VALID [2022-04-15 11:50:21,049 INFO L290 TraceCheckUtils]: 174: Hoare triple {352086#false} assume !false; {352086#false} is VALID [2022-04-15 11:50:21,049 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-15 11:50:21,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:21,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841697624] [2022-04-15 11:50:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841697624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:21,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:50:21,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:21,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [474892125] [2022-04-15 11:50:21,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [474892125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:21,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:21,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:50:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17061555] [2022-04-15 11:50:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:21,051 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-15 11:50:21,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:21,051 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-15 11:50:21,130 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-15 11:50:21,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:50:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:21,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:50:21,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:50:21,131 INFO L87 Difference]: Start difference. First operand 1169 states and 1696 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-15 11:50:24,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:26,342 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-15 11:50:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:27,934 INFO L93 Difference]: Finished difference Result 2337 states and 3397 transitions. [2022-04-15 11:50:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:50:27,934 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-15 11:50:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:27,934 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-15 11:50:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2022-04-15 11:50:27,936 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-15 11:50:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2022-04-15 11:50:27,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 496 transitions. [2022-04-15 11:50:28,243 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-15 11:50:28,302 INFO L225 Difference]: With dead ends: 2337 [2022-04-15 11:50:28,302 INFO L226 Difference]: Without dead ends: 1196 [2022-04-15 11:50:28,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:50:28,304 INFO L913 BasicCegarLoop]: 246 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:28,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 440 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:50:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2022-04-15 11:50:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2022-04-15 11:50:28,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:28,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1196 states. Second operand has 1196 states, 1191 states have (on average 1.4500419815281276) internal successors, (1727), 1191 states have internal predecessors, (1727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:28,437 INFO L74 IsIncluded]: Start isIncluded. First operand 1196 states. Second operand has 1196 states, 1191 states have (on average 1.4500419815281276) internal successors, (1727), 1191 states have internal predecessors, (1727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:28,438 INFO L87 Difference]: Start difference. First operand 1196 states. Second operand has 1196 states, 1191 states have (on average 1.4500419815281276) internal successors, (1727), 1191 states have internal predecessors, (1727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:28,482 INFO L93 Difference]: Finished difference Result 1196 states and 1731 transitions. [2022-04-15 11:50:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1731 transitions. [2022-04-15 11:50:28,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:28,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:28,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 1196 states, 1191 states have (on average 1.4500419815281276) internal successors, (1727), 1191 states have internal predecessors, (1727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1196 states. [2022-04-15 11:50:28,485 INFO L87 Difference]: Start difference. First operand has 1196 states, 1191 states have (on average 1.4500419815281276) internal successors, (1727), 1191 states have internal predecessors, (1727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1196 states. [2022-04-15 11:50:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:28,523 INFO L93 Difference]: Finished difference Result 1196 states and 1731 transitions. [2022-04-15 11:50:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1731 transitions. [2022-04-15 11:50:28,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:28,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:28,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:28,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1191 states have (on average 1.4500419815281276) internal successors, (1727), 1191 states have internal predecessors, (1727), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1731 transitions. [2022-04-15 11:50:28,578 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1731 transitions. Word has length 175 [2022-04-15 11:50:28,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:28,578 INFO L478 AbstractCegarLoop]: Abstraction has 1196 states and 1731 transitions. [2022-04-15 11:50:28,578 INFO L479 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-15 11:50:28,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1196 states and 1731 transitions. [2022-04-15 11:50:30,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1731 edges. 1731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1731 transitions. [2022-04-15 11:50:30,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-15 11:50:30,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:30,513 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:30,513 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-15 11:50:30,513 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:30,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1711678679, now seen corresponding path program 1 times [2022-04-15 11:50:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:30,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2100358596] [2022-04-15 11:50:30,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:30,646 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:30,646 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:30,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1711678679, now seen corresponding path program 2 times [2022-04-15 11:50:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:30,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126717354] [2022-04-15 11:50:30,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:30,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:30,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {361559#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {361552#true} is VALID [2022-04-15 11:50:30,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {361552#true} assume true; {361552#true} is VALID [2022-04-15 11:50:30,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361552#true} {361552#true} #755#return; {361552#true} is VALID [2022-04-15 11:50:30,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {361552#true} call ULTIMATE.init(); {361559#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:30,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {361559#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {361552#true} is VALID [2022-04-15 11:50:30,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {361552#true} assume true; {361552#true} is VALID [2022-04-15 11:50:30,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361552#true} {361552#true} #755#return; {361552#true} is VALID [2022-04-15 11:50:30,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {361552#true} call #t~ret161 := main(); {361552#true} is VALID [2022-04-15 11:50:30,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {361552#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {361552#true} is VALID [2022-04-15 11:50:30,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {361552#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L272 TraceCheckUtils]: 7: Hoare triple {361552#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {361552#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {361552#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {361552#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {361552#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {361552#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {361552#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {361552#true} assume !false; {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {361552#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {361552#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {361552#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {361552#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {361552#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 20: Hoare triple {361552#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {361552#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {361552#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {361552#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {361552#true} assume 8464 == #t~mem55;havoc #t~mem55; {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {361552#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {361552#true} is VALID [2022-04-15 11:50:30,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {361552#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {361552#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {361552#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {361552#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {361552#true} ~skip~0 := 0; {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {361552#true} assume !false; {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {361552#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {361552#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {361552#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {361552#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {361552#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {361552#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {361552#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {361552#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {361552#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {361552#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {361552#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {361552#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {361552#true} assume 8496 == #t~mem58;havoc #t~mem58; {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {361552#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {361552#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {361552#true} is VALID [2022-04-15 11:50:30,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {361552#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {361552#true} is VALID [2022-04-15 11:50:30,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {361552#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,791 INFO L290 TraceCheckUtils]: 49: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,791 INFO L290 TraceCheckUtils]: 50: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,793 INFO L290 TraceCheckUtils]: 55: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,793 INFO L290 TraceCheckUtils]: 56: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,794 INFO L290 TraceCheckUtils]: 57: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,794 INFO L290 TraceCheckUtils]: 58: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,795 INFO L290 TraceCheckUtils]: 60: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,795 INFO L290 TraceCheckUtils]: 61: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,795 INFO L290 TraceCheckUtils]: 62: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,797 INFO L290 TraceCheckUtils]: 66: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:30,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {361557#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {361558#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {361558#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 69: Hoare triple {361553#false} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {361553#false} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {361553#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {361553#false} assume !(~ret~0 <= 0); {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {361553#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {361553#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 75: Hoare triple {361553#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {361553#false} ~skip~0 := 0; {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 77: Hoare triple {361553#false} assume !false; {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 78: Hoare triple {361553#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 79: Hoare triple {361553#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 80: Hoare triple {361553#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,798 INFO L290 TraceCheckUtils]: 81: Hoare triple {361553#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {361553#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {361553#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {361553#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {361553#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 86: Hoare triple {361553#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 87: Hoare triple {361553#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 88: Hoare triple {361553#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 89: Hoare triple {361553#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 90: Hoare triple {361553#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 91: Hoare triple {361553#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 92: Hoare triple {361553#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 93: Hoare triple {361553#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 94: Hoare triple {361553#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 95: Hoare triple {361553#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {361553#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 97: Hoare triple {361553#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {361553#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 99: Hoare triple {361553#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 100: Hoare triple {361553#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 101: Hoare triple {361553#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 102: Hoare triple {361553#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 103: Hoare triple {361553#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 104: Hoare triple {361553#false} assume 8593 == #t~mem72;havoc #t~mem72; {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 105: Hoare triple {361553#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 106: Hoare triple {361553#false} assume !(7 == ~blastFlag~0); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 107: Hoare triple {361553#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 108: Hoare triple {361553#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 109: Hoare triple {361553#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 110: Hoare triple {361553#false} ~skip~0 := 0; {361553#false} is VALID [2022-04-15 11:50:30,800 INFO L290 TraceCheckUtils]: 111: Hoare triple {361553#false} assume !false; {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 112: Hoare triple {361553#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 113: Hoare triple {361553#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 114: Hoare triple {361553#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 115: Hoare triple {361553#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 116: Hoare triple {361553#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 117: Hoare triple {361553#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 118: Hoare triple {361553#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 119: Hoare triple {361553#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 120: Hoare triple {361553#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 121: Hoare triple {361553#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 122: Hoare triple {361553#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 123: Hoare triple {361553#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 124: Hoare triple {361553#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 125: Hoare triple {361553#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,801 INFO L290 TraceCheckUtils]: 126: Hoare triple {361553#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 127: Hoare triple {361553#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 128: Hoare triple {361553#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 129: Hoare triple {361553#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 130: Hoare triple {361553#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 131: Hoare triple {361553#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 132: Hoare triple {361553#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 133: Hoare triple {361553#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 134: Hoare triple {361553#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 135: Hoare triple {361553#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 136: Hoare triple {361553#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 137: Hoare triple {361553#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 138: Hoare triple {361553#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 139: Hoare triple {361553#false} assume 8608 == #t~mem73;havoc #t~mem73; {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 140: Hoare triple {361553#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {361553#false} is VALID [2022-04-15 11:50:30,802 INFO L290 TraceCheckUtils]: 141: Hoare triple {361553#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 142: Hoare triple {361553#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 143: Hoare triple {361553#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 144: Hoare triple {361553#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 145: Hoare triple {361553#false} ~skip~0 := 0; {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 146: Hoare triple {361553#false} assume !false; {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 147: Hoare triple {361553#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 148: Hoare triple {361553#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 149: Hoare triple {361553#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 150: Hoare triple {361553#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 151: Hoare triple {361553#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 152: Hoare triple {361553#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 153: Hoare triple {361553#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 154: Hoare triple {361553#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,803 INFO L290 TraceCheckUtils]: 155: Hoare triple {361553#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 156: Hoare triple {361553#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 157: Hoare triple {361553#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 158: Hoare triple {361553#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 159: Hoare triple {361553#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 160: Hoare triple {361553#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 161: Hoare triple {361553#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 162: Hoare triple {361553#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 163: Hoare triple {361553#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 164: Hoare triple {361553#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 165: Hoare triple {361553#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 166: Hoare triple {361553#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 167: Hoare triple {361553#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 168: Hoare triple {361553#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 169: Hoare triple {361553#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,804 INFO L290 TraceCheckUtils]: 170: Hoare triple {361553#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 171: Hoare triple {361553#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 172: Hoare triple {361553#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 173: Hoare triple {361553#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 174: Hoare triple {361553#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 175: Hoare triple {361553#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 176: Hoare triple {361553#false} assume 8640 == #t~mem75;havoc #t~mem75; {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 177: Hoare triple {361553#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 178: Hoare triple {361553#false} assume !(9 == ~blastFlag~0); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 179: Hoare triple {361553#false} assume !(12 == ~blastFlag~0); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 180: Hoare triple {361553#false} assume !(15 == ~blastFlag~0); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 181: Hoare triple {361553#false} assume !(18 == ~blastFlag~0); {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 182: Hoare triple {361553#false} assume 21 == ~blastFlag~0; {361553#false} is VALID [2022-04-15 11:50:30,805 INFO L290 TraceCheckUtils]: 183: Hoare triple {361553#false} assume !false; {361553#false} is VALID [2022-04-15 11:50:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-15 11:50:30,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:30,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126717354] [2022-04-15 11:50:30,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126717354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:30,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:30,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:30,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:30,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2100358596] [2022-04-15 11:50:30,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2100358596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:30,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:30,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72068979] [2022-04-15 11:50:30,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:30,807 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 184 [2022-04-15 11:50:30,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:30,807 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-15 11:50:30,879 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-15 11:50:30,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:30,880 INFO L87 Difference]: Start difference. First operand 1196 states and 1731 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-15 11:50:35,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:37,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:39,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:42,206 INFO L93 Difference]: Finished difference Result 2406 states and 3485 transitions. [2022-04-15 11:50:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:42,206 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 184 [2022-04-15 11:50:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:42,207 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-15 11:50:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-04-15 11:50:42,208 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-15 11:50:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-04-15 11:50:42,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 548 transitions. [2022-04-15 11:50:42,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:42,612 INFO L225 Difference]: With dead ends: 2406 [2022-04-15 11:50:42,612 INFO L226 Difference]: Without dead ends: 1238 [2022-04-15 11:50:42,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:42,615 INFO L913 BasicCegarLoop]: 235 mSDtfsCounter, 57 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:42,615 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 609 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 11:50:42,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2022-04-15 11:50:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1196. [2022-04-15 11:50:42,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:42,703 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1238 states. Second operand has 1196 states, 1191 states have (on average 1.4483627204030227) internal successors, (1725), 1191 states have internal predecessors, (1725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,704 INFO L74 IsIncluded]: Start isIncluded. First operand 1238 states. Second operand has 1196 states, 1191 states have (on average 1.4483627204030227) internal successors, (1725), 1191 states have internal predecessors, (1725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,704 INFO L87 Difference]: Start difference. First operand 1238 states. Second operand has 1196 states, 1191 states have (on average 1.4483627204030227) internal successors, (1725), 1191 states have internal predecessors, (1725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:42,743 INFO L93 Difference]: Finished difference Result 1238 states and 1784 transitions. [2022-04-15 11:50:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1784 transitions. [2022-04-15 11:50:42,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:42,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:42,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 1196 states, 1191 states have (on average 1.4483627204030227) internal successors, (1725), 1191 states have internal predecessors, (1725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1238 states. [2022-04-15 11:50:42,745 INFO L87 Difference]: Start difference. First operand has 1196 states, 1191 states have (on average 1.4483627204030227) internal successors, (1725), 1191 states have internal predecessors, (1725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1238 states. [2022-04-15 11:50:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:42,785 INFO L93 Difference]: Finished difference Result 1238 states and 1784 transitions. [2022-04-15 11:50:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1784 transitions. [2022-04-15 11:50:42,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:42,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:42,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:42,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1191 states have (on average 1.4483627204030227) internal successors, (1725), 1191 states have internal predecessors, (1725), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1729 transitions. [2022-04-15 11:50:42,840 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1729 transitions. Word has length 184 [2022-04-15 11:50:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:42,840 INFO L478 AbstractCegarLoop]: Abstraction has 1196 states and 1729 transitions. [2022-04-15 11:50:42,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1196 states and 1729 transitions. [2022-04-15 11:50:44,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1729 edges. 1729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1729 transitions. [2022-04-15 11:50:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-04-15 11:50:44,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:44,798 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:44,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-15 11:50:44,799 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:44,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1293789977, now seen corresponding path program 1 times [2022-04-15 11:50:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:44,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066728871] [2022-04-15 11:50:44,951 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:44,951 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:44,951 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:44,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1293789977, now seen corresponding path program 2 times [2022-04-15 11:50:44,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:44,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173911592] [2022-04-15 11:50:44,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:44,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:45,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:45,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {371251#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {371244#true} is VALID [2022-04-15 11:50:45,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {371244#true} assume true; {371244#true} is VALID [2022-04-15 11:50:45,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371244#true} {371244#true} #755#return; {371244#true} is VALID [2022-04-15 11:50:45,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {371244#true} call ULTIMATE.init(); {371251#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:45,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {371251#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {371244#true} is VALID [2022-04-15 11:50:45,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {371244#true} assume true; {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371244#true} {371244#true} #755#return; {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {371244#true} call #t~ret161 := main(); {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {371244#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {371244#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L272 TraceCheckUtils]: 7: Hoare triple {371244#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {371244#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {371244#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {371244#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {371244#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {371244#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {371244#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {371244#true} assume !false; {371244#true} is VALID [2022-04-15 11:50:45,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {371244#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {371244#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {371244#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {371244#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {371244#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {371244#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {371244#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {371244#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {371244#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {371244#true} assume 8464 == #t~mem55;havoc #t~mem55; {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {371244#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {371244#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {371244#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {371244#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {371244#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {371244#true} ~skip~0 := 0; {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {371244#true} assume !false; {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {371244#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {371244#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {371244#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 35: Hoare triple {371244#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {371244#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {371244#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {371244#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {371244#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {371244#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {371244#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {371244#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {371244#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {371244#true} assume 8496 == #t~mem58;havoc #t~mem58; {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {371244#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {371244#true} is VALID [2022-04-15 11:50:45,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {371244#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {371244#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {371244#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {371244#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {371244#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {371244#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {371244#true} ~skip~0 := 0; {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {371244#true} assume !false; {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {371244#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {371244#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {371244#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {371244#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 58: Hoare triple {371244#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 59: Hoare triple {371244#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {371244#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {371244#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {371244#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {371244#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {371244#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,101 INFO L290 TraceCheckUtils]: 65: Hoare triple {371244#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {371244#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,102 INFO L290 TraceCheckUtils]: 67: Hoare triple {371244#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,102 INFO L290 TraceCheckUtils]: 68: Hoare triple {371244#true} assume 8512 == #t~mem60;havoc #t~mem60; {371244#true} is VALID [2022-04-15 11:50:45,102 INFO L290 TraceCheckUtils]: 69: Hoare triple {371244#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {371244#true} is VALID [2022-04-15 11:50:45,102 INFO L290 TraceCheckUtils]: 70: Hoare triple {371244#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {371244#true} is VALID [2022-04-15 11:50:45,102 INFO L290 TraceCheckUtils]: 71: Hoare triple {371244#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {371244#true} is VALID [2022-04-15 11:50:45,102 INFO L290 TraceCheckUtils]: 72: Hoare triple {371244#true} assume !(~ret~0 <= 0); {371244#true} is VALID [2022-04-15 11:50:45,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {371244#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,104 INFO L290 TraceCheckUtils]: 74: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,105 INFO L290 TraceCheckUtils]: 76: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,105 INFO L290 TraceCheckUtils]: 77: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,106 INFO L290 TraceCheckUtils]: 79: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,106 INFO L290 TraceCheckUtils]: 80: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,107 INFO L290 TraceCheckUtils]: 81: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,107 INFO L290 TraceCheckUtils]: 82: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,108 INFO L290 TraceCheckUtils]: 84: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,109 INFO L290 TraceCheckUtils]: 86: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,111 INFO L290 TraceCheckUtils]: 89: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,111 INFO L290 TraceCheckUtils]: 90: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,111 INFO L290 TraceCheckUtils]: 91: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,112 INFO L290 TraceCheckUtils]: 92: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,112 INFO L290 TraceCheckUtils]: 93: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,113 INFO L290 TraceCheckUtils]: 94: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,113 INFO L290 TraceCheckUtils]: 95: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,115 INFO L290 TraceCheckUtils]: 98: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,115 INFO L290 TraceCheckUtils]: 99: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,115 INFO L290 TraceCheckUtils]: 100: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,116 INFO L290 TraceCheckUtils]: 101: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,116 INFO L290 TraceCheckUtils]: 102: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:45,117 INFO L290 TraceCheckUtils]: 103: Hoare triple {371249#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {371250#(not (= 8593 |ssl3_accept_#t~mem72|))} is VALID [2022-04-15 11:50:45,117 INFO L290 TraceCheckUtils]: 104: Hoare triple {371250#(not (= 8593 |ssl3_accept_#t~mem72|))} assume 8593 == #t~mem72;havoc #t~mem72; {371245#false} is VALID [2022-04-15 11:50:45,117 INFO L290 TraceCheckUtils]: 105: Hoare triple {371245#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {371245#false} is VALID [2022-04-15 11:50:45,117 INFO L290 TraceCheckUtils]: 106: Hoare triple {371245#false} assume !(7 == ~blastFlag~0); {371245#false} is VALID [2022-04-15 11:50:45,117 INFO L290 TraceCheckUtils]: 107: Hoare triple {371245#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 108: Hoare triple {371245#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 109: Hoare triple {371245#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 110: Hoare triple {371245#false} ~skip~0 := 0; {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 111: Hoare triple {371245#false} assume !false; {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 112: Hoare triple {371245#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 113: Hoare triple {371245#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 114: Hoare triple {371245#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 115: Hoare triple {371245#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 116: Hoare triple {371245#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,118 INFO L290 TraceCheckUtils]: 117: Hoare triple {371245#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 118: Hoare triple {371245#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 119: Hoare triple {371245#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 120: Hoare triple {371245#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 121: Hoare triple {371245#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 122: Hoare triple {371245#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 123: Hoare triple {371245#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 124: Hoare triple {371245#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 125: Hoare triple {371245#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 126: Hoare triple {371245#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 127: Hoare triple {371245#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,119 INFO L290 TraceCheckUtils]: 128: Hoare triple {371245#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 129: Hoare triple {371245#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 130: Hoare triple {371245#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 131: Hoare triple {371245#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 132: Hoare triple {371245#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 133: Hoare triple {371245#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 134: Hoare triple {371245#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 135: Hoare triple {371245#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 136: Hoare triple {371245#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 137: Hoare triple {371245#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,120 INFO L290 TraceCheckUtils]: 138: Hoare triple {371245#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 139: Hoare triple {371245#false} assume 8608 == #t~mem73;havoc #t~mem73; {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 140: Hoare triple {371245#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 141: Hoare triple {371245#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 142: Hoare triple {371245#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 143: Hoare triple {371245#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 144: Hoare triple {371245#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 145: Hoare triple {371245#false} ~skip~0 := 0; {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 146: Hoare triple {371245#false} assume !false; {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 147: Hoare triple {371245#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,121 INFO L290 TraceCheckUtils]: 148: Hoare triple {371245#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 149: Hoare triple {371245#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 150: Hoare triple {371245#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 151: Hoare triple {371245#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 152: Hoare triple {371245#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 153: Hoare triple {371245#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 154: Hoare triple {371245#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 155: Hoare triple {371245#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 156: Hoare triple {371245#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 157: Hoare triple {371245#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 158: Hoare triple {371245#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,122 INFO L290 TraceCheckUtils]: 159: Hoare triple {371245#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 160: Hoare triple {371245#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 161: Hoare triple {371245#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 162: Hoare triple {371245#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 163: Hoare triple {371245#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 164: Hoare triple {371245#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 165: Hoare triple {371245#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 166: Hoare triple {371245#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 167: Hoare triple {371245#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 168: Hoare triple {371245#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,123 INFO L290 TraceCheckUtils]: 169: Hoare triple {371245#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 170: Hoare triple {371245#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 171: Hoare triple {371245#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 172: Hoare triple {371245#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 173: Hoare triple {371245#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 174: Hoare triple {371245#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 175: Hoare triple {371245#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 176: Hoare triple {371245#false} assume 8640 == #t~mem75;havoc #t~mem75; {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 177: Hoare triple {371245#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 178: Hoare triple {371245#false} assume !(9 == ~blastFlag~0); {371245#false} is VALID [2022-04-15 11:50:45,124 INFO L290 TraceCheckUtils]: 179: Hoare triple {371245#false} assume !(12 == ~blastFlag~0); {371245#false} is VALID [2022-04-15 11:50:45,125 INFO L290 TraceCheckUtils]: 180: Hoare triple {371245#false} assume !(15 == ~blastFlag~0); {371245#false} is VALID [2022-04-15 11:50:45,125 INFO L290 TraceCheckUtils]: 181: Hoare triple {371245#false} assume !(18 == ~blastFlag~0); {371245#false} is VALID [2022-04-15 11:50:45,125 INFO L290 TraceCheckUtils]: 182: Hoare triple {371245#false} assume 21 == ~blastFlag~0; {371245#false} is VALID [2022-04-15 11:50:45,125 INFO L290 TraceCheckUtils]: 183: Hoare triple {371245#false} assume !false; {371245#false} is VALID [2022-04-15 11:50:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-15 11:50:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:45,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173911592] [2022-04-15 11:50:45,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173911592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:45,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:45,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:45,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:45,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066728871] [2022-04-15 11:50:45,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066728871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:45,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:45,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:45,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177654506] [2022-04-15 11:50:45,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:45,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 184 [2022-04-15 11:50:45,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:45,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:45,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:45,214 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:45,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:45,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:45,215 INFO L87 Difference]: Start difference. First operand 1196 states and 1729 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:47,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:52,387 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-15 11:50:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:54,771 INFO L93 Difference]: Finished difference Result 2506 states and 3621 transitions. [2022-04-15 11:50:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:54,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 184 [2022-04-15 11:50:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-04-15 11:50:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-04-15 11:50:54,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 635 transitions. [2022-04-15 11:50:55,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 635 edges. 635 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:55,278 INFO L225 Difference]: With dead ends: 2506 [2022-04-15 11:50:55,278 INFO L226 Difference]: Without dead ends: 1338 [2022-04-15 11:50:55,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:55,279 INFO L913 BasicCegarLoop]: 164 mSDtfsCounter, 126 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:55,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 460 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 11:50:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-04-15 11:50:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1196. [2022-04-15 11:50:55,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:55,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1338 states. Second operand has 1196 states, 1191 states have (on average 1.4416456759026028) internal successors, (1717), 1191 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:55,374 INFO L74 IsIncluded]: Start isIncluded. First operand 1338 states. Second operand has 1196 states, 1191 states have (on average 1.4416456759026028) internal successors, (1717), 1191 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:55,374 INFO L87 Difference]: Start difference. First operand 1338 states. Second operand has 1196 states, 1191 states have (on average 1.4416456759026028) internal successors, (1717), 1191 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:55,419 INFO L93 Difference]: Finished difference Result 1338 states and 1916 transitions. [2022-04-15 11:50:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1916 transitions. [2022-04-15 11:50:55,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:55,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:55,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 1196 states, 1191 states have (on average 1.4416456759026028) internal successors, (1717), 1191 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1338 states. [2022-04-15 11:50:55,421 INFO L87 Difference]: Start difference. First operand has 1196 states, 1191 states have (on average 1.4416456759026028) internal successors, (1717), 1191 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1338 states. [2022-04-15 11:50:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:55,466 INFO L93 Difference]: Finished difference Result 1338 states and 1916 transitions. [2022-04-15 11:50:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1916 transitions. [2022-04-15 11:50:55,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:55,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:55,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:55,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1191 states have (on average 1.4416456759026028) internal successors, (1717), 1191 states have internal predecessors, (1717), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1721 transitions. [2022-04-15 11:50:55,532 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1721 transitions. Word has length 184 [2022-04-15 11:50:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:55,533 INFO L478 AbstractCegarLoop]: Abstraction has 1196 states and 1721 transitions. [2022-04-15 11:50:55,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:55,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1196 states and 1721 transitions. [2022-04-15 11:50:57,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1721 edges. 1721 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1721 transitions. [2022-04-15 11:50:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-04-15 11:50:57,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:57,501 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:57,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-15 11:50:57,501 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:57,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2035355053, now seen corresponding path program 1 times [2022-04-15 11:50:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:57,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [966718216] [2022-04-15 11:50:57,640 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:57,640 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:57,640 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2035355053, now seen corresponding path program 2 times [2022-04-15 11:50:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874402789] [2022-04-15 11:50:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:57,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:57,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {381342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {381336#true} is VALID [2022-04-15 11:50:57,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {381336#true} assume true; {381336#true} is VALID [2022-04-15 11:50:57,764 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381336#true} {381336#true} #755#return; {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {381336#true} call ULTIMATE.init(); {381342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:50:57,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {381342#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {381336#true} assume true; {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381336#true} {381336#true} #755#return; {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {381336#true} call #t~ret161 := main(); {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {381336#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {381336#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {381336#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {381336#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {381336#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {381336#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {381336#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {381336#true} is VALID [2022-04-15 11:50:57,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {381336#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {381336#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {381336#true} assume !false; {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {381336#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {381336#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {381336#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {381336#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {381336#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {381336#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {381336#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {381336#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {381336#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {381336#true} assume 8464 == #t~mem55;havoc #t~mem55; {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {381336#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {381336#true} is VALID [2022-04-15 11:50:57,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {381336#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {381336#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {381336#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {381336#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {381336#true} ~skip~0 := 0; {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {381336#true} assume !false; {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {381336#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {381336#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {381336#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {381336#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {381336#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {381336#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {381336#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {381336#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {381336#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {381336#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {381336#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {381336#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {381336#true} assume 8496 == #t~mem58;havoc #t~mem58; {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {381336#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {381336#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {381336#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {381336#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {381336#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {381336#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {381336#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {381336#true} ~skip~0 := 0; {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {381336#true} assume !false; {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {381336#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {381336#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,768 INFO L290 TraceCheckUtils]: 56: Hoare triple {381336#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {381336#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {381336#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {381336#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {381336#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {381336#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {381336#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {381336#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {381336#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {381336#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {381336#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {381336#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {381336#true} assume 8512 == #t~mem60;havoc #t~mem60; {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {381336#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {381336#true} is VALID [2022-04-15 11:50:57,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {381336#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {381336#true} is VALID [2022-04-15 11:50:57,770 INFO L290 TraceCheckUtils]: 71: Hoare triple {381336#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,770 INFO L290 TraceCheckUtils]: 72: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,770 INFO L290 TraceCheckUtils]: 73: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,771 INFO L290 TraceCheckUtils]: 74: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,771 INFO L290 TraceCheckUtils]: 75: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,771 INFO L290 TraceCheckUtils]: 76: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,771 INFO L290 TraceCheckUtils]: 77: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,772 INFO L290 TraceCheckUtils]: 78: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,772 INFO L290 TraceCheckUtils]: 79: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,772 INFO L290 TraceCheckUtils]: 80: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,772 INFO L290 TraceCheckUtils]: 81: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,773 INFO L290 TraceCheckUtils]: 82: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,773 INFO L290 TraceCheckUtils]: 83: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,773 INFO L290 TraceCheckUtils]: 84: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,774 INFO L290 TraceCheckUtils]: 85: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,774 INFO L290 TraceCheckUtils]: 86: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,774 INFO L290 TraceCheckUtils]: 87: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,774 INFO L290 TraceCheckUtils]: 88: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,775 INFO L290 TraceCheckUtils]: 91: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,776 INFO L290 TraceCheckUtils]: 95: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,777 INFO L290 TraceCheckUtils]: 98: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,777 INFO L290 TraceCheckUtils]: 99: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,778 INFO L290 TraceCheckUtils]: 101: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,778 INFO L290 TraceCheckUtils]: 102: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,779 INFO L290 TraceCheckUtils]: 103: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,779 INFO L290 TraceCheckUtils]: 104: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,779 INFO L290 TraceCheckUtils]: 105: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,779 INFO L290 TraceCheckUtils]: 106: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,780 INFO L290 TraceCheckUtils]: 107: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem77;havoc #t~mem77; {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,780 INFO L290 TraceCheckUtils]: 110: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 111: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {381341#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 112: Hoare triple {381341#(= 3 ssl3_accept_~blastFlag~0)} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {381337#false} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 113: Hoare triple {381337#false} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 114: Hoare triple {381337#false} assume !(0 == ~tmp___10~0); {381337#false} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 115: Hoare triple {381337#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 116: Hoare triple {381337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {381337#false} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 117: Hoare triple {381337#false} ~skip~0 := 0; {381337#false} is VALID [2022-04-15 11:50:57,781 INFO L290 TraceCheckUtils]: 118: Hoare triple {381337#false} assume !false; {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 119: Hoare triple {381337#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 120: Hoare triple {381337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 121: Hoare triple {381337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 122: Hoare triple {381337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 123: Hoare triple {381337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 124: Hoare triple {381337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 125: Hoare triple {381337#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 126: Hoare triple {381337#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 127: Hoare triple {381337#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 128: Hoare triple {381337#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 129: Hoare triple {381337#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 130: Hoare triple {381337#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 131: Hoare triple {381337#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 132: Hoare triple {381337#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,782 INFO L290 TraceCheckUtils]: 133: Hoare triple {381337#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 134: Hoare triple {381337#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 135: Hoare triple {381337#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 136: Hoare triple {381337#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 137: Hoare triple {381337#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 138: Hoare triple {381337#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 139: Hoare triple {381337#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 140: Hoare triple {381337#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 141: Hoare triple {381337#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 142: Hoare triple {381337#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 143: Hoare triple {381337#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 144: Hoare triple {381337#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 145: Hoare triple {381337#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 146: Hoare triple {381337#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,783 INFO L290 TraceCheckUtils]: 147: Hoare triple {381337#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 148: Hoare triple {381337#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 149: Hoare triple {381337#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 150: Hoare triple {381337#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 151: Hoare triple {381337#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 152: Hoare triple {381337#false} assume 8672 == #t~mem79;havoc #t~mem79; {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 153: Hoare triple {381337#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 154: Hoare triple {381337#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 155: Hoare triple {381337#false} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem145 := read~int(~s.base, 92 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 156: Hoare triple {381337#false} assume 0 != #t~mem145;havoc #t~mem145;call #t~mem146.base, #t~mem146.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8640, #t~mem146.base, 844 + #t~mem146.offset, 4);havoc #t~mem146.base, #t~mem146.offset; {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 157: Hoare triple {381337#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 158: Hoare triple {381337#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 159: Hoare triple {381337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 160: Hoare triple {381337#false} ~skip~0 := 0; {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 161: Hoare triple {381337#false} assume !false; {381337#false} is VALID [2022-04-15 11:50:57,784 INFO L290 TraceCheckUtils]: 162: Hoare triple {381337#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 163: Hoare triple {381337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 164: Hoare triple {381337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 165: Hoare triple {381337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 166: Hoare triple {381337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 167: Hoare triple {381337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 168: Hoare triple {381337#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 169: Hoare triple {381337#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 170: Hoare triple {381337#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 171: Hoare triple {381337#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 172: Hoare triple {381337#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 173: Hoare triple {381337#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,785 INFO L290 TraceCheckUtils]: 174: Hoare triple {381337#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 175: Hoare triple {381337#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 176: Hoare triple {381337#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 177: Hoare triple {381337#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 178: Hoare triple {381337#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 179: Hoare triple {381337#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 180: Hoare triple {381337#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 181: Hoare triple {381337#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 182: Hoare triple {381337#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 183: Hoare triple {381337#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,786 INFO L290 TraceCheckUtils]: 184: Hoare triple {381337#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 185: Hoare triple {381337#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 186: Hoare triple {381337#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 187: Hoare triple {381337#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 188: Hoare triple {381337#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 189: Hoare triple {381337#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 190: Hoare triple {381337#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 191: Hoare triple {381337#false} assume 8640 == #t~mem75;havoc #t~mem75; {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 192: Hoare triple {381337#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 193: Hoare triple {381337#false} assume !(9 == ~blastFlag~0); {381337#false} is VALID [2022-04-15 11:50:57,787 INFO L290 TraceCheckUtils]: 194: Hoare triple {381337#false} assume !(12 == ~blastFlag~0); {381337#false} is VALID [2022-04-15 11:50:57,788 INFO L290 TraceCheckUtils]: 195: Hoare triple {381337#false} assume !(15 == ~blastFlag~0); {381337#false} is VALID [2022-04-15 11:50:57,788 INFO L290 TraceCheckUtils]: 196: Hoare triple {381337#false} assume !(18 == ~blastFlag~0); {381337#false} is VALID [2022-04-15 11:50:57,788 INFO L290 TraceCheckUtils]: 197: Hoare triple {381337#false} assume 21 == ~blastFlag~0; {381337#false} is VALID [2022-04-15 11:50:57,788 INFO L290 TraceCheckUtils]: 198: Hoare triple {381337#false} assume !false; {381337#false} is VALID [2022-04-15 11:50:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-04-15 11:50:57,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:57,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874402789] [2022-04-15 11:50:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874402789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:57,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:57,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:50:57,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [966718216] [2022-04-15 11:50:57,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [966718216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:57,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:57,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:50:57,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311915850] [2022-04-15 11:50:57,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 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 199 [2022-04-15 11:50:57,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:57,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 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-15 11:50:57,878 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-15 11:50:57,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:50:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:57,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:50:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:50:57,879 INFO L87 Difference]: Start difference. First operand 1196 states and 1721 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 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-15 11:50:59,903 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-15 11:51:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:02,511 INFO L93 Difference]: Finished difference Result 2933 states and 4247 transitions. [2022-04-15 11:51:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:51:02,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 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 199 [2022-04-15 11:51:02,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 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-15 11:51:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:51:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 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-15 11:51:02,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:51:02,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 677 transitions. [2022-04-15 11:51:02,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:03,076 INFO L225 Difference]: With dead ends: 2933 [2022-04-15 11:51:03,076 INFO L226 Difference]: Without dead ends: 1765 [2022-04-15 11:51:03,077 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:51:03,078 INFO L913 BasicCegarLoop]: 407 mSDtfsCounter, 155 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:03,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 601 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 495 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 11:51:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2022-04-15 11:51:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2022-04-15 11:51:03,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:03,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1765 states. Second operand has 1765 states, 1760 states have (on average 1.4386363636363637) internal successors, (2532), 1760 states have internal predecessors, (2532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:03,265 INFO L74 IsIncluded]: Start isIncluded. First operand 1765 states. Second operand has 1765 states, 1760 states have (on average 1.4386363636363637) internal successors, (2532), 1760 states have internal predecessors, (2532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:03,266 INFO L87 Difference]: Start difference. First operand 1765 states. Second operand has 1765 states, 1760 states have (on average 1.4386363636363637) internal successors, (2532), 1760 states have internal predecessors, (2532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:03,347 INFO L93 Difference]: Finished difference Result 1765 states and 2536 transitions. [2022-04-15 11:51:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2536 transitions. [2022-04-15 11:51:03,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:03,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:03,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 1765 states, 1760 states have (on average 1.4386363636363637) internal successors, (2532), 1760 states have internal predecessors, (2532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1765 states. [2022-04-15 11:51:03,350 INFO L87 Difference]: Start difference. First operand has 1765 states, 1760 states have (on average 1.4386363636363637) internal successors, (2532), 1760 states have internal predecessors, (2532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1765 states. [2022-04-15 11:51:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:03,436 INFO L93 Difference]: Finished difference Result 1765 states and 2536 transitions. [2022-04-15 11:51:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2536 transitions. [2022-04-15 11:51:03,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:03,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:03,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:03,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1760 states have (on average 1.4386363636363637) internal successors, (2532), 1760 states have internal predecessors, (2532), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:03,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2536 transitions. [2022-04-15 11:51:03,582 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2536 transitions. Word has length 199 [2022-04-15 11:51:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:03,582 INFO L478 AbstractCegarLoop]: Abstraction has 1765 states and 2536 transitions. [2022-04-15 11:51:03,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 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-15 11:51:03,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1765 states and 2536 transitions. [2022-04-15 11:51:06,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2536 edges. 2536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2536 transitions. [2022-04-15 11:51:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-15 11:51:06,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:06,485 INFO L499 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:06,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-15 11:51:06,485 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:06,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1137969465, now seen corresponding path program 1 times [2022-04-15 11:51:06,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:06,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749827593] [2022-04-15 11:51:06,681 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:06,681 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:06,681 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1137969465, now seen corresponding path program 2 times [2022-04-15 11:51:06,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:06,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071664217] [2022-04-15 11:51:06,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:06,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:06,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:06,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {394277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {394271#true} is VALID [2022-04-15 11:51:06,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {394271#true} assume true; {394271#true} is VALID [2022-04-15 11:51:06,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {394271#true} {394271#true} #755#return; {394271#true} is VALID [2022-04-15 11:51:06,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {394271#true} call ULTIMATE.init(); {394277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:51:06,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {394277#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {394271#true} is VALID [2022-04-15 11:51:06,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {394271#true} assume true; {394271#true} is VALID [2022-04-15 11:51:06,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {394271#true} {394271#true} #755#return; {394271#true} is VALID [2022-04-15 11:51:06,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {394271#true} call #t~ret161 := main(); {394271#true} is VALID [2022-04-15 11:51:06,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {394271#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {394271#true} is VALID [2022-04-15 11:51:06,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {394271#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L272 TraceCheckUtils]: 7: Hoare triple {394271#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {394271#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {394271#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {394271#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {394271#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {394271#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {394271#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {394271#true} assume !false; {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {394271#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {394271#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {394271#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {394271#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {394271#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {394271#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {394271#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {394271#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {394271#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {394271#true} assume 8464 == #t~mem55;havoc #t~mem55; {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {394271#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 26: Hoare triple {394271#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {394271#true} is VALID [2022-04-15 11:51:06,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {394271#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 28: Hoare triple {394271#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {394271#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {394271#true} ~skip~0 := 0; {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {394271#true} assume !false; {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {394271#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {394271#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {394271#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {394271#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {394271#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {394271#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {394271#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {394271#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {394271#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {394271#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {394271#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {394271#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {394271#true} assume 8496 == #t~mem58;havoc #t~mem58; {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {394271#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {394271#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {394271#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {394271#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {394271#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {394271#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {394271#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {394271#true} ~skip~0 := 0; {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {394271#true} assume !false; {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 54: Hoare triple {394271#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 55: Hoare triple {394271#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 56: Hoare triple {394271#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 57: Hoare triple {394271#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 58: Hoare triple {394271#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,860 INFO L290 TraceCheckUtils]: 59: Hoare triple {394271#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 60: Hoare triple {394271#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 61: Hoare triple {394271#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 62: Hoare triple {394271#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 63: Hoare triple {394271#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 64: Hoare triple {394271#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {394271#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {394271#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {394271#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 68: Hoare triple {394271#true} assume 8512 == #t~mem60;havoc #t~mem60; {394271#true} is VALID [2022-04-15 11:51:06,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {394271#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 70: Hoare triple {394271#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 71: Hoare triple {394271#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 72: Hoare triple {394271#true} assume !(~ret~0 <= 0); {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {394271#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 74: Hoare triple {394271#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {394271#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {394271#true} ~skip~0 := 0; {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 77: Hoare triple {394271#true} assume !false; {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 78: Hoare triple {394271#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {394271#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {394271#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 81: Hoare triple {394271#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {394271#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {394271#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {394271#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {394271#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 86: Hoare triple {394271#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {394271#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 88: Hoare triple {394271#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 89: Hoare triple {394271#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,863 INFO L290 TraceCheckUtils]: 90: Hoare triple {394271#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 91: Hoare triple {394271#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 92: Hoare triple {394271#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 93: Hoare triple {394271#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 94: Hoare triple {394271#true} assume 8528 == #t~mem62;havoc #t~mem62; {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 95: Hoare triple {394271#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 96: Hoare triple {394271#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 97: Hoare triple {394271#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 98: Hoare triple {394271#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 99: Hoare triple {394271#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 100: Hoare triple {394271#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 101: Hoare triple {394271#true} assume !(~ret~0 <= 0); {394271#true} is VALID [2022-04-15 11:51:06,864 INFO L290 TraceCheckUtils]: 102: Hoare triple {394271#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 103: Hoare triple {394271#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 104: Hoare triple {394271#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 105: Hoare triple {394271#true} ~skip~0 := 0; {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 106: Hoare triple {394271#true} assume !false; {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 107: Hoare triple {394271#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 108: Hoare triple {394271#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 109: Hoare triple {394271#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 110: Hoare triple {394271#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 111: Hoare triple {394271#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 112: Hoare triple {394271#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 113: Hoare triple {394271#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 114: Hoare triple {394271#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 115: Hoare triple {394271#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 116: Hoare triple {394271#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,865 INFO L290 TraceCheckUtils]: 117: Hoare triple {394271#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 118: Hoare triple {394271#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 119: Hoare triple {394271#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 120: Hoare triple {394271#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 121: Hoare triple {394271#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 122: Hoare triple {394271#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 123: Hoare triple {394271#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 124: Hoare triple {394271#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 125: Hoare triple {394271#true} assume 8544 == #t~mem64;havoc #t~mem64; {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 126: Hoare triple {394271#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 127: Hoare triple {394271#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 128: Hoare triple {394271#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 129: Hoare triple {394271#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 130: Hoare triple {394271#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {394271#true} is VALID [2022-04-15 11:51:06,866 INFO L290 TraceCheckUtils]: 131: Hoare triple {394271#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {394271#true} is VALID [2022-04-15 11:51:06,867 INFO L290 TraceCheckUtils]: 132: Hoare triple {394271#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,867 INFO L290 TraceCheckUtils]: 133: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,867 INFO L290 TraceCheckUtils]: 134: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,868 INFO L290 TraceCheckUtils]: 135: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,868 INFO L290 TraceCheckUtils]: 136: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,868 INFO L290 TraceCheckUtils]: 137: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,868 INFO L290 TraceCheckUtils]: 138: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,869 INFO L290 TraceCheckUtils]: 139: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,869 INFO L290 TraceCheckUtils]: 140: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,869 INFO L290 TraceCheckUtils]: 141: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,869 INFO L290 TraceCheckUtils]: 142: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,870 INFO L290 TraceCheckUtils]: 143: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,870 INFO L290 TraceCheckUtils]: 144: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,870 INFO L290 TraceCheckUtils]: 145: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,871 INFO L290 TraceCheckUtils]: 146: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,871 INFO L290 TraceCheckUtils]: 147: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,871 INFO L290 TraceCheckUtils]: 148: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,871 INFO L290 TraceCheckUtils]: 149: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,872 INFO L290 TraceCheckUtils]: 150: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,872 INFO L290 TraceCheckUtils]: 151: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,872 INFO L290 TraceCheckUtils]: 152: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,872 INFO L290 TraceCheckUtils]: 153: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,873 INFO L290 TraceCheckUtils]: 154: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,873 INFO L290 TraceCheckUtils]: 155: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,873 INFO L290 TraceCheckUtils]: 156: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,874 INFO L290 TraceCheckUtils]: 157: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,874 INFO L290 TraceCheckUtils]: 158: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,874 INFO L290 TraceCheckUtils]: 159: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,874 INFO L290 TraceCheckUtils]: 160: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume 8448 == #t~mem68;havoc #t~mem68; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,875 INFO L290 TraceCheckUtils]: 161: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(~num1~0 > 0); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,875 INFO L290 TraceCheckUtils]: 162: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,875 INFO L290 TraceCheckUtils]: 163: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,875 INFO L290 TraceCheckUtils]: 164: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,876 INFO L290 TraceCheckUtils]: 165: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,876 INFO L290 TraceCheckUtils]: 166: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,876 INFO L290 TraceCheckUtils]: 167: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,877 INFO L290 TraceCheckUtils]: 168: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,877 INFO L290 TraceCheckUtils]: 169: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,877 INFO L290 TraceCheckUtils]: 170: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,877 INFO L290 TraceCheckUtils]: 171: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,878 INFO L290 TraceCheckUtils]: 172: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,878 INFO L290 TraceCheckUtils]: 173: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,878 INFO L290 TraceCheckUtils]: 174: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,878 INFO L290 TraceCheckUtils]: 175: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,879 INFO L290 TraceCheckUtils]: 176: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,879 INFO L290 TraceCheckUtils]: 177: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,879 INFO L290 TraceCheckUtils]: 178: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,880 INFO L290 TraceCheckUtils]: 179: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,880 INFO L290 TraceCheckUtils]: 180: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,880 INFO L290 TraceCheckUtils]: 181: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,880 INFO L290 TraceCheckUtils]: 182: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,881 INFO L290 TraceCheckUtils]: 183: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,881 INFO L290 TraceCheckUtils]: 184: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,881 INFO L290 TraceCheckUtils]: 185: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,881 INFO L290 TraceCheckUtils]: 186: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,882 INFO L290 TraceCheckUtils]: 187: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,882 INFO L290 TraceCheckUtils]: 188: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,882 INFO L290 TraceCheckUtils]: 189: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,882 INFO L290 TraceCheckUtils]: 190: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,883 INFO L290 TraceCheckUtils]: 191: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,883 INFO L290 TraceCheckUtils]: 192: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,883 INFO L290 TraceCheckUtils]: 193: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,884 INFO L290 TraceCheckUtils]: 194: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,884 INFO L290 TraceCheckUtils]: 195: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,884 INFO L290 TraceCheckUtils]: 196: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume 8640 == #t~mem75;havoc #t~mem75; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,884 INFO L290 TraceCheckUtils]: 197: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,885 INFO L290 TraceCheckUtils]: 198: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(9 == ~blastFlag~0); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,885 INFO L290 TraceCheckUtils]: 199: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(12 == ~blastFlag~0); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,885 INFO L290 TraceCheckUtils]: 200: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(15 == ~blastFlag~0); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,886 INFO L290 TraceCheckUtils]: 201: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume !(18 == ~blastFlag~0); {394276#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:51:06,886 INFO L290 TraceCheckUtils]: 202: Hoare triple {394276#(<= ssl3_accept_~blastFlag~0 5)} assume 21 == ~blastFlag~0; {394272#false} is VALID [2022-04-15 11:51:06,886 INFO L290 TraceCheckUtils]: 203: Hoare triple {394272#false} assume !false; {394272#false} is VALID [2022-04-15 11:51:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-04-15 11:51:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:06,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071664217] [2022-04-15 11:51:06,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071664217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:06,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:06,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:51:06,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:06,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749827593] [2022-04-15 11:51:06,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749827593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:06,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:06,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:51:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130572803] [2022-04-15 11:51:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:06,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 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 204 [2022-04-15 11:51:06,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:06,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 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-15 11:51:06,963 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-15 11:51:06,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:51:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:51:06,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:51:06,964 INFO L87 Difference]: Start difference. First operand 1765 states and 2536 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 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-15 11:51:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:15,292 INFO L93 Difference]: Finished difference Result 4072 states and 5878 transitions. [2022-04-15 11:51:15,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:51:15,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 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 204 [2022-04-15 11:51:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 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-15 11:51:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2022-04-15 11:51:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 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-15 11:51:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2022-04-15 11:51:15,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 678 transitions. [2022-04-15 11:51:15,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 678 edges. 678 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:15,927 INFO L225 Difference]: With dead ends: 4072 [2022-04-15 11:51:15,927 INFO L226 Difference]: Without dead ends: 2335 [2022-04-15 11:51:15,929 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:51:15,929 INFO L913 BasicCegarLoop]: 208 mSDtfsCounter, 163 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:15,930 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 393 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 11:51:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2022-04-15 11:51:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2335. [2022-04-15 11:51:16,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:16,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2335 states. Second operand has 2335 states, 2330 states have (on average 1.4394849785407726) internal successors, (3354), 2330 states have internal predecessors, (3354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:16,879 INFO L74 IsIncluded]: Start isIncluded. First operand 2335 states. Second operand has 2335 states, 2330 states have (on average 1.4394849785407726) internal successors, (3354), 2330 states have internal predecessors, (3354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:16,880 INFO L87 Difference]: Start difference. First operand 2335 states. Second operand has 2335 states, 2330 states have (on average 1.4394849785407726) internal successors, (3354), 2330 states have internal predecessors, (3354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:17,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:17,011 INFO L93 Difference]: Finished difference Result 2335 states and 3358 transitions. [2022-04-15 11:51:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3358 transitions. [2022-04-15 11:51:17,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:17,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:17,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 2335 states, 2330 states have (on average 1.4394849785407726) internal successors, (3354), 2330 states have internal predecessors, (3354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2335 states. [2022-04-15 11:51:17,014 INFO L87 Difference]: Start difference. First operand has 2335 states, 2330 states have (on average 1.4394849785407726) internal successors, (3354), 2330 states have internal predecessors, (3354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2335 states. [2022-04-15 11:51:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:17,152 INFO L93 Difference]: Finished difference Result 2335 states and 3358 transitions. [2022-04-15 11:51:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3358 transitions. [2022-04-15 11:51:17,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:17,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:17,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:17,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2330 states have (on average 1.4394849785407726) internal successors, (3354), 2330 states have internal predecessors, (3354), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3358 transitions. [2022-04-15 11:51:17,382 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3358 transitions. Word has length 204 [2022-04-15 11:51:17,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:17,382 INFO L478 AbstractCegarLoop]: Abstraction has 2335 states and 3358 transitions. [2022-04-15 11:51:17,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 3 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-15 11:51:17,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2335 states and 3358 transitions. [2022-04-15 11:51:21,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3358 edges. 3358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3358 transitions. [2022-04-15 11:51:21,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-04-15 11:51:21,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:21,271 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:21,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-15 11:51:21,271 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:21,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:21,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2143396576, now seen corresponding path program 1 times [2022-04-15 11:51:21,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:21,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305790547] [2022-04-15 11:51:21,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:21,504 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:21,504 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:21,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2143396576, now seen corresponding path program 2 times [2022-04-15 11:51:21,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:21,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355417106] [2022-04-15 11:51:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:21,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:21,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {411771#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {411764#true} is VALID [2022-04-15 11:51:21,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {411764#true} assume true; {411764#true} is VALID [2022-04-15 11:51:21,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {411764#true} {411764#true} #755#return; {411764#true} is VALID [2022-04-15 11:51:21,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {411764#true} call ULTIMATE.init(); {411771#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:51:21,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {411771#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {411764#true} is VALID [2022-04-15 11:51:21,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {411764#true} assume true; {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {411764#true} {411764#true} #755#return; {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {411764#true} call #t~ret161 := main(); {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {411764#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {411764#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L272 TraceCheckUtils]: 7: Hoare triple {411764#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {411764#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {411764#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {411764#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {411764#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {411764#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {411764#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {411764#true} assume !false; {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {411764#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {411764#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {411764#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {411764#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {411764#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {411764#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {411764#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {411764#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {411764#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {411764#true} assume 8464 == #t~mem55;havoc #t~mem55; {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {411764#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {411764#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {411764#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {411764#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {411764#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {411764#true} ~skip~0 := 0; {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {411764#true} assume !false; {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {411764#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 33: Hoare triple {411764#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 34: Hoare triple {411764#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {411764#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {411764#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 37: Hoare triple {411764#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 38: Hoare triple {411764#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {411764#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {411764#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {411764#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {411764#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {411764#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {411764#true} assume 8496 == #t~mem58;havoc #t~mem58; {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {411764#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {411764#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {411764#true} is VALID [2022-04-15 11:51:21,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {411764#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {411764#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {411764#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {411764#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {411764#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 52: Hoare triple {411764#true} ~skip~0 := 0; {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 53: Hoare triple {411764#true} assume !false; {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 54: Hoare triple {411764#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 55: Hoare triple {411764#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 56: Hoare triple {411764#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {411764#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {411764#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {411764#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 60: Hoare triple {411764#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {411764#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {411764#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {411764#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {411764#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {411764#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {411764#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 67: Hoare triple {411764#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {411764#true} assume 8512 == #t~mem60;havoc #t~mem60; {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 69: Hoare triple {411764#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {411764#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 71: Hoare triple {411764#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 72: Hoare triple {411764#true} assume !(~ret~0 <= 0); {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 73: Hoare triple {411764#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 74: Hoare triple {411764#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 75: Hoare triple {411764#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {411764#true} ~skip~0 := 0; {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {411764#true} assume !false; {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {411764#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {411764#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {411764#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {411764#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,701 INFO L290 TraceCheckUtils]: 82: Hoare triple {411764#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 83: Hoare triple {411764#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {411764#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 85: Hoare triple {411764#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 86: Hoare triple {411764#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 87: Hoare triple {411764#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 88: Hoare triple {411764#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 89: Hoare triple {411764#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 90: Hoare triple {411764#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 91: Hoare triple {411764#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 92: Hoare triple {411764#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,702 INFO L290 TraceCheckUtils]: 93: Hoare triple {411764#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 94: Hoare triple {411764#true} assume 8528 == #t~mem62;havoc #t~mem62; {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 95: Hoare triple {411764#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 96: Hoare triple {411764#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 97: Hoare triple {411764#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 98: Hoare triple {411764#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 99: Hoare triple {411764#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 100: Hoare triple {411764#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {411764#true} is VALID [2022-04-15 11:51:21,703 INFO L290 TraceCheckUtils]: 101: Hoare triple {411764#true} assume !(~ret~0 <= 0); {411764#true} is VALID [2022-04-15 11:51:21,704 INFO L290 TraceCheckUtils]: 102: Hoare triple {411764#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,705 INFO L290 TraceCheckUtils]: 103: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,705 INFO L290 TraceCheckUtils]: 104: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,706 INFO L290 TraceCheckUtils]: 105: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,706 INFO L290 TraceCheckUtils]: 106: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,707 INFO L290 TraceCheckUtils]: 107: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,707 INFO L290 TraceCheckUtils]: 108: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,708 INFO L290 TraceCheckUtils]: 109: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,708 INFO L290 TraceCheckUtils]: 110: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,709 INFO L290 TraceCheckUtils]: 111: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,709 INFO L290 TraceCheckUtils]: 112: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,710 INFO L290 TraceCheckUtils]: 113: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,710 INFO L290 TraceCheckUtils]: 114: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,711 INFO L290 TraceCheckUtils]: 115: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,711 INFO L290 TraceCheckUtils]: 116: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,712 INFO L290 TraceCheckUtils]: 117: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,712 INFO L290 TraceCheckUtils]: 118: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,713 INFO L290 TraceCheckUtils]: 119: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,713 INFO L290 TraceCheckUtils]: 120: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,714 INFO L290 TraceCheckUtils]: 121: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,714 INFO L290 TraceCheckUtils]: 122: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,715 INFO L290 TraceCheckUtils]: 123: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,715 INFO L290 TraceCheckUtils]: 124: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,716 INFO L290 TraceCheckUtils]: 125: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,716 INFO L290 TraceCheckUtils]: 126: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,716 INFO L290 TraceCheckUtils]: 127: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,717 INFO L290 TraceCheckUtils]: 128: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:21,717 INFO L290 TraceCheckUtils]: 129: Hoare triple {411769#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {411770#(not (= 8576 |ssl3_accept_#t~mem69|))} is VALID [2022-04-15 11:51:21,718 INFO L290 TraceCheckUtils]: 130: Hoare triple {411770#(not (= 8576 |ssl3_accept_#t~mem69|))} assume 8576 == #t~mem69;havoc #t~mem69; {411765#false} is VALID [2022-04-15 11:51:21,718 INFO L290 TraceCheckUtils]: 131: Hoare triple {411765#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {411765#false} is VALID [2022-04-15 11:51:21,718 INFO L290 TraceCheckUtils]: 132: Hoare triple {411765#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {411765#false} is VALID [2022-04-15 11:51:21,718 INFO L290 TraceCheckUtils]: 133: Hoare triple {411765#false} assume !(~ret~0 <= 0); {411765#false} is VALID [2022-04-15 11:51:21,718 INFO L290 TraceCheckUtils]: 134: Hoare triple {411765#false} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {411765#false} is VALID [2022-04-15 11:51:21,718 INFO L290 TraceCheckUtils]: 135: Hoare triple {411765#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 136: Hoare triple {411765#false} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 137: Hoare triple {411765#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 138: Hoare triple {411765#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 139: Hoare triple {411765#false} ~skip~0 := 0; {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 140: Hoare triple {411765#false} assume !false; {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 141: Hoare triple {411765#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 142: Hoare triple {411765#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 143: Hoare triple {411765#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 144: Hoare triple {411765#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,719 INFO L290 TraceCheckUtils]: 145: Hoare triple {411765#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 146: Hoare triple {411765#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 147: Hoare triple {411765#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 148: Hoare triple {411765#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 149: Hoare triple {411765#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 150: Hoare triple {411765#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 151: Hoare triple {411765#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 152: Hoare triple {411765#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 153: Hoare triple {411765#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 154: Hoare triple {411765#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 155: Hoare triple {411765#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,720 INFO L290 TraceCheckUtils]: 156: Hoare triple {411765#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 157: Hoare triple {411765#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 158: Hoare triple {411765#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 159: Hoare triple {411765#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 160: Hoare triple {411765#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 161: Hoare triple {411765#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 162: Hoare triple {411765#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 163: Hoare triple {411765#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 164: Hoare triple {411765#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 165: Hoare triple {411765#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 166: Hoare triple {411765#false} assume 8592 == #t~mem71;havoc #t~mem71; {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 167: Hoare triple {411765#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {411765#false} is VALID [2022-04-15 11:51:21,721 INFO L290 TraceCheckUtils]: 168: Hoare triple {411765#false} assume !(7 == ~blastFlag~0); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 169: Hoare triple {411765#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 170: Hoare triple {411765#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 171: Hoare triple {411765#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 172: Hoare triple {411765#false} ~skip~0 := 0; {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 173: Hoare triple {411765#false} assume !false; {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 174: Hoare triple {411765#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 175: Hoare triple {411765#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 176: Hoare triple {411765#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 177: Hoare triple {411765#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 178: Hoare triple {411765#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,722 INFO L290 TraceCheckUtils]: 179: Hoare triple {411765#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 180: Hoare triple {411765#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 181: Hoare triple {411765#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 182: Hoare triple {411765#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 183: Hoare triple {411765#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 184: Hoare triple {411765#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 185: Hoare triple {411765#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 186: Hoare triple {411765#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 187: Hoare triple {411765#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 188: Hoare triple {411765#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 189: Hoare triple {411765#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,723 INFO L290 TraceCheckUtils]: 190: Hoare triple {411765#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 191: Hoare triple {411765#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 192: Hoare triple {411765#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 193: Hoare triple {411765#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 194: Hoare triple {411765#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 195: Hoare triple {411765#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 196: Hoare triple {411765#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 197: Hoare triple {411765#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 198: Hoare triple {411765#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 199: Hoare triple {411765#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 200: Hoare triple {411765#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 201: Hoare triple {411765#false} assume 8608 == #t~mem73;havoc #t~mem73; {411765#false} is VALID [2022-04-15 11:51:21,724 INFO L290 TraceCheckUtils]: 202: Hoare triple {411765#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 203: Hoare triple {411765#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 204: Hoare triple {411765#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 205: Hoare triple {411765#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 206: Hoare triple {411765#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 207: Hoare triple {411765#false} ~skip~0 := 0; {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 208: Hoare triple {411765#false} assume !false; {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 209: Hoare triple {411765#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 210: Hoare triple {411765#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 211: Hoare triple {411765#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 212: Hoare triple {411765#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,725 INFO L290 TraceCheckUtils]: 213: Hoare triple {411765#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 214: Hoare triple {411765#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 215: Hoare triple {411765#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 216: Hoare triple {411765#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 217: Hoare triple {411765#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 218: Hoare triple {411765#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 219: Hoare triple {411765#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 220: Hoare triple {411765#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 221: Hoare triple {411765#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 222: Hoare triple {411765#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 223: Hoare triple {411765#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,726 INFO L290 TraceCheckUtils]: 224: Hoare triple {411765#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 225: Hoare triple {411765#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 226: Hoare triple {411765#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 227: Hoare triple {411765#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 228: Hoare triple {411765#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 229: Hoare triple {411765#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 230: Hoare triple {411765#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 231: Hoare triple {411765#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 232: Hoare triple {411765#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 233: Hoare triple {411765#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 234: Hoare triple {411765#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,727 INFO L290 TraceCheckUtils]: 235: Hoare triple {411765#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 236: Hoare triple {411765#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 237: Hoare triple {411765#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 238: Hoare triple {411765#false} assume 8640 == #t~mem75;havoc #t~mem75; {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 239: Hoare triple {411765#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 240: Hoare triple {411765#false} assume !(9 == ~blastFlag~0); {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 241: Hoare triple {411765#false} assume !(12 == ~blastFlag~0); {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 242: Hoare triple {411765#false} assume !(15 == ~blastFlag~0); {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 243: Hoare triple {411765#false} assume !(18 == ~blastFlag~0); {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 244: Hoare triple {411765#false} assume 21 == ~blastFlag~0; {411765#false} is VALID [2022-04-15 11:51:21,728 INFO L290 TraceCheckUtils]: 245: Hoare triple {411765#false} assume !false; {411765#false} is VALID [2022-04-15 11:51:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-04-15 11:51:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:21,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355417106] [2022-04-15 11:51:21,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355417106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:21,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:21,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:21,730 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:21,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305790547] [2022-04-15 11:51:21,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305790547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:21,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:21,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794440652] [2022-04-15 11:51:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:21,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 246 [2022-04-15 11:51:21,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:21,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:21,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:21,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:21,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:21,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:21,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:21,845 INFO L87 Difference]: Start difference. First operand 2335 states and 3358 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:35,145 INFO L93 Difference]: Finished difference Result 5091 states and 7300 transitions. [2022-04-15 11:51:35,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:35,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 246 [2022-04-15 11:51:35,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:35,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:35,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-04-15 11:51:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-04-15 11:51:35,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 634 transitions. [2022-04-15 11:51:35,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:35,858 INFO L225 Difference]: With dead ends: 5091 [2022-04-15 11:51:35,858 INFO L226 Difference]: Without dead ends: 2784 [2022-04-15 11:51:35,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:35,861 INFO L913 BasicCegarLoop]: 169 mSDtfsCounter, 128 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:35,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 470 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 11:51:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2022-04-15 11:51:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2467. [2022-04-15 11:51:36,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:36,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2784 states. Second operand has 2467 states, 2462 states have (on average 1.4321689683184402) internal successors, (3526), 2462 states have internal predecessors, (3526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:36,905 INFO L74 IsIncluded]: Start isIncluded. First operand 2784 states. Second operand has 2467 states, 2462 states have (on average 1.4321689683184402) internal successors, (3526), 2462 states have internal predecessors, (3526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:36,907 INFO L87 Difference]: Start difference. First operand 2784 states. Second operand has 2467 states, 2462 states have (on average 1.4321689683184402) internal successors, (3526), 2462 states have internal predecessors, (3526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:37,091 INFO L93 Difference]: Finished difference Result 2784 states and 3950 transitions. [2022-04-15 11:51:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3950 transitions. [2022-04-15 11:51:37,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:37,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:37,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 2467 states, 2462 states have (on average 1.4321689683184402) internal successors, (3526), 2462 states have internal predecessors, (3526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2784 states. [2022-04-15 11:51:37,095 INFO L87 Difference]: Start difference. First operand has 2467 states, 2462 states have (on average 1.4321689683184402) internal successors, (3526), 2462 states have internal predecessors, (3526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2784 states. [2022-04-15 11:51:37,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:37,284 INFO L93 Difference]: Finished difference Result 2784 states and 3950 transitions. [2022-04-15 11:51:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3950 transitions. [2022-04-15 11:51:37,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:37,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:37,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:37,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2462 states have (on average 1.4321689683184402) internal successors, (3526), 2462 states have internal predecessors, (3526), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3530 transitions. [2022-04-15 11:51:37,539 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3530 transitions. Word has length 246 [2022-04-15 11:51:37,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:37,539 INFO L478 AbstractCegarLoop]: Abstraction has 2467 states and 3530 transitions. [2022-04-15 11:51:37,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:37,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2467 states and 3530 transitions. [2022-04-15 11:51:41,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3530 edges. 3530 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3530 transitions. [2022-04-15 11:51:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-04-15 11:51:41,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:41,736 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:41,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-15 11:51:41,736 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1659185772, now seen corresponding path program 1 times [2022-04-15 11:51:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893807552] [2022-04-15 11:51:41,966 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:41,966 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:41,966 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1659185772, now seen corresponding path program 2 times [2022-04-15 11:51:41,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:41,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509056328] [2022-04-15 11:51:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:41,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:42,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {432467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {432460#true} is VALID [2022-04-15 11:51:42,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {432460#true} assume true; {432460#true} is VALID [2022-04-15 11:51:42,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {432460#true} {432460#true} #755#return; {432460#true} is VALID [2022-04-15 11:51:42,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {432460#true} call ULTIMATE.init(); {432467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:51:42,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {432467#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {432460#true} assume true; {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432460#true} {432460#true} #755#return; {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {432460#true} call #t~ret161 := main(); {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {432460#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {432460#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L272 TraceCheckUtils]: 7: Hoare triple {432460#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {432460#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {432460#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {432460#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {432460#true} is VALID [2022-04-15 11:51:42,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {432460#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {432460#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {432460#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {432460#true} assume !false; {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {432460#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {432460#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {432460#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {432460#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {432460#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {432460#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {432460#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {432460#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {432460#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {432460#true} assume 8464 == #t~mem55;havoc #t~mem55; {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {432460#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {432460#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {432460#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {432460#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {432460#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {432460#true} ~skip~0 := 0; {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {432460#true} assume !false; {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {432460#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {432460#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 34: Hoare triple {432460#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 35: Hoare triple {432460#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 36: Hoare triple {432460#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 37: Hoare triple {432460#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 38: Hoare triple {432460#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {432460#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {432460#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {432460#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {432460#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {432460#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {432460#true} assume 8496 == #t~mem58;havoc #t~mem58; {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 45: Hoare triple {432460#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 46: Hoare triple {432460#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 47: Hoare triple {432460#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 48: Hoare triple {432460#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 49: Hoare triple {432460#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 50: Hoare triple {432460#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 51: Hoare triple {432460#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {432460#true} ~skip~0 := 0; {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 53: Hoare triple {432460#true} assume !false; {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 54: Hoare triple {432460#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,152 INFO L290 TraceCheckUtils]: 55: Hoare triple {432460#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 56: Hoare triple {432460#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 57: Hoare triple {432460#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {432460#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {432460#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {432460#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {432460#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 62: Hoare triple {432460#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 63: Hoare triple {432460#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 64: Hoare triple {432460#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 65: Hoare triple {432460#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 66: Hoare triple {432460#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,153 INFO L290 TraceCheckUtils]: 67: Hoare triple {432460#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {432460#true} assume 8512 == #t~mem60;havoc #t~mem60; {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {432460#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 70: Hoare triple {432460#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 71: Hoare triple {432460#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 72: Hoare triple {432460#true} assume !(~ret~0 <= 0); {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 73: Hoare triple {432460#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 74: Hoare triple {432460#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 75: Hoare triple {432460#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 76: Hoare triple {432460#true} ~skip~0 := 0; {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 77: Hoare triple {432460#true} assume !false; {432460#true} is VALID [2022-04-15 11:51:42,154 INFO L290 TraceCheckUtils]: 78: Hoare triple {432460#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 79: Hoare triple {432460#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 80: Hoare triple {432460#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 81: Hoare triple {432460#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 82: Hoare triple {432460#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 83: Hoare triple {432460#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 84: Hoare triple {432460#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {432460#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {432460#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 87: Hoare triple {432460#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {432460#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {432460#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 90: Hoare triple {432460#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 91: Hoare triple {432460#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 92: Hoare triple {432460#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 93: Hoare triple {432460#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 94: Hoare triple {432460#true} assume 8528 == #t~mem62;havoc #t~mem62; {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 95: Hoare triple {432460#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 96: Hoare triple {432460#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {432460#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 98: Hoare triple {432460#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 99: Hoare triple {432460#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {432460#true} is VALID [2022-04-15 11:51:42,156 INFO L290 TraceCheckUtils]: 100: Hoare triple {432460#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {432460#true} is VALID [2022-04-15 11:51:42,157 INFO L290 TraceCheckUtils]: 101: Hoare triple {432460#true} assume !(~ret~0 <= 0); {432460#true} is VALID [2022-04-15 11:51:42,158 INFO L290 TraceCheckUtils]: 102: Hoare triple {432460#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,158 INFO L290 TraceCheckUtils]: 103: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,159 INFO L290 TraceCheckUtils]: 104: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,159 INFO L290 TraceCheckUtils]: 105: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,160 INFO L290 TraceCheckUtils]: 106: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,160 INFO L290 TraceCheckUtils]: 107: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,161 INFO L290 TraceCheckUtils]: 108: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,161 INFO L290 TraceCheckUtils]: 109: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,162 INFO L290 TraceCheckUtils]: 110: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,162 INFO L290 TraceCheckUtils]: 111: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,163 INFO L290 TraceCheckUtils]: 112: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,163 INFO L290 TraceCheckUtils]: 113: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,164 INFO L290 TraceCheckUtils]: 114: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,164 INFO L290 TraceCheckUtils]: 115: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,165 INFO L290 TraceCheckUtils]: 116: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,165 INFO L290 TraceCheckUtils]: 117: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,166 INFO L290 TraceCheckUtils]: 118: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,166 INFO L290 TraceCheckUtils]: 119: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,167 INFO L290 TraceCheckUtils]: 120: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,167 INFO L290 TraceCheckUtils]: 121: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,168 INFO L290 TraceCheckUtils]: 122: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,168 INFO L290 TraceCheckUtils]: 123: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,168 INFO L290 TraceCheckUtils]: 124: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,169 INFO L290 TraceCheckUtils]: 125: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,169 INFO L290 TraceCheckUtils]: 126: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,170 INFO L290 TraceCheckUtils]: 127: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,170 INFO L290 TraceCheckUtils]: 128: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,171 INFO L290 TraceCheckUtils]: 129: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:42,171 INFO L290 TraceCheckUtils]: 130: Hoare triple {432465#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {432466#(not (= |ssl3_accept_#t~mem70| 8577))} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 131: Hoare triple {432466#(not (= |ssl3_accept_#t~mem70| 8577))} assume 8577 == #t~mem70;havoc #t~mem70; {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 132: Hoare triple {432461#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 133: Hoare triple {432461#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 134: Hoare triple {432461#false} assume !(~ret~0 <= 0); {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 135: Hoare triple {432461#false} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 136: Hoare triple {432461#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 137: Hoare triple {432461#false} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 138: Hoare triple {432461#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 139: Hoare triple {432461#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {432461#false} is VALID [2022-04-15 11:51:42,172 INFO L290 TraceCheckUtils]: 140: Hoare triple {432461#false} ~skip~0 := 0; {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 141: Hoare triple {432461#false} assume !false; {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 142: Hoare triple {432461#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 143: Hoare triple {432461#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 144: Hoare triple {432461#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 145: Hoare triple {432461#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 146: Hoare triple {432461#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 147: Hoare triple {432461#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 148: Hoare triple {432461#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 149: Hoare triple {432461#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 150: Hoare triple {432461#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,173 INFO L290 TraceCheckUtils]: 151: Hoare triple {432461#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 152: Hoare triple {432461#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 153: Hoare triple {432461#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 154: Hoare triple {432461#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 155: Hoare triple {432461#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 156: Hoare triple {432461#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 157: Hoare triple {432461#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 158: Hoare triple {432461#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 159: Hoare triple {432461#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 160: Hoare triple {432461#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 161: Hoare triple {432461#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 162: Hoare triple {432461#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,174 INFO L290 TraceCheckUtils]: 163: Hoare triple {432461#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 164: Hoare triple {432461#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 165: Hoare triple {432461#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 166: Hoare triple {432461#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 167: Hoare triple {432461#false} assume 8592 == #t~mem71;havoc #t~mem71; {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 168: Hoare triple {432461#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 169: Hoare triple {432461#false} assume !(7 == ~blastFlag~0); {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 170: Hoare triple {432461#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 171: Hoare triple {432461#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 172: Hoare triple {432461#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 173: Hoare triple {432461#false} ~skip~0 := 0; {432461#false} is VALID [2022-04-15 11:51:42,175 INFO L290 TraceCheckUtils]: 174: Hoare triple {432461#false} assume !false; {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 175: Hoare triple {432461#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 176: Hoare triple {432461#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 177: Hoare triple {432461#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 178: Hoare triple {432461#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 179: Hoare triple {432461#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 180: Hoare triple {432461#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 181: Hoare triple {432461#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 182: Hoare triple {432461#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 183: Hoare triple {432461#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 184: Hoare triple {432461#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 185: Hoare triple {432461#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,176 INFO L290 TraceCheckUtils]: 186: Hoare triple {432461#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 187: Hoare triple {432461#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 188: Hoare triple {432461#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 189: Hoare triple {432461#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 190: Hoare triple {432461#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 191: Hoare triple {432461#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 192: Hoare triple {432461#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 193: Hoare triple {432461#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 194: Hoare triple {432461#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 195: Hoare triple {432461#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 196: Hoare triple {432461#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,177 INFO L290 TraceCheckUtils]: 197: Hoare triple {432461#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 198: Hoare triple {432461#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 199: Hoare triple {432461#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 200: Hoare triple {432461#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 201: Hoare triple {432461#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 202: Hoare triple {432461#false} assume 8608 == #t~mem73;havoc #t~mem73; {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 203: Hoare triple {432461#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 204: Hoare triple {432461#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 205: Hoare triple {432461#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 206: Hoare triple {432461#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 207: Hoare triple {432461#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 208: Hoare triple {432461#false} ~skip~0 := 0; {432461#false} is VALID [2022-04-15 11:51:42,178 INFO L290 TraceCheckUtils]: 209: Hoare triple {432461#false} assume !false; {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 210: Hoare triple {432461#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 211: Hoare triple {432461#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 212: Hoare triple {432461#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 213: Hoare triple {432461#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 214: Hoare triple {432461#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 215: Hoare triple {432461#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 216: Hoare triple {432461#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 217: Hoare triple {432461#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 218: Hoare triple {432461#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 219: Hoare triple {432461#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,179 INFO L290 TraceCheckUtils]: 220: Hoare triple {432461#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 221: Hoare triple {432461#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 222: Hoare triple {432461#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 223: Hoare triple {432461#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 224: Hoare triple {432461#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 225: Hoare triple {432461#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 226: Hoare triple {432461#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 227: Hoare triple {432461#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 228: Hoare triple {432461#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 229: Hoare triple {432461#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 230: Hoare triple {432461#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,180 INFO L290 TraceCheckUtils]: 231: Hoare triple {432461#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 232: Hoare triple {432461#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 233: Hoare triple {432461#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 234: Hoare triple {432461#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 235: Hoare triple {432461#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 236: Hoare triple {432461#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 237: Hoare triple {432461#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 238: Hoare triple {432461#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 239: Hoare triple {432461#false} assume 8640 == #t~mem75;havoc #t~mem75; {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 240: Hoare triple {432461#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 241: Hoare triple {432461#false} assume !(9 == ~blastFlag~0); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 242: Hoare triple {432461#false} assume !(12 == ~blastFlag~0); {432461#false} is VALID [2022-04-15 11:51:42,181 INFO L290 TraceCheckUtils]: 243: Hoare triple {432461#false} assume !(15 == ~blastFlag~0); {432461#false} is VALID [2022-04-15 11:51:42,182 INFO L290 TraceCheckUtils]: 244: Hoare triple {432461#false} assume !(18 == ~blastFlag~0); {432461#false} is VALID [2022-04-15 11:51:42,182 INFO L290 TraceCheckUtils]: 245: Hoare triple {432461#false} assume 21 == ~blastFlag~0; {432461#false} is VALID [2022-04-15 11:51:42,182 INFO L290 TraceCheckUtils]: 246: Hoare triple {432461#false} assume !false; {432461#false} is VALID [2022-04-15 11:51:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-04-15 11:51:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:42,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509056328] [2022-04-15 11:51:42,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509056328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:42,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:42,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:42,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:42,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893807552] [2022-04-15 11:51:42,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893807552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:42,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:42,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441255047] [2022-04-15 11:51:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:42,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 247 [2022-04-15 11:51:42,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:42,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:42,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:42,299 INFO L87 Difference]: Start difference. First operand 2467 states and 3530 transitions. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:45,309 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-15 11:51:55,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:55,470 INFO L93 Difference]: Finished difference Result 5187 states and 7404 transitions. [2022-04-15 11:51:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 247 [2022-04-15 11:51:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-04-15 11:51:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-04-15 11:51:55,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 634 transitions. [2022-04-15 11:51:55,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:56,172 INFO L225 Difference]: With dead ends: 5187 [2022-04-15 11:51:56,173 INFO L226 Difference]: Without dead ends: 2748 [2022-04-15 11:51:56,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:56,175 INFO L913 BasicCegarLoop]: 172 mSDtfsCounter, 127 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:56,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 476 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 11:51:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2022-04-15 11:51:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2467. [2022-04-15 11:51:57,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:57,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2748 states. Second operand has 2467 states, 2462 states have (on average 1.4224207961007311) internal successors, (3502), 2462 states have internal predecessors, (3502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:57,205 INFO L74 IsIncluded]: Start isIncluded. First operand 2748 states. Second operand has 2467 states, 2462 states have (on average 1.4224207961007311) internal successors, (3502), 2462 states have internal predecessors, (3502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:57,206 INFO L87 Difference]: Start difference. First operand 2748 states. Second operand has 2467 states, 2462 states have (on average 1.4224207961007311) internal successors, (3502), 2462 states have internal predecessors, (3502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:57,390 INFO L93 Difference]: Finished difference Result 2748 states and 3882 transitions. [2022-04-15 11:51:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3882 transitions. [2022-04-15 11:51:57,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:57,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:57,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 2467 states, 2462 states have (on average 1.4224207961007311) internal successors, (3502), 2462 states have internal predecessors, (3502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2748 states. [2022-04-15 11:51:57,394 INFO L87 Difference]: Start difference. First operand has 2467 states, 2462 states have (on average 1.4224207961007311) internal successors, (3502), 2462 states have internal predecessors, (3502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2748 states. [2022-04-15 11:51:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:57,582 INFO L93 Difference]: Finished difference Result 2748 states and 3882 transitions. [2022-04-15 11:51:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3882 transitions. [2022-04-15 11:51:57,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:57,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:57,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:57,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:57,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2462 states have (on average 1.4224207961007311) internal successors, (3502), 2462 states have internal predecessors, (3502), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3506 transitions. [2022-04-15 11:51:57,842 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3506 transitions. Word has length 247 [2022-04-15 11:51:57,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:57,842 INFO L478 AbstractCegarLoop]: Abstraction has 2467 states and 3506 transitions. [2022-04-15 11:51:57,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:57,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2467 states and 3506 transitions. [2022-04-15 11:52:02,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3506 edges. 3506 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3506 transitions. [2022-04-15 11:52:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-04-15 11:52:02,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:02,095 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:52:02,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-15 11:52:02,095 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:02,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:02,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1024902064, now seen corresponding path program 1 times [2022-04-15 11:52:02,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:02,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465507686] [2022-04-15 11:52:02,392 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:02,392 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:02,392 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1024902064, now seen corresponding path program 2 times [2022-04-15 11:52:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:02,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862470687] [2022-04-15 11:52:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:02,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:02,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {453282#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {453276#true} is VALID [2022-04-15 11:52:02,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {453276#true} assume true; {453276#true} is VALID [2022-04-15 11:52:02,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453276#true} {453276#true} #755#return; {453276#true} is VALID [2022-04-15 11:52:02,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {453276#true} call ULTIMATE.init(); {453282#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:52:02,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {453282#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {453276#true} is VALID [2022-04-15 11:52:02,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {453276#true} assume true; {453276#true} is VALID [2022-04-15 11:52:02,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453276#true} {453276#true} #755#return; {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {453276#true} call #t~ret161 := main(); {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {453276#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {453276#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L272 TraceCheckUtils]: 7: Hoare triple {453276#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {453276#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {453276#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {453276#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {453276#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {453276#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {453276#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {453276#true} is VALID [2022-04-15 11:52:02,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {453276#true} assume !false; {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {453276#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {453276#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {453276#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {453276#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {453276#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {453276#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {453276#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {453276#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {453276#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {453276#true} assume 8464 == #t~mem55;havoc #t~mem55; {453276#true} is VALID [2022-04-15 11:52:02,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {453276#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {453276#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {453276#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {453276#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {453276#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {453276#true} ~skip~0 := 0; {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {453276#true} assume !false; {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {453276#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {453276#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {453276#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {453276#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {453276#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {453276#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {453276#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {453276#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {453276#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {453276#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {453276#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {453276#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {453276#true} assume 8496 == #t~mem58;havoc #t~mem58; {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {453276#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {453276#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {453276#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {453276#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {453276#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {453276#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {453276#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {453276#true} ~skip~0 := 0; {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {453276#true} assume !false; {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {453276#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {453276#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {453276#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {453276#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {453276#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {453276#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {453276#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {453276#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {453276#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {453276#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {453276#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {453276#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {453276#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {453276#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {453276#true} assume 8512 == #t~mem60;havoc #t~mem60; {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 69: Hoare triple {453276#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,584 INFO L290 TraceCheckUtils]: 70: Hoare triple {453276#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {453276#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {453276#true} assume !(~ret~0 <= 0); {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 73: Hoare triple {453276#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 74: Hoare triple {453276#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {453276#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {453276#true} ~skip~0 := 0; {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {453276#true} assume !false; {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 78: Hoare triple {453276#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 79: Hoare triple {453276#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 80: Hoare triple {453276#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,585 INFO L290 TraceCheckUtils]: 81: Hoare triple {453276#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 82: Hoare triple {453276#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 83: Hoare triple {453276#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {453276#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 85: Hoare triple {453276#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 86: Hoare triple {453276#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 87: Hoare triple {453276#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {453276#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {453276#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 90: Hoare triple {453276#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 91: Hoare triple {453276#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,586 INFO L290 TraceCheckUtils]: 92: Hoare triple {453276#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {453276#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 94: Hoare triple {453276#true} assume 8528 == #t~mem62;havoc #t~mem62; {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 95: Hoare triple {453276#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 96: Hoare triple {453276#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {453276#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {453276#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 99: Hoare triple {453276#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 100: Hoare triple {453276#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 101: Hoare triple {453276#true} assume !(~ret~0 <= 0); {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 102: Hoare triple {453276#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,587 INFO L290 TraceCheckUtils]: 103: Hoare triple {453276#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 104: Hoare triple {453276#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 105: Hoare triple {453276#true} ~skip~0 := 0; {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 106: Hoare triple {453276#true} assume !false; {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 107: Hoare triple {453276#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 108: Hoare triple {453276#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 109: Hoare triple {453276#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 110: Hoare triple {453276#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 111: Hoare triple {453276#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 112: Hoare triple {453276#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,588 INFO L290 TraceCheckUtils]: 113: Hoare triple {453276#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 114: Hoare triple {453276#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 115: Hoare triple {453276#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 116: Hoare triple {453276#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 117: Hoare triple {453276#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 118: Hoare triple {453276#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 119: Hoare triple {453276#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 120: Hoare triple {453276#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 121: Hoare triple {453276#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 122: Hoare triple {453276#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 123: Hoare triple {453276#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,589 INFO L290 TraceCheckUtils]: 124: Hoare triple {453276#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 125: Hoare triple {453276#true} assume 8544 == #t~mem64;havoc #t~mem64; {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 126: Hoare triple {453276#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 127: Hoare triple {453276#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 128: Hoare triple {453276#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 129: Hoare triple {453276#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 130: Hoare triple {453276#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 131: Hoare triple {453276#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 132: Hoare triple {453276#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 133: Hoare triple {453276#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,590 INFO L290 TraceCheckUtils]: 134: Hoare triple {453276#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 135: Hoare triple {453276#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 136: Hoare triple {453276#true} ~skip~0 := 0; {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 137: Hoare triple {453276#true} assume !false; {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 138: Hoare triple {453276#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 139: Hoare triple {453276#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 140: Hoare triple {453276#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 141: Hoare triple {453276#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 142: Hoare triple {453276#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 143: Hoare triple {453276#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,591 INFO L290 TraceCheckUtils]: 144: Hoare triple {453276#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 145: Hoare triple {453276#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 146: Hoare triple {453276#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 147: Hoare triple {453276#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 148: Hoare triple {453276#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 149: Hoare triple {453276#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 150: Hoare triple {453276#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 151: Hoare triple {453276#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 152: Hoare triple {453276#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 153: Hoare triple {453276#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 154: Hoare triple {453276#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,592 INFO L290 TraceCheckUtils]: 155: Hoare triple {453276#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 156: Hoare triple {453276#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 157: Hoare triple {453276#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 158: Hoare triple {453276#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 159: Hoare triple {453276#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 160: Hoare triple {453276#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 161: Hoare triple {453276#true} assume 8576 == #t~mem69;havoc #t~mem69; {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 162: Hoare triple {453276#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 163: Hoare triple {453276#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {453276#true} is VALID [2022-04-15 11:52:02,593 INFO L290 TraceCheckUtils]: 164: Hoare triple {453276#true} assume !(~ret~0 <= 0); {453276#true} is VALID [2022-04-15 11:52:02,594 INFO L290 TraceCheckUtils]: 165: Hoare triple {453276#true} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {453276#true} is VALID [2022-04-15 11:52:02,594 INFO L290 TraceCheckUtils]: 166: Hoare triple {453276#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,594 INFO L290 TraceCheckUtils]: 167: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,595 INFO L290 TraceCheckUtils]: 168: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,595 INFO L290 TraceCheckUtils]: 169: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,596 INFO L290 TraceCheckUtils]: 170: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} ~skip~0 := 0; {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,596 INFO L290 TraceCheckUtils]: 171: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !false; {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,596 INFO L290 TraceCheckUtils]: 172: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,597 INFO L290 TraceCheckUtils]: 173: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,597 INFO L290 TraceCheckUtils]: 174: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,597 INFO L290 TraceCheckUtils]: 175: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,598 INFO L290 TraceCheckUtils]: 176: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,598 INFO L290 TraceCheckUtils]: 177: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,598 INFO L290 TraceCheckUtils]: 178: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,599 INFO L290 TraceCheckUtils]: 179: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,599 INFO L290 TraceCheckUtils]: 180: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,599 INFO L290 TraceCheckUtils]: 181: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,600 INFO L290 TraceCheckUtils]: 182: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,600 INFO L290 TraceCheckUtils]: 183: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,600 INFO L290 TraceCheckUtils]: 184: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,601 INFO L290 TraceCheckUtils]: 185: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,601 INFO L290 TraceCheckUtils]: 186: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,601 INFO L290 TraceCheckUtils]: 187: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,602 INFO L290 TraceCheckUtils]: 188: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,602 INFO L290 TraceCheckUtils]: 189: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,602 INFO L290 TraceCheckUtils]: 190: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,602 INFO L290 TraceCheckUtils]: 191: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,603 INFO L290 TraceCheckUtils]: 192: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,603 INFO L290 TraceCheckUtils]: 193: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,603 INFO L290 TraceCheckUtils]: 194: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,604 INFO L290 TraceCheckUtils]: 195: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,604 INFO L290 TraceCheckUtils]: 196: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,604 INFO L290 TraceCheckUtils]: 197: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume 8592 == #t~mem71;havoc #t~mem71; {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,605 INFO L290 TraceCheckUtils]: 198: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:02,605 INFO L290 TraceCheckUtils]: 199: Hoare triple {453281#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(7 == ~blastFlag~0); {453277#false} is VALID [2022-04-15 11:52:02,605 INFO L290 TraceCheckUtils]: 200: Hoare triple {453277#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,605 INFO L290 TraceCheckUtils]: 201: Hoare triple {453277#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,605 INFO L290 TraceCheckUtils]: 202: Hoare triple {453277#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453277#false} is VALID [2022-04-15 11:52:02,605 INFO L290 TraceCheckUtils]: 203: Hoare triple {453277#false} ~skip~0 := 0; {453277#false} is VALID [2022-04-15 11:52:02,605 INFO L290 TraceCheckUtils]: 204: Hoare triple {453277#false} assume !false; {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 205: Hoare triple {453277#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 206: Hoare triple {453277#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 207: Hoare triple {453277#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 208: Hoare triple {453277#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 209: Hoare triple {453277#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 210: Hoare triple {453277#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 211: Hoare triple {453277#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 212: Hoare triple {453277#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 213: Hoare triple {453277#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 214: Hoare triple {453277#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,606 INFO L290 TraceCheckUtils]: 215: Hoare triple {453277#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 216: Hoare triple {453277#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 217: Hoare triple {453277#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 218: Hoare triple {453277#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 219: Hoare triple {453277#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 220: Hoare triple {453277#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 221: Hoare triple {453277#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 222: Hoare triple {453277#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 223: Hoare triple {453277#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 224: Hoare triple {453277#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 225: Hoare triple {453277#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,607 INFO L290 TraceCheckUtils]: 226: Hoare triple {453277#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 227: Hoare triple {453277#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 228: Hoare triple {453277#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 229: Hoare triple {453277#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 230: Hoare triple {453277#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 231: Hoare triple {453277#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 232: Hoare triple {453277#false} assume 8608 == #t~mem73;havoc #t~mem73; {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 233: Hoare triple {453277#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 234: Hoare triple {453277#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 235: Hoare triple {453277#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 236: Hoare triple {453277#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,608 INFO L290 TraceCheckUtils]: 237: Hoare triple {453277#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 238: Hoare triple {453277#false} ~skip~0 := 0; {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 239: Hoare triple {453277#false} assume !false; {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 240: Hoare triple {453277#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 241: Hoare triple {453277#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 242: Hoare triple {453277#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 243: Hoare triple {453277#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 244: Hoare triple {453277#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 245: Hoare triple {453277#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 246: Hoare triple {453277#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 247: Hoare triple {453277#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,609 INFO L290 TraceCheckUtils]: 248: Hoare triple {453277#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 249: Hoare triple {453277#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 250: Hoare triple {453277#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 251: Hoare triple {453277#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 252: Hoare triple {453277#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 253: Hoare triple {453277#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 254: Hoare triple {453277#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 255: Hoare triple {453277#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 256: Hoare triple {453277#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 257: Hoare triple {453277#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,610 INFO L290 TraceCheckUtils]: 258: Hoare triple {453277#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 259: Hoare triple {453277#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 260: Hoare triple {453277#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 261: Hoare triple {453277#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 262: Hoare triple {453277#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 263: Hoare triple {453277#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 264: Hoare triple {453277#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 265: Hoare triple {453277#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 266: Hoare triple {453277#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 267: Hoare triple {453277#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 268: Hoare triple {453277#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 269: Hoare triple {453277#false} assume 8640 == #t~mem75;havoc #t~mem75; {453277#false} is VALID [2022-04-15 11:52:02,611 INFO L290 TraceCheckUtils]: 270: Hoare triple {453277#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {453277#false} is VALID [2022-04-15 11:52:02,612 INFO L290 TraceCheckUtils]: 271: Hoare triple {453277#false} assume !(9 == ~blastFlag~0); {453277#false} is VALID [2022-04-15 11:52:02,612 INFO L290 TraceCheckUtils]: 272: Hoare triple {453277#false} assume !(12 == ~blastFlag~0); {453277#false} is VALID [2022-04-15 11:52:02,612 INFO L290 TraceCheckUtils]: 273: Hoare triple {453277#false} assume !(15 == ~blastFlag~0); {453277#false} is VALID [2022-04-15 11:52:02,612 INFO L290 TraceCheckUtils]: 274: Hoare triple {453277#false} assume !(18 == ~blastFlag~0); {453277#false} is VALID [2022-04-15 11:52:02,612 INFO L290 TraceCheckUtils]: 275: Hoare triple {453277#false} assume 21 == ~blastFlag~0; {453277#false} is VALID [2022-04-15 11:52:02,612 INFO L290 TraceCheckUtils]: 276: Hoare triple {453277#false} assume !false; {453277#false} is VALID [2022-04-15 11:52:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2022-04-15 11:52:02,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:02,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862470687] [2022-04-15 11:52:02,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862470687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:02,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:02,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:52:02,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:02,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1465507686] [2022-04-15 11:52:02,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1465507686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:02,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:02,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:52:02,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363724214] [2022-04-15 11:52:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:02,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 277 [2022-04-15 11:52:02,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:02,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:02,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:02,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:52:02,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:52:02,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:52:02,747 INFO L87 Difference]: Start difference. First operand 2467 states and 3506 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:06,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:12,168 INFO L93 Difference]: Finished difference Result 5471 states and 7802 transitions. [2022-04-15 11:52:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:52:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 277 [2022-04-15 11:52:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:52:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:52:12,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 677 transitions. [2022-04-15 11:52:12,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:12,940 INFO L225 Difference]: With dead ends: 5471 [2022-04-15 11:52:12,940 INFO L226 Difference]: Without dead ends: 3032 [2022-04-15 11:52:12,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:52:12,943 INFO L913 BasicCegarLoop]: 409 mSDtfsCounter, 163 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:12,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 603 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 11:52:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2022-04-15 11:52:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 3032. [2022-04-15 11:52:14,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:14,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3032 states. Second operand has 3032 states, 3027 states have (on average 1.421209117938553) internal successors, (4302), 3027 states have internal predecessors, (4302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:14,032 INFO L74 IsIncluded]: Start isIncluded. First operand 3032 states. Second operand has 3032 states, 3027 states have (on average 1.421209117938553) internal successors, (4302), 3027 states have internal predecessors, (4302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:14,033 INFO L87 Difference]: Start difference. First operand 3032 states. Second operand has 3032 states, 3027 states have (on average 1.421209117938553) internal successors, (4302), 3027 states have internal predecessors, (4302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:14,258 INFO L93 Difference]: Finished difference Result 3032 states and 4306 transitions. [2022-04-15 11:52:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4306 transitions. [2022-04-15 11:52:14,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:14,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:14,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 3032 states, 3027 states have (on average 1.421209117938553) internal successors, (4302), 3027 states have internal predecessors, (4302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3032 states. [2022-04-15 11:52:14,266 INFO L87 Difference]: Start difference. First operand has 3032 states, 3027 states have (on average 1.421209117938553) internal successors, (4302), 3027 states have internal predecessors, (4302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3032 states. [2022-04-15 11:52:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:14,509 INFO L93 Difference]: Finished difference Result 3032 states and 4306 transitions. [2022-04-15 11:52:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4306 transitions. [2022-04-15 11:52:14,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:14,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:14,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:14,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3027 states have (on average 1.421209117938553) internal successors, (4302), 3027 states have internal predecessors, (4302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 4306 transitions. [2022-04-15 11:52:14,901 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 4306 transitions. Word has length 277 [2022-04-15 11:52:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:14,901 INFO L478 AbstractCegarLoop]: Abstraction has 3032 states and 4306 transitions. [2022-04-15 11:52:14,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:14,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3032 states and 4306 transitions. [2022-04-15 11:52:20,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4306 edges. 4306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 4306 transitions. [2022-04-15 11:52:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-04-15 11:52:20,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:20,102 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:52:20,102 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-15 11:52:20,103 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1863935726, now seen corresponding path program 1 times [2022-04-15 11:52:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:20,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323952319] [2022-04-15 11:52:20,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:20,379 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:20,379 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1863935726, now seen corresponding path program 2 times [2022-04-15 11:52:20,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:20,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106421618] [2022-04-15 11:52:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:20,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:20,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {476361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {476355#true} is VALID [2022-04-15 11:52:20,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {476355#true} assume true; {476355#true} is VALID [2022-04-15 11:52:20,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {476355#true} {476355#true} #755#return; {476355#true} is VALID [2022-04-15 11:52:20,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {476355#true} call ULTIMATE.init(); {476361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:52:20,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {476361#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {476355#true} assume true; {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {476355#true} {476355#true} #755#return; {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {476355#true} call #t~ret161 := main(); {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {476355#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {476355#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L272 TraceCheckUtils]: 7: Hoare triple {476355#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {476355#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {476355#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {476355#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {476355#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {476355#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {476355#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {476355#true} assume 8464 == #t~mem55;havoc #t~mem55; {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {476355#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {476355#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {476355#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {476355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {476355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 30: Hoare triple {476355#true} ~skip~0 := 0; {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 36: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {476355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {476355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 43: Hoare triple {476355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 44: Hoare triple {476355#true} assume 8496 == #t~mem58;havoc #t~mem58; {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 45: Hoare triple {476355#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 46: Hoare triple {476355#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {476355#true} is VALID [2022-04-15 11:52:20,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {476355#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 48: Hoare triple {476355#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {476355#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {476355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {476355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 52: Hoare triple {476355#true} ~skip~0 := 0; {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 53: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 55: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 56: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 57: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,583 INFO L290 TraceCheckUtils]: 58: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 59: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 62: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 63: Hoare triple {476355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {476355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {476355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 66: Hoare triple {476355#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 67: Hoare triple {476355#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,584 INFO L290 TraceCheckUtils]: 68: Hoare triple {476355#true} assume 8512 == #t~mem60;havoc #t~mem60; {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 69: Hoare triple {476355#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 70: Hoare triple {476355#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 71: Hoare triple {476355#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 72: Hoare triple {476355#true} assume !(~ret~0 <= 0); {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 73: Hoare triple {476355#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 74: Hoare triple {476355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 75: Hoare triple {476355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 76: Hoare triple {476355#true} ~skip~0 := 0; {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 77: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 78: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,585 INFO L290 TraceCheckUtils]: 79: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 81: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 82: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 83: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 84: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 85: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 86: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 87: Hoare triple {476355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {476355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {476355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,586 INFO L290 TraceCheckUtils]: 90: Hoare triple {476355#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 91: Hoare triple {476355#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 92: Hoare triple {476355#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 93: Hoare triple {476355#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 94: Hoare triple {476355#true} assume 8528 == #t~mem62;havoc #t~mem62; {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 95: Hoare triple {476355#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 96: Hoare triple {476355#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 97: Hoare triple {476355#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 98: Hoare triple {476355#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 99: Hoare triple {476355#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {476355#true} is VALID [2022-04-15 11:52:20,587 INFO L290 TraceCheckUtils]: 100: Hoare triple {476355#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 101: Hoare triple {476355#true} assume !(~ret~0 <= 0); {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 102: Hoare triple {476355#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 103: Hoare triple {476355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 104: Hoare triple {476355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 105: Hoare triple {476355#true} ~skip~0 := 0; {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 106: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 107: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 108: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 109: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 110: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,588 INFO L290 TraceCheckUtils]: 111: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 112: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 113: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 114: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 115: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 116: Hoare triple {476355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 117: Hoare triple {476355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 118: Hoare triple {476355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 119: Hoare triple {476355#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 120: Hoare triple {476355#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 121: Hoare triple {476355#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,589 INFO L290 TraceCheckUtils]: 122: Hoare triple {476355#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 123: Hoare triple {476355#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 124: Hoare triple {476355#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 125: Hoare triple {476355#true} assume 8544 == #t~mem64;havoc #t~mem64; {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 126: Hoare triple {476355#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 127: Hoare triple {476355#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 128: Hoare triple {476355#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 129: Hoare triple {476355#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 130: Hoare triple {476355#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 131: Hoare triple {476355#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 132: Hoare triple {476355#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {476355#true} is VALID [2022-04-15 11:52:20,590 INFO L290 TraceCheckUtils]: 133: Hoare triple {476355#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 134: Hoare triple {476355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 135: Hoare triple {476355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 136: Hoare triple {476355#true} ~skip~0 := 0; {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 137: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 138: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 139: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 140: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 141: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 142: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,591 INFO L290 TraceCheckUtils]: 143: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 144: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 145: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 146: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 147: Hoare triple {476355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 148: Hoare triple {476355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 149: Hoare triple {476355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 150: Hoare triple {476355#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 151: Hoare triple {476355#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 152: Hoare triple {476355#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 153: Hoare triple {476355#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,592 INFO L290 TraceCheckUtils]: 154: Hoare triple {476355#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 155: Hoare triple {476355#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 156: Hoare triple {476355#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 157: Hoare triple {476355#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 158: Hoare triple {476355#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 159: Hoare triple {476355#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 160: Hoare triple {476355#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 161: Hoare triple {476355#true} assume 8576 == #t~mem69;havoc #t~mem69; {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 162: Hoare triple {476355#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 163: Hoare triple {476355#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 164: Hoare triple {476355#true} assume !(~ret~0 <= 0); {476355#true} is VALID [2022-04-15 11:52:20,593 INFO L290 TraceCheckUtils]: 165: Hoare triple {476355#true} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 166: Hoare triple {476355#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 167: Hoare triple {476355#true} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 168: Hoare triple {476355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 169: Hoare triple {476355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 170: Hoare triple {476355#true} ~skip~0 := 0; {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 171: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 172: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 173: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 174: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,594 INFO L290 TraceCheckUtils]: 175: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 176: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 177: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 178: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 179: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 180: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 181: Hoare triple {476355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 182: Hoare triple {476355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 183: Hoare triple {476355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 184: Hoare triple {476355#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 185: Hoare triple {476355#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,595 INFO L290 TraceCheckUtils]: 186: Hoare triple {476355#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 187: Hoare triple {476355#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 188: Hoare triple {476355#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 189: Hoare triple {476355#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 190: Hoare triple {476355#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 191: Hoare triple {476355#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 192: Hoare triple {476355#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 193: Hoare triple {476355#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 194: Hoare triple {476355#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 195: Hoare triple {476355#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,596 INFO L290 TraceCheckUtils]: 196: Hoare triple {476355#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 197: Hoare triple {476355#true} assume 8592 == #t~mem71;havoc #t~mem71; {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 198: Hoare triple {476355#true} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 199: Hoare triple {476355#true} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 200: Hoare triple {476355#true} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 201: Hoare triple {476355#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 202: Hoare triple {476355#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 203: Hoare triple {476355#true} ~skip~0 := 0; {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 204: Hoare triple {476355#true} assume !false; {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 205: Hoare triple {476355#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 206: Hoare triple {476355#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,597 INFO L290 TraceCheckUtils]: 207: Hoare triple {476355#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 208: Hoare triple {476355#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 209: Hoare triple {476355#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 210: Hoare triple {476355#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 211: Hoare triple {476355#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 212: Hoare triple {476355#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 213: Hoare triple {476355#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 214: Hoare triple {476355#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 215: Hoare triple {476355#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 216: Hoare triple {476355#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 217: Hoare triple {476355#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,598 INFO L290 TraceCheckUtils]: 218: Hoare triple {476355#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 219: Hoare triple {476355#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 220: Hoare triple {476355#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 221: Hoare triple {476355#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 222: Hoare triple {476355#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 223: Hoare triple {476355#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 224: Hoare triple {476355#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 225: Hoare triple {476355#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 226: Hoare triple {476355#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 227: Hoare triple {476355#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,599 INFO L290 TraceCheckUtils]: 228: Hoare triple {476355#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,600 INFO L290 TraceCheckUtils]: 229: Hoare triple {476355#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,600 INFO L290 TraceCheckUtils]: 230: Hoare triple {476355#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,600 INFO L290 TraceCheckUtils]: 231: Hoare triple {476355#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {476355#true} is VALID [2022-04-15 11:52:20,600 INFO L290 TraceCheckUtils]: 232: Hoare triple {476355#true} assume 8608 == #t~mem73;havoc #t~mem73; {476355#true} is VALID [2022-04-15 11:52:20,600 INFO L290 TraceCheckUtils]: 233: Hoare triple {476355#true} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {476355#true} is VALID [2022-04-15 11:52:20,600 INFO L290 TraceCheckUtils]: 234: Hoare triple {476355#true} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,601 INFO L290 TraceCheckUtils]: 235: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,601 INFO L290 TraceCheckUtils]: 236: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,601 INFO L290 TraceCheckUtils]: 237: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,602 INFO L290 TraceCheckUtils]: 238: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} ~skip~0 := 0; {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,602 INFO L290 TraceCheckUtils]: 239: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !false; {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,602 INFO L290 TraceCheckUtils]: 240: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,602 INFO L290 TraceCheckUtils]: 241: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,603 INFO L290 TraceCheckUtils]: 242: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,603 INFO L290 TraceCheckUtils]: 243: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,603 INFO L290 TraceCheckUtils]: 244: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,604 INFO L290 TraceCheckUtils]: 245: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,604 INFO L290 TraceCheckUtils]: 246: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,604 INFO L290 TraceCheckUtils]: 247: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,605 INFO L290 TraceCheckUtils]: 248: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,605 INFO L290 TraceCheckUtils]: 249: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,605 INFO L290 TraceCheckUtils]: 250: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,605 INFO L290 TraceCheckUtils]: 251: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,606 INFO L290 TraceCheckUtils]: 252: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,606 INFO L290 TraceCheckUtils]: 253: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,606 INFO L290 TraceCheckUtils]: 254: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,607 INFO L290 TraceCheckUtils]: 255: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,607 INFO L290 TraceCheckUtils]: 256: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,607 INFO L290 TraceCheckUtils]: 257: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,608 INFO L290 TraceCheckUtils]: 258: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,608 INFO L290 TraceCheckUtils]: 259: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,608 INFO L290 TraceCheckUtils]: 260: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,609 INFO L290 TraceCheckUtils]: 261: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,609 INFO L290 TraceCheckUtils]: 262: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,609 INFO L290 TraceCheckUtils]: 263: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,610 INFO L290 TraceCheckUtils]: 264: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,610 INFO L290 TraceCheckUtils]: 265: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,610 INFO L290 TraceCheckUtils]: 266: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,610 INFO L290 TraceCheckUtils]: 267: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,611 INFO L290 TraceCheckUtils]: 268: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,611 INFO L290 TraceCheckUtils]: 269: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume 8640 == #t~mem75;havoc #t~mem75; {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,611 INFO L290 TraceCheckUtils]: 270: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:52:20,612 INFO L290 TraceCheckUtils]: 271: Hoare triple {476360#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(9 == ~blastFlag~0); {476356#false} is VALID [2022-04-15 11:52:20,612 INFO L290 TraceCheckUtils]: 272: Hoare triple {476356#false} assume !(12 == ~blastFlag~0); {476356#false} is VALID [2022-04-15 11:52:20,612 INFO L290 TraceCheckUtils]: 273: Hoare triple {476356#false} assume !(15 == ~blastFlag~0); {476356#false} is VALID [2022-04-15 11:52:20,612 INFO L290 TraceCheckUtils]: 274: Hoare triple {476356#false} assume !(18 == ~blastFlag~0); {476356#false} is VALID [2022-04-15 11:52:20,612 INFO L290 TraceCheckUtils]: 275: Hoare triple {476356#false} assume 21 == ~blastFlag~0; {476356#false} is VALID [2022-04-15 11:52:20,612 INFO L290 TraceCheckUtils]: 276: Hoare triple {476356#false} assume !false; {476356#false} is VALID [2022-04-15 11:52:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-15 11:52:20,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:20,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106421618] [2022-04-15 11:52:20,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106421618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:20,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:20,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:52:20,614 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:20,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323952319] [2022-04-15 11:52:20,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323952319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:20,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:20,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:52:20,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004101659] [2022-04-15 11:52:20,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:20,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 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 277 [2022-04-15 11:52:20,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:20,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 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-15 11:52:20,711 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-15 11:52:20,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:52:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:52:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:52:20,712 INFO L87 Difference]: Start difference. First operand 3032 states and 4306 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 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-15 11:52:23,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:25,756 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-15 11:52:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:32,138 INFO L93 Difference]: Finished difference Result 6631 states and 9442 transitions. [2022-04-15 11:52:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:52:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 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 277 [2022-04-15 11:52:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 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-15 11:52:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2022-04-15 11:52:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 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-15 11:52:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2022-04-15 11:52:32,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 666 transitions. [2022-04-15 11:52:32,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 666 edges. 666 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:33,091 INFO L225 Difference]: With dead ends: 6631 [2022-04-15 11:52:33,091 INFO L226 Difference]: Without dead ends: 3627 [2022-04-15 11:52:33,094 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:52:33,094 INFO L913 BasicCegarLoop]: 406 mSDtfsCounter, 152 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:33,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 600 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:52:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3627 states. [2022-04-15 11:52:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3627 to 3627. [2022-04-15 11:52:34,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:34,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3627 states. Second operand has 3627 states, 3622 states have (on average 1.4207620099392602) internal successors, (5146), 3622 states have internal predecessors, (5146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:34,230 INFO L74 IsIncluded]: Start isIncluded. First operand 3627 states. Second operand has 3627 states, 3622 states have (on average 1.4207620099392602) internal successors, (5146), 3622 states have internal predecessors, (5146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:34,232 INFO L87 Difference]: Start difference. First operand 3627 states. Second operand has 3627 states, 3622 states have (on average 1.4207620099392602) internal successors, (5146), 3622 states have internal predecessors, (5146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:34,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:34,595 INFO L93 Difference]: Finished difference Result 3627 states and 5150 transitions. [2022-04-15 11:52:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 5150 transitions. [2022-04-15 11:52:34,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:34,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:34,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 3627 states, 3622 states have (on average 1.4207620099392602) internal successors, (5146), 3622 states have internal predecessors, (5146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3627 states. [2022-04-15 11:52:34,604 INFO L87 Difference]: Start difference. First operand has 3627 states, 3622 states have (on average 1.4207620099392602) internal successors, (5146), 3622 states have internal predecessors, (5146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3627 states. [2022-04-15 11:52:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:34,963 INFO L93 Difference]: Finished difference Result 3627 states and 5150 transitions. [2022-04-15 11:52:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 5150 transitions. [2022-04-15 11:52:34,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:34,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:34,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:34,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3627 states, 3622 states have (on average 1.4207620099392602) internal successors, (5146), 3622 states have internal predecessors, (5146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 5150 transitions. [2022-04-15 11:52:35,558 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 5150 transitions. Word has length 277 [2022-04-15 11:52:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:35,558 INFO L478 AbstractCegarLoop]: Abstraction has 3627 states and 5150 transitions. [2022-04-15 11:52:35,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 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-15 11:52:35,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3627 states and 5150 transitions. [2022-04-15 11:52:41,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5150 edges. 5150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 5150 transitions. [2022-04-15 11:52:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-04-15 11:52:41,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:41,770 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 11:52:41,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-15 11:52:41,770 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:41,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1533638292, now seen corresponding path program 1 times [2022-04-15 11:52:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:41,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [670628307] [2022-04-15 11:52:42,054 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:42,054 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:42,054 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:42,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1533638292, now seen corresponding path program 2 times [2022-04-15 11:52:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:42,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532923493] [2022-04-15 11:52:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:42,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:42,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:42,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {504140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {504134#true} is VALID [2022-04-15 11:52:42,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {504134#true} assume true; {504134#true} is VALID [2022-04-15 11:52:42,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {504134#true} {504134#true} #755#return; {504134#true} is VALID [2022-04-15 11:52:42,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {504134#true} call ULTIMATE.init(); {504140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-15 11:52:42,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {504140#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {504134#true} is VALID [2022-04-15 11:52:42,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {504134#true} assume true; {504134#true} is VALID [2022-04-15 11:52:42,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {504134#true} {504134#true} #755#return; {504134#true} is VALID [2022-04-15 11:52:42,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {504134#true} call #t~ret161 := main(); {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {504134#true} havoc ~s~0.base, ~s~0.offset;havoc ~tmp~2;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~$Pointer$(0, (if #t~nondet11 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet11 % 4294967296 % 4294967296 else #t~nondet11 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet11;call write~int(#t~nondet12, ~s~0.base, 232 + ~s~0.offset, 4);havoc #t~nondet12;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;call write~int(#t~nondet13, ~s~0.base, 180 + ~s~0.offset, 4);havoc #t~nondet13;call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~s~0.base, 176 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), #t~mem14.base, 148 + #t~mem14.offset, 4);havoc #t~mem14.base, #t~mem14.offset;havoc #t~nondet15;call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;call write~int(#t~nondet17, #t~mem16.base, 895 + #t~mem16.offset, 4);havoc #t~mem16.base, #t~mem16.offset;havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc19.base, #t~malloc19.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc19.base, #t~malloc19.offset, #t~mem18.base, 836 + #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~malloc19.base, #t~malloc19.offset;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(#t~mem20.base, 836 + #t~mem20.offset, 4);call write~int(#t~nondet22, #t~mem21.base, 12 + #t~mem21.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~mem21.base, #t~mem21.offset;havoc #t~nondet22;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(#t~mem23.base, 836 + #t~mem23.offset, 4);call write~int(#t~nondet25, #t~mem24.base, 16 + #t~mem24.offset, 4);havoc #t~mem23.base, #t~mem23.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~nondet25;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647; {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {504134#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L272 TraceCheckUtils]: 7: Hoare triple {504134#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {504134#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;call write~int(8464, ~s.base, 52 + ~s.offset, 4);~blastFlag~0 := 0;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;call write~int(#t~nondet40, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet40;call write~int(8464, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp~3 := #t~nondet41;havoc #t~nondet41;~Time~0 := ~tmp~3;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;~got_new_session~0 := 0;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {504134#true} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {504134#true} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {504134#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {504134#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {504134#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {504134#true} assume !false; {504134#true} is VALID [2022-04-15 11:52:42,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {504134#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {504134#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {504134#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {504134#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {504134#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {504134#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {504134#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {504134#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {504134#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {504134#true} assume 8464 == #t~mem55;havoc #t~mem55; {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {504134#true} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {504134#true} is VALID [2022-04-15 11:52:42,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {504134#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {504134#true} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {504134#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {504134#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {504134#true} ~skip~0 := 0; {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {504134#true} assume !false; {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {504134#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {504134#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {504134#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {504134#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {504134#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {504134#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 38: Hoare triple {504134#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 39: Hoare triple {504134#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {504134#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {504134#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {504134#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {504134#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {504134#true} assume 8496 == #t~mem58;havoc #t~mem58; {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 45: Hoare triple {504134#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {504134#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {504134#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {504134#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {504134#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 50: Hoare triple {504134#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 51: Hoare triple {504134#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {504134#true} ~skip~0 := 0; {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {504134#true} assume !false; {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {504134#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {504134#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {504134#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {504134#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {504134#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {504134#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {504134#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {504134#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {504134#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 63: Hoare triple {504134#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 64: Hoare triple {504134#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 65: Hoare triple {504134#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 66: Hoare triple {504134#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 67: Hoare triple {504134#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 68: Hoare triple {504134#true} assume 8512 == #t~mem60;havoc #t~mem60; {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 69: Hoare triple {504134#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,252 INFO L290 TraceCheckUtils]: 70: Hoare triple {504134#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 71: Hoare triple {504134#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 72: Hoare triple {504134#true} assume !(~ret~0 <= 0); {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 73: Hoare triple {504134#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 74: Hoare triple {504134#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 75: Hoare triple {504134#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 76: Hoare triple {504134#true} ~skip~0 := 0; {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 77: Hoare triple {504134#true} assume !false; {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 78: Hoare triple {504134#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 79: Hoare triple {504134#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 80: Hoare triple {504134#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,253 INFO L290 TraceCheckUtils]: 81: Hoare triple {504134#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 82: Hoare triple {504134#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 83: Hoare triple {504134#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {504134#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 85: Hoare triple {504134#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {504134#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 87: Hoare triple {504134#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 88: Hoare triple {504134#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 89: Hoare triple {504134#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 90: Hoare triple {504134#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 91: Hoare triple {504134#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,254 INFO L290 TraceCheckUtils]: 92: Hoare triple {504134#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 93: Hoare triple {504134#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 94: Hoare triple {504134#true} assume 8528 == #t~mem62;havoc #t~mem62; {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 95: Hoare triple {504134#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 96: Hoare triple {504134#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 97: Hoare triple {504134#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 98: Hoare triple {504134#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 99: Hoare triple {504134#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {504134#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 101: Hoare triple {504134#true} assume !(~ret~0 <= 0); {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 102: Hoare triple {504134#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,255 INFO L290 TraceCheckUtils]: 103: Hoare triple {504134#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 104: Hoare triple {504134#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 105: Hoare triple {504134#true} ~skip~0 := 0; {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 106: Hoare triple {504134#true} assume !false; {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 107: Hoare triple {504134#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 108: Hoare triple {504134#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 109: Hoare triple {504134#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 110: Hoare triple {504134#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 111: Hoare triple {504134#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 112: Hoare triple {504134#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 113: Hoare triple {504134#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,256 INFO L290 TraceCheckUtils]: 114: Hoare triple {504134#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 115: Hoare triple {504134#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 116: Hoare triple {504134#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 117: Hoare triple {504134#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 118: Hoare triple {504134#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 119: Hoare triple {504134#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 120: Hoare triple {504134#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 121: Hoare triple {504134#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 122: Hoare triple {504134#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 123: Hoare triple {504134#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 124: Hoare triple {504134#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,257 INFO L290 TraceCheckUtils]: 125: Hoare triple {504134#true} assume 8544 == #t~mem64;havoc #t~mem64; {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 126: Hoare triple {504134#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 127: Hoare triple {504134#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 128: Hoare triple {504134#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 129: Hoare triple {504134#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 130: Hoare triple {504134#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 131: Hoare triple {504134#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 132: Hoare triple {504134#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 133: Hoare triple {504134#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 134: Hoare triple {504134#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 135: Hoare triple {504134#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504134#true} is VALID [2022-04-15 11:52:42,258 INFO L290 TraceCheckUtils]: 136: Hoare triple {504134#true} ~skip~0 := 0; {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 137: Hoare triple {504134#true} assume !false; {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 138: Hoare triple {504134#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 139: Hoare triple {504134#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 140: Hoare triple {504134#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 141: Hoare triple {504134#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 142: Hoare triple {504134#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 143: Hoare triple {504134#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 144: Hoare triple {504134#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 145: Hoare triple {504134#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 146: Hoare triple {504134#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,259 INFO L290 TraceCheckUtils]: 147: Hoare triple {504134#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 148: Hoare triple {504134#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 149: Hoare triple {504134#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 150: Hoare triple {504134#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 151: Hoare triple {504134#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 152: Hoare triple {504134#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 153: Hoare triple {504134#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 154: Hoare triple {504134#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 155: Hoare triple {504134#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 156: Hoare triple {504134#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 157: Hoare triple {504134#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 158: Hoare triple {504134#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,260 INFO L290 TraceCheckUtils]: 159: Hoare triple {504134#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 160: Hoare triple {504134#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 161: Hoare triple {504134#true} assume 8576 == #t~mem69;havoc #t~mem69; {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 162: Hoare triple {504134#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 163: Hoare triple {504134#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 164: Hoare triple {504134#true} assume !(~ret~0 <= 0); {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 165: Hoare triple {504134#true} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 166: Hoare triple {504134#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 167: Hoare triple {504134#true} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 168: Hoare triple {504134#true} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 169: Hoare triple {504134#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504134#true} is VALID [2022-04-15 11:52:42,261 INFO L290 TraceCheckUtils]: 170: Hoare triple {504134#true} ~skip~0 := 0; {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 171: Hoare triple {504134#true} assume !false; {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 172: Hoare triple {504134#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 173: Hoare triple {504134#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 174: Hoare triple {504134#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 175: Hoare triple {504134#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 176: Hoare triple {504134#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 177: Hoare triple {504134#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 178: Hoare triple {504134#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 179: Hoare triple {504134#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 180: Hoare triple {504134#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,262 INFO L290 TraceCheckUtils]: 181: Hoare triple {504134#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 182: Hoare triple {504134#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 183: Hoare triple {504134#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 184: Hoare triple {504134#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 185: Hoare triple {504134#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 186: Hoare triple {504134#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 187: Hoare triple {504134#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 188: Hoare triple {504134#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 189: Hoare triple {504134#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 190: Hoare triple {504134#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 191: Hoare triple {504134#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,263 INFO L290 TraceCheckUtils]: 192: Hoare triple {504134#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,264 INFO L290 TraceCheckUtils]: 193: Hoare triple {504134#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,264 INFO L290 TraceCheckUtils]: 194: Hoare triple {504134#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,264 INFO L290 TraceCheckUtils]: 195: Hoare triple {504134#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,264 INFO L290 TraceCheckUtils]: 196: Hoare triple {504134#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {504134#true} is VALID [2022-04-15 11:52:42,264 INFO L290 TraceCheckUtils]: 197: Hoare triple {504134#true} assume 8592 == #t~mem71;havoc #t~mem71; {504134#true} is VALID [2022-04-15 11:52:42,264 INFO L290 TraceCheckUtils]: 198: Hoare triple {504134#true} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {504134#true} is VALID [2022-04-15 11:52:42,264 INFO L290 TraceCheckUtils]: 199: Hoare triple {504134#true} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,265 INFO L290 TraceCheckUtils]: 200: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,265 INFO L290 TraceCheckUtils]: 201: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,265 INFO L290 TraceCheckUtils]: 202: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,266 INFO L290 TraceCheckUtils]: 203: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} ~skip~0 := 0; {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,266 INFO L290 TraceCheckUtils]: 204: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !false; {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,266 INFO L290 TraceCheckUtils]: 205: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,267 INFO L290 TraceCheckUtils]: 206: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,267 INFO L290 TraceCheckUtils]: 207: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,267 INFO L290 TraceCheckUtils]: 208: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,268 INFO L290 TraceCheckUtils]: 209: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,268 INFO L290 TraceCheckUtils]: 210: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,268 INFO L290 TraceCheckUtils]: 211: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,268 INFO L290 TraceCheckUtils]: 212: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,269 INFO L290 TraceCheckUtils]: 213: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,269 INFO L290 TraceCheckUtils]: 214: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,269 INFO L290 TraceCheckUtils]: 215: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,270 INFO L290 TraceCheckUtils]: 216: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,270 INFO L290 TraceCheckUtils]: 217: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,270 INFO L290 TraceCheckUtils]: 218: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,271 INFO L290 TraceCheckUtils]: 219: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,271 INFO L290 TraceCheckUtils]: 220: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,271 INFO L290 TraceCheckUtils]: 221: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,271 INFO L290 TraceCheckUtils]: 222: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,272 INFO L290 TraceCheckUtils]: 223: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,272 INFO L290 TraceCheckUtils]: 224: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,272 INFO L290 TraceCheckUtils]: 225: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,273 INFO L290 TraceCheckUtils]: 226: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,273 INFO L290 TraceCheckUtils]: 227: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,273 INFO L290 TraceCheckUtils]: 228: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,274 INFO L290 TraceCheckUtils]: 229: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,274 INFO L290 TraceCheckUtils]: 230: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,274 INFO L290 TraceCheckUtils]: 231: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,274 INFO L290 TraceCheckUtils]: 232: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume 8608 == #t~mem73;havoc #t~mem73; {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,275 INFO L290 TraceCheckUtils]: 233: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:52:42,275 INFO L290 TraceCheckUtils]: 234: Hoare triple {504139#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8 == ~blastFlag~0); {504135#false} is VALID [2022-04-15 11:52:42,275 INFO L290 TraceCheckUtils]: 235: Hoare triple {504135#false} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,275 INFO L290 TraceCheckUtils]: 236: Hoare triple {504135#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,275 INFO L290 TraceCheckUtils]: 237: Hoare triple {504135#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 238: Hoare triple {504135#false} ~skip~0 := 0; {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 239: Hoare triple {504135#false} assume !false; {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 240: Hoare triple {504135#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 241: Hoare triple {504135#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 242: Hoare triple {504135#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 243: Hoare triple {504135#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 244: Hoare triple {504135#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 245: Hoare triple {504135#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 246: Hoare triple {504135#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,276 INFO L290 TraceCheckUtils]: 247: Hoare triple {504135#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 248: Hoare triple {504135#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 249: Hoare triple {504135#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 250: Hoare triple {504135#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 251: Hoare triple {504135#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 252: Hoare triple {504135#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 253: Hoare triple {504135#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 254: Hoare triple {504135#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 255: Hoare triple {504135#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 256: Hoare triple {504135#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 257: Hoare triple {504135#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,277 INFO L290 TraceCheckUtils]: 258: Hoare triple {504135#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 259: Hoare triple {504135#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 260: Hoare triple {504135#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 261: Hoare triple {504135#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 262: Hoare triple {504135#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 263: Hoare triple {504135#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 264: Hoare triple {504135#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 265: Hoare triple {504135#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 266: Hoare triple {504135#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 267: Hoare triple {504135#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 268: Hoare triple {504135#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 269: Hoare triple {504135#false} assume 8640 == #t~mem75;havoc #t~mem75; {504135#false} is VALID [2022-04-15 11:52:42,278 INFO L290 TraceCheckUtils]: 270: Hoare triple {504135#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {504135#false} is VALID [2022-04-15 11:52:42,279 INFO L290 TraceCheckUtils]: 271: Hoare triple {504135#false} assume !(9 == ~blastFlag~0); {504135#false} is VALID [2022-04-15 11:52:42,279 INFO L290 TraceCheckUtils]: 272: Hoare triple {504135#false} assume !(12 == ~blastFlag~0); {504135#false} is VALID [2022-04-15 11:52:42,279 INFO L290 TraceCheckUtils]: 273: Hoare triple {504135#false} assume !(15 == ~blastFlag~0); {504135#false} is VALID [2022-04-15 11:52:42,279 INFO L290 TraceCheckUtils]: 274: Hoare triple {504135#false} assume !(18 == ~blastFlag~0); {504135#false} is VALID [2022-04-15 11:52:42,279 INFO L290 TraceCheckUtils]: 275: Hoare triple {504135#false} assume 21 == ~blastFlag~0; {504135#false} is VALID [2022-04-15 11:52:42,279 INFO L290 TraceCheckUtils]: 276: Hoare triple {504135#false} assume !false; {504135#false} is VALID [2022-04-15 11:52:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 11:52:42,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:42,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532923493] [2022-04-15 11:52:42,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532923493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:42,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:42,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:52:42,280 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:42,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [670628307] [2022-04-15 11:52:42,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [670628307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:42,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:42,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:52:42,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487878652] [2022-04-15 11:52:42,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:42,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 277 [2022-04-15 11:52:42,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:42,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:42,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:42,413 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:52:42,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:52:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:52:42,413 INFO L87 Difference]: Start difference. First operand 3627 states and 5150 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:44,446 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-15 11:52:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:50,472 INFO L93 Difference]: Finished difference Result 7796 states and 11096 transitions. [2022-04-15 11:52:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:52:50,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 277 [2022-04-15 11:52:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:52:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-04-15 11:52:50,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 677 transitions. [2022-04-15 11:52:50,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.