/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.15.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:45:41,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:45:41,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:45:41,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:45:41,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:45:41,326 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:45:41,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:45:41,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:45:41,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:45:41,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:45:41,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:45:41,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:45:41,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:45:41,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:45:41,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:45:41,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:45:41,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:45:41,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:45:41,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:45:41,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:45:41,349 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:45:41,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:45:41,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:45:41,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:45:41,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:45:41,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:45:41,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:45:41,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:45:41,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:45:41,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:45:41,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:45:41,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:45:41,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:45:41,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:45:41,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:45:41,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:45:41,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:45:41,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:45:41,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:45:41,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:45:41,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:45:41,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:45:41,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:45:41,368 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:45:41,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:45:41,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:45:41,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:45:41,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:45:41,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:45:41,370 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:45:41,371 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:45:41,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:45:41,371 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:45:41,371 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:45:41,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:45:41,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:45:41,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:45:41,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:45:41,575 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:45:41,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-28 08:45:41,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c9d1e51/48e6a59d160f45598a4bf1c99dde68b9/FLAGbd38901a1 [2022-04-28 08:45:42,033 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:45:42,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c [2022-04-28 08:45:42,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c9d1e51/48e6a59d160f45598a4bf1c99dde68b9/FLAGbd38901a1 [2022-04-28 08:45:42,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c9d1e51/48e6a59d160f45598a4bf1c99dde68b9 [2022-04-28 08:45:42,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:45:42,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:45:42,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:45:42,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:45:42,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:45:42,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f15e9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42, skipping insertion in model container [2022-04-28 08:45:42,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:45:42,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:45:42,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c[75833,75846] [2022-04-28 08:45:42,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:45:42,437 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:45:42,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.15.i.cil-2.c[75833,75846] [2022-04-28 08:45:42,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:45:42,569 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:45:42,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42 WrapperNode [2022-04-28 08:45:42,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:45:42,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:45:42,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:45:42,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:45:42,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:45:42,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:45:42,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:45:42,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:45:42,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (1/1) ... [2022-04-28 08:45:42,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:45:42,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:45:42,725 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:45:42,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:45:42,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-28 08:45:42,753 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-28 08:45:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:45:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-28 08:45:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-28 08:45:42,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-28 08:45:42,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:45:42,871 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:45:42,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:45:43,610 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-28 08:45:44,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-28 08:45:44,008 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-28 08:45:44,017 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:45:44,023 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:45:44,024 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:45:44,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:45:44 BoogieIcfgContainer [2022-04-28 08:45:44,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:45:44,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:45:44,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:45:44,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:45:44,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:45:42" (1/3) ... [2022-04-28 08:45:44,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3ce618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:45:44, skipping insertion in model container [2022-04-28 08:45:44,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:45:42" (2/3) ... [2022-04-28 08:45:44,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3ce618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:45:44, skipping insertion in model container [2022-04-28 08:45:44,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:45:44" (3/3) ... [2022-04-28 08:45:44,030 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2022-04-28 08:45:44,040 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:45:44,040 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:45:44,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:45:44,082 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2abe885a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15724268 [2022-04-28 08:45:44,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:45:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 08:45:44,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 08:45:44,106 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:44,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:44,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:44,111 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 1 times [2022-04-28 08:45:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:44,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [463350166] [2022-04-28 08:45:44,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:45:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash -668377608, now seen corresponding path program 2 times [2022-04-28 08:45:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:44,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579454656] [2022-04-28 08:45:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:44,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165#true} is VALID [2022-04-28 08:45:44,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-28 08:45:44,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-28 08:45:44,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:45:44,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165#true} is VALID [2022-04-28 08:45:44,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2022-04-28 08:45:44,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #708#return; {165#true} is VALID [2022-04-28 08:45:44,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret161 := main(); {165#true} is VALID [2022-04-28 08:45:44,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#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; {165#true} is VALID [2022-04-28 08:45:44,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {165#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {165#true} is VALID [2022-04-28 08:45:44,542 INFO L272 TraceCheckUtils]: 7: Hoare triple {165#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {165#true} is VALID [2022-04-28 08:45:44,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {165#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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(= 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; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(= 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; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {170#(= 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)))); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {170#(= 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; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {170#(= 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); {170#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:44,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {170#(= 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); {171#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-28 08:45:44,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {171#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {166#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {166#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {166#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {166#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {166#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {166#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {166#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {166#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {166#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {166#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {166#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {166#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {166#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {166#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {166#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {166#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,556 INFO L290 TraceCheckUtils]: 41: Hoare triple {166#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {166#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {166#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {166#false} is VALID [2022-04-28 08:45:44,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {166#false} assume 8640 == #t~mem75;havoc #t~mem75; {166#false} is VALID [2022-04-28 08:45:44,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {166#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {166#false} is VALID [2022-04-28 08:45:44,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {166#false} assume !(4 == ~blastFlag~0); {166#false} is VALID [2022-04-28 08:45:44,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {166#false} assume !(7 == ~blastFlag~0); {166#false} is VALID [2022-04-28 08:45:44,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {166#false} assume !(10 == ~blastFlag~0); {166#false} is VALID [2022-04-28 08:45:44,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {166#false} assume 13 == ~blastFlag~0; {166#false} is VALID [2022-04-28 08:45:44,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-04-28 08:45:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:44,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:44,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579454656] [2022-04-28 08:45:44,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579454656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:44,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:44,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:44,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:44,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [463350166] [2022-04-28 08:45:44,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [463350166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:44,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:44,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:44,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731126980] [2022-04-28 08:45:44,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:44,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 08:45:44,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:44,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:44,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:44,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:45:44,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:44,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:45:44,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:45:44,635 INFO L87 Difference]: Start difference. First operand has 162 states, 154 states have (on average 1.7142857142857142) internal successors, (264), 155 states have internal predecessors, (264), 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.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:48,151 INFO L93 Difference]: Finished difference Result 342 states and 576 transitions. [2022-04-28 08:45:48,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:45:48,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 08:45:48,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-28 08:45:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2022-04-28 08:45:48,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 576 transitions. [2022-04-28 08:45:48,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 576 edges. 576 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:48,581 INFO L225 Difference]: With dead ends: 342 [2022-04-28 08:45:48,581 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 08:45:48,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:45:48,585 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 34 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:48,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 631 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 08:45:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 08:45:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2022-04-28 08:45:48,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:48,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,635 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,636 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:48,645 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-28 08:45:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-28 08:45:48,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:48,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:48,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-28 08:45:48,651 INFO L87 Difference]: Start difference. First operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 174 states. [2022-04-28 08:45:48,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:48,658 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2022-04-28 08:45:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2022-04-28 08:45:48,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:48,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:48,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:48,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2022-04-28 08:45:48,665 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 51 [2022-04-28 08:45:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:48,666 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2022-04-28 08:45:48,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:48,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 242 transitions. [2022-04-28 08:45:48,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2022-04-28 08:45:48,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 08:45:48,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:48,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:48,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:45:48,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:48,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 1 times [2022-04-28 08:45:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306081337] [2022-04-28 08:45:48,907 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:45:48,907 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:45:48,908 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:45:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -480939749, now seen corresponding path program 2 times [2022-04-28 08:45:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:48,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971605146] [2022-04-28 08:45:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:49,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1523#true} is VALID [2022-04-28 08:45:49,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-28 08:45:49,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-28 08:45:49,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {1523#true} call ULTIMATE.init(); {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:45:49,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1523#true} is VALID [2022-04-28 08:45:49,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {1523#true} assume true; {1523#true} is VALID [2022-04-28 08:45:49,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1523#true} {1523#true} #708#return; {1523#true} is VALID [2022-04-28 08:45:49,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {1523#true} call #t~ret161 := main(); {1523#true} is VALID [2022-04-28 08:45:49,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {1523#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; {1523#true} is VALID [2022-04-28 08:45:49,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1523#true} is VALID [2022-04-28 08:45:49,109 INFO L272 TraceCheckUtils]: 7: Hoare triple {1523#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1523#true} is VALID [2022-04-28 08:45:49,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(not (= 8480 (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; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {1528#(not (= 8480 (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; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#(not (= 8480 (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)))); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(not (= 8480 (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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(not (= 8480 (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; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {1528#(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); {1528#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:45:49,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {1528#(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); {1529#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-28 08:45:49,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1524#false} is VALID [2022-04-28 08:45:49,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {1524#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; {1524#false} is VALID [2022-04-28 08:45:49,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {1524#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); {1524#false} is VALID [2022-04-28 08:45:49,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {1524#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {1524#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1524#false} is VALID [2022-04-28 08:45:49,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {1524#false} ~skip~0 := 0; {1524#false} is VALID [2022-04-28 08:45:49,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-28 08:45:49,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {1524#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {1524#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {1524#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {1524#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {1524#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {1524#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {1524#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {1524#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {1524#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {1524#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,125 INFO L290 TraceCheckUtils]: 38: Hoare triple {1524#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {1524#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {1524#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {1524#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {1524#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {1524#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {1524#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {1524#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,132 INFO L290 TraceCheckUtils]: 46: Hoare triple {1524#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {1524#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {1524#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {1524#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {1524#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {1524#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 52: Hoare triple {1524#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 53: Hoare triple {1524#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {1524#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {1524#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,135 INFO L290 TraceCheckUtils]: 56: Hoare triple {1524#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1524#false} is VALID [2022-04-28 08:45:49,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {1524#false} assume 8640 == #t~mem75;havoc #t~mem75; {1524#false} is VALID [2022-04-28 08:45:49,136 INFO L290 TraceCheckUtils]: 58: Hoare triple {1524#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1524#false} is VALID [2022-04-28 08:45:49,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {1524#false} assume !(4 == ~blastFlag~0); {1524#false} is VALID [2022-04-28 08:45:49,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {1524#false} assume !(7 == ~blastFlag~0); {1524#false} is VALID [2022-04-28 08:45:49,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {1524#false} assume !(10 == ~blastFlag~0); {1524#false} is VALID [2022-04-28 08:45:49,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {1524#false} assume 13 == ~blastFlag~0; {1524#false} is VALID [2022-04-28 08:45:49,144 INFO L290 TraceCheckUtils]: 63: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-04-28 08:45:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:49,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971605146] [2022-04-28 08:45:49,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971605146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:49,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:49,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:49,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:49,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306081337] [2022-04-28 08:45:49,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306081337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:49,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:49,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294341558] [2022-04-28 08:45:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:45:49,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:49,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:49,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:49,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:45:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:49,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:45:49,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:45:49,190 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:51,867 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-28 08:45:54,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:54,536 INFO L93 Difference]: Finished difference Result 408 states and 634 transitions. [2022-04-28 08:45:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:45:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 08:45:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-28 08:45:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-28 08:45:54,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-28 08:45:54,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:54,986 INFO L225 Difference]: With dead ends: 408 [2022-04-28 08:45:54,987 INFO L226 Difference]: Without dead ends: 277 [2022-04-28 08:45:54,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:45:54,988 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 149 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:54,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 662 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 08:45:54,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-28 08:45:55,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 173. [2022-04-28 08:45:55,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:55,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:55,008 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:55,009 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:55,016 INFO L93 Difference]: Finished difference Result 277 states and 428 transitions. [2022-04-28 08:45:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 428 transitions. [2022-04-28 08:45:55,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:55,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:55,018 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 08:45:55,018 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 277 states. [2022-04-28 08:45:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:55,026 INFO L93 Difference]: Finished difference Result 277 states and 428 transitions. [2022-04-28 08:45:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 428 transitions. [2022-04-28 08:45:55,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:55,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:55,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:55,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 267 transitions. [2022-04-28 08:45:55,031 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 267 transitions. Word has length 64 [2022-04-28 08:45:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:55,033 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 267 transitions. [2022-04-28 08:45:55,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:55,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 267 transitions. [2022-04-28 08:45:55,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 267 transitions. [2022-04-28 08:45:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:45:55,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:55,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:55,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:45:55,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 1 times [2022-04-28 08:45:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:55,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777631169] [2022-04-28 08:45:55,252 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:45:55,252 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:45:55,252 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:45:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1522986347, now seen corresponding path program 2 times [2022-04-28 08:45:55,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:55,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208692702] [2022-04-28 08:45:55,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:55,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3251#true} is VALID [2022-04-28 08:45:55,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3251#true} assume true; {3251#true} is VALID [2022-04-28 08:45:55,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3251#true} {3251#true} #708#return; {3251#true} is VALID [2022-04-28 08:45:55,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {3251#true} call ULTIMATE.init(); {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:45:55,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {3258#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3251#true} is VALID [2022-04-28 08:45:55,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#true} assume true; {3251#true} is VALID [2022-04-28 08:45:55,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#true} {3251#true} #708#return; {3251#true} is VALID [2022-04-28 08:45:55,420 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#true} call #t~ret161 := main(); {3251#true} is VALID [2022-04-28 08:45:55,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#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; {3251#true} is VALID [2022-04-28 08:45:55,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {3251#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3251#true} is VALID [2022-04-28 08:45:55,420 INFO L272 TraceCheckUtils]: 7: Hoare triple {3251#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3251#true} is VALID [2022-04-28 08:45:55,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {3251#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); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:55,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#(= 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; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:55,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#(= 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; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:55,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#(= 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)))); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:55,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {3256#(= 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); {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:55,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {3256#(= 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; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:55,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3256#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:45:55,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {3256#(= 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); {3257#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-28 08:45:55,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {3257#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {3252#false} is VALID [2022-04-28 08:45:55,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {3252#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {3252#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {3252#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3252#false} is VALID [2022-04-28 08:45:55,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {3252#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {3252#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); {3252#false} is VALID [2022-04-28 08:45:55,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {3252#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3252#false} is VALID [2022-04-28 08:45:55,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {3252#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); {3252#false} is VALID [2022-04-28 08:45:55,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {3252#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); {3252#false} is VALID [2022-04-28 08:45:55,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {3252#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {3252#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3252#false} is VALID [2022-04-28 08:45:55,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {3252#false} ~skip~0 := 0; {3252#false} is VALID [2022-04-28 08:45:55,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {3252#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {3252#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {3252#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {3252#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {3252#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {3252#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {3252#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {3252#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {3252#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {3252#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {3252#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 40: Hoare triple {3252#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 41: Hoare triple {3252#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {3252#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {3252#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {3252#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {3252#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {3252#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {3252#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {3252#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 49: Hoare triple {3252#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {3252#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {3252#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {3252#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {3252#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {3252#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {3252#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 56: Hoare triple {3252#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 57: Hoare triple {3252#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 58: Hoare triple {3252#false} assume 8640 == #t~mem75;havoc #t~mem75; {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {3252#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3252#false} is VALID [2022-04-28 08:45:55,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {3252#false} assume !(4 == ~blastFlag~0); {3252#false} is VALID [2022-04-28 08:45:55,432 INFO L290 TraceCheckUtils]: 61: Hoare triple {3252#false} assume !(7 == ~blastFlag~0); {3252#false} is VALID [2022-04-28 08:45:55,432 INFO L290 TraceCheckUtils]: 62: Hoare triple {3252#false} assume !(10 == ~blastFlag~0); {3252#false} is VALID [2022-04-28 08:45:55,432 INFO L290 TraceCheckUtils]: 63: Hoare triple {3252#false} assume 13 == ~blastFlag~0; {3252#false} is VALID [2022-04-28 08:45:55,432 INFO L290 TraceCheckUtils]: 64: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2022-04-28 08:45:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:55,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:55,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208692702] [2022-04-28 08:45:55,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208692702] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:55,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:55,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:55,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:45:55,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777631169] [2022-04-28 08:45:55,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777631169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:55,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:55,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:45:55,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594652390] [2022-04-28 08:45:55,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:45:55,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:45:55,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:45:55,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:55,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:55,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:45:55,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:55,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:45:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:45:55,481 INFO L87 Difference]: Start difference. First operand 173 states and 267 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:58,686 INFO L93 Difference]: Finished difference Result 336 states and 517 transitions. [2022-04-28 08:45:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:45:58,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:45:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:45:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-28 08:45:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 465 transitions. [2022-04-28 08:45:58,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 465 transitions. [2022-04-28 08:45:59,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:59,036 INFO L225 Difference]: With dead ends: 336 [2022-04-28 08:45:59,036 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 08:45:59,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:45:59,038 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 28 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:45:59,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 509 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 08:45:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 08:45:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2022-04-28 08:45:59,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:45:59,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:59,045 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:59,046 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:59,049 INFO L93 Difference]: Finished difference Result 189 states and 286 transitions. [2022-04-28 08:45:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2022-04-28 08:45:59,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:59,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:59,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-28 08:45:59,050 INFO L87 Difference]: Start difference. First operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 189 states. [2022-04-28 08:45:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:45:59,054 INFO L93 Difference]: Finished difference Result 189 states and 286 transitions. [2022-04-28 08:45:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 286 transitions. [2022-04-28 08:45:59,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:45:59,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:45:59,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:45:59,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:45:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.5595238095238095) internal successors, (262), 168 states have internal predecessors, (262), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2022-04-28 08:45:59,062 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 65 [2022-04-28 08:45:59,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:45:59,063 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2022-04-28 08:45:59,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:45:59,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 266 transitions. [2022-04-28 08:45:59,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:45:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2022-04-28 08:45:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:45:59,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:45:59,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:45:59,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:45:59,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:45:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:45:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash -112549033, now seen corresponding path program 1 times [2022-04-28 08:45:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:45:59,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [631926616] [2022-04-28 08:45:59,400 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-28 08:45:59,402 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:45:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash 14964021, now seen corresponding path program 1 times [2022-04-28 08:45:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:45:59,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585455711] [2022-04-28 08:45:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:45:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:45:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:45:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:45:59,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4659#true} is VALID [2022-04-28 08:45:59,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {4659#true} assume true; {4659#true} is VALID [2022-04-28 08:45:59,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4659#true} {4659#true} #708#return; {4659#true} is VALID [2022-04-28 08:45:59,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {4659#true} call ULTIMATE.init(); {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:45:59,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {4665#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4659#true} is VALID [2022-04-28 08:45:59,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {4659#true} assume true; {4659#true} is VALID [2022-04-28 08:45:59,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4659#true} {4659#true} #708#return; {4659#true} is VALID [2022-04-28 08:45:59,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {4659#true} call #t~ret161 := main(); {4659#true} is VALID [2022-04-28 08:45:59,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {4659#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; {4659#true} is VALID [2022-04-28 08:45:59,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {4659#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4659#true} is VALID [2022-04-28 08:45:59,547 INFO L272 TraceCheckUtils]: 7: Hoare triple {4659#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4659#true} is VALID [2022-04-28 08:45:59,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {4659#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); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {4664#(= 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; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {4664#(= 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; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {4664#(= 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)))); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} [714] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse1 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse2 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse3 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse4 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse5 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse6 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse7 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse8 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse9 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse10 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse11 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|))) (or (and (= |v_#memory_$Pointer$.offset_250| |v_#memory_$Pointer$.offset_256|) .cse0 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_251| |v_#memory_int_256|) (= |v_#memory_$Pointer$.base_250| |v_#memory_$Pointer$.base_256|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|)) (and (= |v_#memory_int_256| |v_#memory_int_251|) .cse0 .cse1 (= |v_#memory_$Pointer$.offset_256| |v_#memory_$Pointer$.offset_250|) .cse2 (= |v_#memory_$Pointer$.base_256| |v_#memory_$Pointer$.base_250|) .cse3 .cse4 (= |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|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, 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_256|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, 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_250|, 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_251|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_250|, 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] {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} [713] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {4664#(= 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); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,558 INFO L290 TraceCheckUtils]: 43: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {4664#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:45:59,560 INFO L290 TraceCheckUtils]: 50: Hoare triple {4664#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {4660#false} is VALID [2022-04-28 08:45:59,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {4660#false} assume !false; {4660#false} is VALID [2022-04-28 08:45:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:45:59,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:45:59,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585455711] [2022-04-28 08:45:59,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585455711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:45:59,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:45:59,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:46:03,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:03,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [631926616] [2022-04-28 08:46:03,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [631926616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:03,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:03,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 08:46:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626275483] [2022-04-28 08:46:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:46:03,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:03,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:03,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:03,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 08:46:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 08:46:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:46:03,227 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:13,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:17,957 INFO L93 Difference]: Finished difference Result 465 states and 726 transitions. [2022-04-28 08:46:17,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:46:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:46:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 631 transitions. [2022-04-28 08:46:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 631 transitions. [2022-04-28 08:46:17,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 631 transitions. [2022-04-28 08:46:18,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:18,448 INFO L225 Difference]: With dead ends: 465 [2022-04-28 08:46:18,448 INFO L226 Difference]: Without dead ends: 318 [2022-04-28 08:46:18,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:46:18,449 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 148 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:46:18,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 992 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1062 Invalid, 0 Unknown, 14 Unchecked, 4.9s Time] [2022-04-28 08:46:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-28 08:46:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2022-04-28 08:46:18,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:18,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:18,482 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:18,483 INFO L87 Difference]: Start difference. First operand 318 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:18,488 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-28 08:46:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 481 transitions. [2022-04-28 08:46:18,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:18,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:18,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 318 states. [2022-04-28 08:46:18,489 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 318 states. [2022-04-28 08:46:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:18,515 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-28 08:46:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 481 transitions. [2022-04-28 08:46:18,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:18,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:18,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:18,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:18,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 475 transitions. [2022-04-28 08:46:18,524 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 475 transitions. Word has length 65 [2022-04-28 08:46:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:18,524 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 475 transitions. [2022-04-28 08:46:18,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:18,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 475 transitions. [2022-04-28 08:46:18,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-04-28 08:46:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 08:46:18,768 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:18,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:46:18,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:46:18,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1815723669, now seen corresponding path program 1 times [2022-04-28 08:46:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:18,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309554941] [2022-04-28 08:46:18,914 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-28 08:46:18,914 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:46:18,915 INFO L85 PathProgramCache]: Analyzing trace with hash -354863755, now seen corresponding path program 1 times [2022-04-28 08:46:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:18,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832165672] [2022-04-28 08:46:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:18,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:19,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6869#true} is VALID [2022-04-28 08:46:19,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-28 08:46:19,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6869#true} {6869#true} #708#return; {6869#true} is VALID [2022-04-28 08:46:19,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {6869#true} call ULTIMATE.init(); {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:46:19,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {6875#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6869#true} is VALID [2022-04-28 08:46:19,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {6869#true} assume true; {6869#true} is VALID [2022-04-28 08:46:19,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6869#true} {6869#true} #708#return; {6869#true} is VALID [2022-04-28 08:46:19,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {6869#true} call #t~ret161 := main(); {6869#true} is VALID [2022-04-28 08:46:19,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {6869#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; {6869#true} is VALID [2022-04-28 08:46:19,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {6869#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6869#true} is VALID [2022-04-28 08:46:19,041 INFO L272 TraceCheckUtils]: 7: Hoare triple {6869#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6869#true} is VALID [2022-04-28 08:46:19,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {6869#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); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {6874#(= 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; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {6874#(= 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; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {6874#(= 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)))); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} [716] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_10| |v_ssl3_accept_#t~mem88.offset_9|)) (.cse1 (= |v_ssl3_accept_#t~mem150.offset_16| |v_ssl3_accept_#t~mem150.offset_14|)) (.cse2 (= v_ssl3_accept_~skip~0_21 v_ssl3_accept_~skip~0_20)) (.cse3 (= |v_ssl3_accept_#t~mem82_17| |v_ssl3_accept_#t~mem82_15|)) (.cse4 (= |v_ssl3_accept_#t~mem151_18| |v_ssl3_accept_#t~mem151_16|)) (.cse5 (= |v_ssl3_accept_#t~mem47_19| |v_ssl3_accept_#t~mem47_17|)) (.cse6 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_15|)) (.cse7 (= |v_ssl3_accept_#t~mem85_17| |v_ssl3_accept_#t~mem85_15|)) (.cse8 (= v_ssl3_accept_~state~0_13 v_ssl3_accept_~state~0_12)) (.cse9 (= |v_ssl3_accept_#t~mem89_10| |v_ssl3_accept_#t~mem89_9|)) (.cse10 (= |v_ssl3_accept_#t~mem150.base_16| |v_ssl3_accept_#t~mem150.base_14|)) (.cse11 (= |v_ssl3_accept_#t~mem46_11| |v_ssl3_accept_#t~mem46_10|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.base_9| |v_ssl3_accept_#t~mem88.base_10|) .cse1 .cse2 .cse3 .cse4 (= |v_#memory_$Pointer$.base_270| |v_#memory_$Pointer$.base_276|) .cse5 (= |v_#memory_int_270| |v_#memory_int_275|) .cse6 .cse7 (= |v_#memory_$Pointer$.offset_270| |v_#memory_$Pointer$.offset_276|) .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem48_15| |v_ssl3_accept_#t~mem48_17|) .cse11 (= |v_ssl3_accept_#t~mem83.base_15| |v_ssl3_accept_#t~mem83.base_17|)) (and .cse0 .cse1 (= |v_#memory_$Pointer$.base_276| |v_#memory_$Pointer$.base_270|) .cse2 .cse3 (= |v_ssl3_accept_#t~mem83.base_17| |v_ssl3_accept_#t~mem83.base_15|) .cse4 (= |v_ssl3_accept_#t~mem48_17| |v_ssl3_accept_#t~mem48_15|) .cse5 .cse6 .cse7 (= |v_#memory_int_275| |v_#memory_int_270|) .cse8 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_9|) .cse9 .cse10 .cse11 (= |v_#memory_$Pointer$.offset_276| |v_#memory_$Pointer$.offset_270|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, 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_275|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, 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_270|, 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_270|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_270|, 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] {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} [715] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {6874#(= 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); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,056 INFO L290 TraceCheckUtils]: 46: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {6874#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:19,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {6874#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {6870#false} is VALID [2022-04-28 08:46:19,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {6870#false} assume !false; {6870#false} is VALID [2022-04-28 08:46:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:46:19,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:19,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832165672] [2022-04-28 08:46:19,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832165672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:19,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:19,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:46:22,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:22,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309554941] [2022-04-28 08:46:22,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309554941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:22,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:22,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 08:46:22,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556268892] [2022-04-28 08:46:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:22,577 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:46:22,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:22,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:22,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:22,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 08:46:22,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:22,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 08:46:22,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:46:22,639 INFO L87 Difference]: Start difference. First operand 313 states and 475 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:27,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:30,925 INFO L93 Difference]: Finished difference Result 469 states and 717 transitions. [2022-04-28 08:46:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 08:46:30,926 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 08:46:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 617 transitions. [2022-04-28 08:46:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 617 transitions. [2022-04-28 08:46:30,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 617 transitions. [2022-04-28 08:46:31,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:31,348 INFO L225 Difference]: With dead ends: 469 [2022-04-28 08:46:31,349 INFO L226 Difference]: Without dead ends: 322 [2022-04-28 08:46:31,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-28 08:46:31,350 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 146 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 463 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:46:31,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 926 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 629 Invalid, 1 Unknown, 463 Unchecked, 3.9s Time] [2022-04-28 08:46:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-28 08:46:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 313. [2022-04-28 08:46:31,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:31,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:31,360 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:31,361 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:31,365 INFO L93 Difference]: Finished difference Result 322 states and 486 transitions. [2022-04-28 08:46:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 486 transitions. [2022-04-28 08:46:31,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:31,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:31,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 322 states. [2022-04-28 08:46:31,367 INFO L87 Difference]: Start difference. First operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 322 states. [2022-04-28 08:46:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:31,372 INFO L93 Difference]: Finished difference Result 322 states and 486 transitions. [2022-04-28 08:46:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 486 transitions. [2022-04-28 08:46:31,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:31,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:31,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:31,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.5292207792207793) internal successors, (471), 308 states have internal predecessors, (471), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:31,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 475 transitions. [2022-04-28 08:46:31,378 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 475 transitions. Word has length 65 [2022-04-28 08:46:31,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:31,378 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 475 transitions. [2022-04-28 08:46:31,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:31,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 475 transitions. [2022-04-28 08:46:31,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 475 transitions. [2022-04-28 08:46:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:46:31,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:31,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:46:31,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:46:31,731 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:31,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1939266114, now seen corresponding path program 1 times [2022-04-28 08:46:31,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:31,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43092544] [2022-04-28 08:46:31,750 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:46:31,750 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:46:31,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:46:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1939266114, now seen corresponding path program 2 times [2022-04-28 08:46:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:31,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341249505] [2022-04-28 08:46:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:31,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:31,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9095#true} is VALID [2022-04-28 08:46:31,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {9095#true} assume true; {9095#true} is VALID [2022-04-28 08:46:31,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9095#true} {9095#true} #708#return; {9095#true} is VALID [2022-04-28 08:46:31,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {9095#true} call ULTIMATE.init(); {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:46:31,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {9102#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9095#true} is VALID [2022-04-28 08:46:31,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {9095#true} assume true; {9095#true} is VALID [2022-04-28 08:46:31,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9095#true} {9095#true} #708#return; {9095#true} is VALID [2022-04-28 08:46:31,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {9095#true} call #t~ret161 := main(); {9095#true} is VALID [2022-04-28 08:46:31,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {9095#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; {9095#true} is VALID [2022-04-28 08:46:31,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {9095#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9095#true} is VALID [2022-04-28 08:46:31,883 INFO L272 TraceCheckUtils]: 7: Hoare triple {9095#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9095#true} is VALID [2022-04-28 08:46:31,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {9095#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); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {9100#(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; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {9100#(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; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {9100#(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)))); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {9100#(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); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {9100#(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; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {9100#(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); {9100#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:46:31,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {9100#(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); {9101#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-28 08:46:31,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {9101#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {9096#false} is VALID [2022-04-28 08:46:31,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {9096#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {9096#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9096#false} is VALID [2022-04-28 08:46:31,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {9096#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {9096#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); {9096#false} is VALID [2022-04-28 08:46:31,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {9096#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {9096#false} is VALID [2022-04-28 08:46:31,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {9096#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); {9096#false} is VALID [2022-04-28 08:46:31,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {9096#false} assume 12292 != #t~mem85;havoc #t~mem85; {9096#false} is VALID [2022-04-28 08:46:31,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {9096#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; {9096#false} is VALID [2022-04-28 08:46:31,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {9096#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {9096#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {9096#false} is VALID [2022-04-28 08:46:31,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {9096#false} ~skip~0 := 0; {9096#false} is VALID [2022-04-28 08:46:31,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {9096#false} assume !false; {9096#false} is VALID [2022-04-28 08:46:31,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {9096#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {9096#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {9096#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,891 INFO L290 TraceCheckUtils]: 33: Hoare triple {9096#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,891 INFO L290 TraceCheckUtils]: 34: Hoare triple {9096#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {9096#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {9096#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {9096#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {9096#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {9096#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {9096#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {9096#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {9096#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {9096#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {9096#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {9096#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {9096#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {9096#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {9096#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {9096#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 50: Hoare triple {9096#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {9096#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {9096#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {9096#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {9096#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {9096#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {9096#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {9096#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {9096#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {9096#false} assume 8640 == #t~mem75;havoc #t~mem75; {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {9096#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {9096#false} assume !(4 == ~blastFlag~0); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {9096#false} assume !(7 == ~blastFlag~0); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {9096#false} assume !(10 == ~blastFlag~0); {9096#false} is VALID [2022-04-28 08:46:31,897 INFO L290 TraceCheckUtils]: 64: Hoare triple {9096#false} assume 13 == ~blastFlag~0; {9096#false} is VALID [2022-04-28 08:46:31,898 INFO L290 TraceCheckUtils]: 65: Hoare triple {9096#false} assume !false; {9096#false} is VALID [2022-04-28 08:46:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:46:31,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:31,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341249505] [2022-04-28 08:46:31,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341249505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:31,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:31,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:31,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [43092544] [2022-04-28 08:46:31,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [43092544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:31,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:31,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:46:31,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944967978] [2022-04-28 08:46:31,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:31,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:46:31,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:31,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:31,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:31,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:46:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:46:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:46:31,953 INFO L87 Difference]: Start difference. First operand 313 states and 475 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:35,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:41,456 INFO L93 Difference]: Finished difference Result 677 states and 1037 transitions. [2022-04-28 08:46:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:46:41,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:46:41,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-28 08:46:41,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-04-28 08:46:41,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 615 transitions. [2022-04-28 08:46:41,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:41,881 INFO L225 Difference]: With dead ends: 677 [2022-04-28 08:46:41,881 INFO L226 Difference]: Without dead ends: 523 [2022-04-28 08:46:41,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:46:41,882 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 153 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:46:41,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 366 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 08:46:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-28 08:46:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 325. [2022-04-28 08:46:41,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:41,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:41,900 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:41,901 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:41,912 INFO L93 Difference]: Finished difference Result 523 states and 794 transitions. [2022-04-28 08:46:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-28 08:46:41,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:41,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:41,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 08:46:41,914 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 08:46:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:41,924 INFO L93 Difference]: Finished difference Result 523 states and 794 transitions. [2022-04-28 08:46:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-28 08:46:41,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:41,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:41,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:41,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:41,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 490 transitions. [2022-04-28 08:46:41,931 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 490 transitions. Word has length 66 [2022-04-28 08:46:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:41,931 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 490 transitions. [2022-04-28 08:46:41,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:41,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 490 transitions. [2022-04-28 08:46:42,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 490 transitions. [2022-04-28 08:46:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:46:42,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:42,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:46:42,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:46:42,353 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1596653458, now seen corresponding path program 1 times [2022-04-28 08:46:42,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:42,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285055283] [2022-04-28 08:46:42,475 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-28 08:46:42,475 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:46:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -724691531, now seen corresponding path program 1 times [2022-04-28 08:46:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:42,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261003096] [2022-04-28 08:46:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:42,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:42,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12157#true} is VALID [2022-04-28 08:46:42,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {12157#true} assume true; {12157#true} is VALID [2022-04-28 08:46:42,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12157#true} {12157#true} #708#return; {12157#true} is VALID [2022-04-28 08:46:42,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {12157#true} call ULTIMATE.init(); {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:46:42,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {12163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12157#true} is VALID [2022-04-28 08:46:42,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {12157#true} assume true; {12157#true} is VALID [2022-04-28 08:46:42,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12157#true} {12157#true} #708#return; {12157#true} is VALID [2022-04-28 08:46:42,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {12157#true} call #t~ret161 := main(); {12157#true} is VALID [2022-04-28 08:46:42,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {12157#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; {12157#true} is VALID [2022-04-28 08:46:42,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {12157#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12157#true} is VALID [2022-04-28 08:46:42,591 INFO L272 TraceCheckUtils]: 7: Hoare triple {12157#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12157#true} is VALID [2022-04-28 08:46:42,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {12157#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); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {12162#(= 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; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {12162#(= 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; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {12162#(= 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)))); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} [718] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_int_305| |v_#memory_int_300|)) (.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|))) (or (and .cse0 .cse1 .cse2 (= |v_#memory_$Pointer$.offset_317| |v_#memory_$Pointer$.offset_311|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= |v_#memory_$Pointer$.base_317| |v_#memory_$Pointer$.base_311|)) (and (= |v_#memory_$Pointer$.offset_311| |v_#memory_$Pointer$.offset_317|) .cse0 (= |v_#memory_$Pointer$.base_311| |v_#memory_$Pointer$.base_317|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_317|, 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_305|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_317|, 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_311|, 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_300|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_311|, 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] {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} [717] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {12162#(= 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); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,599 INFO L290 TraceCheckUtils]: 39: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {12162#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:42,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {12162#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {12158#false} is VALID [2022-04-28 08:46:42,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {12158#false} assume !false; {12158#false} is VALID [2022-04-28 08:46:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:46:42,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:42,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261003096] [2022-04-28 08:46:42,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261003096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:42,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:42,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:46:45,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:46:45,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285055283] [2022-04-28 08:46:45,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285055283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:45,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:45,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 08:46:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836771199] [2022-04-28 08:46:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:46:45,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:46:45,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:46:45,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:45,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:45,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 08:46:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:45,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 08:46:45,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=2, NotChecked=0, Total=182 [2022-04-28 08:46:45,968 INFO L87 Difference]: Start difference. First operand 325 states and 490 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:50,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:55,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:46:57,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:57,319 INFO L93 Difference]: Finished difference Result 495 states and 752 transitions. [2022-04-28 08:46:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 08:46:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:46:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:46:57,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 616 transitions. [2022-04-28 08:46:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 616 transitions. [2022-04-28 08:46:57,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 616 transitions. [2022-04-28 08:46:57,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:57,731 INFO L225 Difference]: With dead ends: 495 [2022-04-28 08:46:57,731 INFO L226 Difference]: Without dead ends: 336 [2022-04-28 08:46:57,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=51, Invalid=129, Unknown=2, NotChecked=0, Total=182 [2022-04-28 08:46:57,732 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 146 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 702 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:46:57,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1224 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 659 Invalid, 0 Unknown, 702 Unchecked, 5.3s Time] [2022-04-28 08:46:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-04-28 08:46:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 327. [2022-04-28 08:46:57,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:46:57,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:57,744 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:57,745 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:57,750 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2022-04-28 08:46:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 504 transitions. [2022-04-28 08:46:57,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:57,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:57,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 336 states. [2022-04-28 08:46:57,751 INFO L87 Difference]: Start difference. First operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 336 states. [2022-04-28 08:46:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:46:57,756 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2022-04-28 08:46:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 504 transitions. [2022-04-28 08:46:57,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:46:57,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:46:57,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:46:57,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:46:57,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 322 states have (on average 1.5186335403726707) internal successors, (489), 322 states have internal predecessors, (489), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 493 transitions. [2022-04-28 08:46:57,763 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 493 transitions. Word has length 66 [2022-04-28 08:46:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:46:57,763 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 493 transitions. [2022-04-28 08:46:57,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:46:57,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 327 states and 493 transitions. [2022-04-28 08:46:58,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:46:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 493 transitions. [2022-04-28 08:46:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 08:46:58,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:46:58,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:46:58,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:46:58,394 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:46:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:46:58,395 INFO L85 PathProgramCache]: Analyzing trace with hash -770041136, now seen corresponding path program 1 times [2022-04-28 08:46:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:46:58,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [973613353] [2022-04-28 08:46:58,529 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-28 08:46:58,530 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:46:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1094519307, now seen corresponding path program 1 times [2022-04-28 08:46:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:46:58,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846272425] [2022-04-28 08:46:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:46:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:46:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:46:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:46:58,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14492#true} is VALID [2022-04-28 08:46:58,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {14492#true} assume true; {14492#true} is VALID [2022-04-28 08:46:58,629 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14492#true} {14492#true} #708#return; {14492#true} is VALID [2022-04-28 08:46:58,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {14492#true} call ULTIMATE.init(); {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:46:58,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {14498#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {14492#true} is VALID [2022-04-28 08:46:58,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {14492#true} assume true; {14492#true} is VALID [2022-04-28 08:46:58,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14492#true} {14492#true} #708#return; {14492#true} is VALID [2022-04-28 08:46:58,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {14492#true} call #t~ret161 := main(); {14492#true} is VALID [2022-04-28 08:46:58,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {14492#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; {14492#true} is VALID [2022-04-28 08:46:58,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {14492#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {14492#true} is VALID [2022-04-28 08:46:58,630 INFO L272 TraceCheckUtils]: 7: Hoare triple {14492#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {14492#true} is VALID [2022-04-28 08:46:58,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {14492#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); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {14497#(= 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; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {14497#(= 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; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {14497#(= 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)))); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} [720] 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_ssl3_accept_#t~mem83.base_33| |v_ssl3_accept_#t~mem83.base_31|)) (.cse6 (= |v_ssl3_accept_#t~mem46_22| |v_ssl3_accept_#t~mem46_21|)) (.cse7 (= |v_ssl3_accept_#t~mem47_35| |v_ssl3_accept_#t~mem47_33|)) (.cse8 (= v_ssl3_accept_~state~0_24 v_ssl3_accept_~state~0_23)) (.cse9 (= |v_ssl3_accept_#t~mem83.offset_33| |v_ssl3_accept_#t~mem83.offset_31|)) (.cse10 (= |v_ssl3_accept_#t~mem48_33| |v_ssl3_accept_#t~mem48_31|))) (or (and (= |v_ssl3_accept_#t~mem150.offset_28| |v_ssl3_accept_#t~mem150.offset_30|) .cse0 .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 (= |v_#memory_$Pointer$.base_331| |v_#memory_$Pointer$.base_337|) (= |v_ssl3_accept_#t~mem88.offset_19| |v_ssl3_accept_#t~mem88.offset_20|) .cse6 .cse7 .cse8 .cse9 (= |v_#memory_int_319| |v_#memory_int_324|) (= |v_#memory_$Pointer$.offset_331| |v_#memory_$Pointer$.offset_337|) (= |v_ssl3_accept_#t~mem49_15| |v_ssl3_accept_#t~mem49_17|) .cse10) (and .cse0 (= |v_#memory_int_324| |v_#memory_int_319|) (= |v_#memory_$Pointer$.base_337| |v_#memory_$Pointer$.base_331|) .cse1 .cse2 (= |v_#memory_$Pointer$.offset_337| |v_#memory_$Pointer$.offset_331|) (= |v_ssl3_accept_#t~mem49_17| |v_ssl3_accept_#t~mem49_15|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_28|) .cse6 .cse7 .cse8 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_28|) .cse9 (= |v_ssl3_accept_#t~mem88.base_20| |v_ssl3_accept_#t~mem88.base_19|) .cse10 (= |v_ssl3_accept_#t~mem88.offset_20| |v_ssl3_accept_#t~mem88.offset_19|)))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_337|, 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_324|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_337|, 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_331|, 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_319|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_19|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_331|, 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] {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} [719] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {14497#(= 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); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,638 INFO L290 TraceCheckUtils]: 43: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {14497#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:46:58,640 INFO L290 TraceCheckUtils]: 50: Hoare triple {14497#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {14493#false} is VALID [2022-04-28 08:46:58,640 INFO L290 TraceCheckUtils]: 51: Hoare triple {14493#false} assume !false; {14493#false} is VALID [2022-04-28 08:46:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:46:58,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:46:58,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846272425] [2022-04-28 08:46:58,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846272425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:46:58,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:46:58,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:47:01,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:01,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [973613353] [2022-04-28 08:47:01,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [973613353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:01,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:01,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 08:47:01,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30088777] [2022-04-28 08:47:01,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:01,708 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:47:01,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:01,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:01,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:01,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 08:47:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:01,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 08:47:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:47:01,765 INFO L87 Difference]: Start difference. First operand 327 states and 493 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:07,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:09,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:14,277 INFO L93 Difference]: Finished difference Result 496 states and 753 transitions. [2022-04-28 08:47:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 08:47:14,277 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 08:47:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 617 transitions. [2022-04-28 08:47:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 617 transitions. [2022-04-28 08:47:14,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 617 transitions. [2022-04-28 08:47:14,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:14,676 INFO L225 Difference]: With dead ends: 496 [2022-04-28 08:47:14,676 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 08:47:14,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-28 08:47:14,677 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 145 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:14,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 918 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 776 Invalid, 0 Unknown, 310 Unchecked, 6.1s Time] [2022-04-28 08:47:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 08:47:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 325. [2022-04-28 08:47:14,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:14,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:14,694 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:14,696 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:14,700 INFO L93 Difference]: Finished difference Result 337 states and 505 transitions. [2022-04-28 08:47:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 505 transitions. [2022-04-28 08:47:14,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:14,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:14,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-28 08:47:14,702 INFO L87 Difference]: Start difference. First operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-28 08:47:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:14,707 INFO L93 Difference]: Finished difference Result 337 states and 505 transitions. [2022-04-28 08:47:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 505 transitions. [2022-04-28 08:47:14,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:14,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:14,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:14,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 320 states have (on average 1.51875) internal successors, (486), 320 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 490 transitions. [2022-04-28 08:47:14,713 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 490 transitions. Word has length 66 [2022-04-28 08:47:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:14,714 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 490 transitions. [2022-04-28 08:47:14,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:14,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 325 states and 490 transitions. [2022-04-28 08:47:15,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 490 transitions. [2022-04-28 08:47:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:47:15,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:15,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:47:15,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:47:15,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash -493596445, now seen corresponding path program 1 times [2022-04-28 08:47:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:15,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788762416] [2022-04-28 08:47:15,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:47:15,933 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:47:15,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:47:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -493596445, now seen corresponding path program 2 times [2022-04-28 08:47:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:15,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957554112] [2022-04-28 08:47:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:16,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:16,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16827#true} is VALID [2022-04-28 08:47:16,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {16827#true} assume true; {16827#true} is VALID [2022-04-28 08:47:16,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16827#true} {16827#true} #708#return; {16827#true} is VALID [2022-04-28 08:47:16,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {16827#true} call ULTIMATE.init(); {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:47:16,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {16834#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16827#true} is VALID [2022-04-28 08:47:16,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {16827#true} assume true; {16827#true} is VALID [2022-04-28 08:47:16,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16827#true} {16827#true} #708#return; {16827#true} is VALID [2022-04-28 08:47:16,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {16827#true} call #t~ret161 := main(); {16827#true} is VALID [2022-04-28 08:47:16,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {16827#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; {16827#true} is VALID [2022-04-28 08:47:16,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {16827#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16827#true} is VALID [2022-04-28 08:47:16,079 INFO L272 TraceCheckUtils]: 7: Hoare triple {16827#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16827#true} is VALID [2022-04-28 08:47:16,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {16827#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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(not (= 8192 (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; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {16832#(not (= 8192 (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; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {16832#(not (= 8192 (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)))); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {16832#(not (= 8192 (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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {16832#(not (= 8192 (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; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {16832#(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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {16832#(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); {16832#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:47:16,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {16832#(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); {16833#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-28 08:47:16,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {16833#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {16828#false} is VALID [2022-04-28 08:47:16,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {16828#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {16828#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {16828#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {16828#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); {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {16828#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {16828#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); {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {16828#false} assume 12292 != #t~mem85;havoc #t~mem85; {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {16828#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; {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {16828#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {16828#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {16828#false} ~skip~0 := 0; {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {16828#false} assume !false; {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {16828#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {16828#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {16828#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {16828#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {16828#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {16828#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {16828#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {16828#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {16828#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {16828#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {16828#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 42: Hoare triple {16828#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {16828#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {16828#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 45: Hoare triple {16828#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 46: Hoare triple {16828#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,086 INFO L290 TraceCheckUtils]: 47: Hoare triple {16828#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {16828#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {16828#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 50: Hoare triple {16828#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {16828#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {16828#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {16828#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {16828#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 55: Hoare triple {16828#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 56: Hoare triple {16828#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 57: Hoare triple {16828#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 58: Hoare triple {16828#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 59: Hoare triple {16828#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16828#false} is VALID [2022-04-28 08:47:16,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {16828#false} assume 8640 == #t~mem75;havoc #t~mem75; {16828#false} is VALID [2022-04-28 08:47:16,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {16828#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {16828#false} is VALID [2022-04-28 08:47:16,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {16828#false} assume !(4 == ~blastFlag~0); {16828#false} is VALID [2022-04-28 08:47:16,088 INFO L290 TraceCheckUtils]: 63: Hoare triple {16828#false} assume !(7 == ~blastFlag~0); {16828#false} is VALID [2022-04-28 08:47:16,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {16828#false} assume !(10 == ~blastFlag~0); {16828#false} is VALID [2022-04-28 08:47:16,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {16828#false} assume 13 == ~blastFlag~0; {16828#false} is VALID [2022-04-28 08:47:16,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {16828#false} assume !false; {16828#false} is VALID [2022-04-28 08:47:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:47:16,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:16,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957554112] [2022-04-28 08:47:16,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957554112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:16,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:16,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:16,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:16,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788762416] [2022-04-28 08:47:16,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788762416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:16,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:16,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359628052] [2022-04-28 08:47:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:16,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:47:16,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:16,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:16,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:16,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:47:16,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:16,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:47:16,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:47:16,139 INFO L87 Difference]: Start difference. First operand 325 states and 490 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:18,053 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-28 08:47:20,942 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-28 08:47:22,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:24,869 INFO L93 Difference]: Finished difference Result 689 states and 1050 transitions. [2022-04-28 08:47:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:47:24,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:47:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-28 08:47:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-04-28 08:47:24,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 614 transitions. [2022-04-28 08:47:25,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 614 edges. 614 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:25,277 INFO L225 Difference]: With dead ends: 689 [2022-04-28 08:47:25,277 INFO L226 Difference]: Without dead ends: 523 [2022-04-28 08:47:25,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:47:25,284 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 151 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:25,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 366 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 484 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 08:47:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-28 08:47:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 326. [2022-04-28 08:47:25,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:25,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:25,330 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:25,331 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:25,339 INFO L93 Difference]: Finished difference Result 523 states and 790 transitions. [2022-04-28 08:47:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 790 transitions. [2022-04-28 08:47:25,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:25,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:25,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 08:47:25,341 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 08:47:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:25,350 INFO L93 Difference]: Finished difference Result 523 states and 790 transitions. [2022-04-28 08:47:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 790 transitions. [2022-04-28 08:47:25,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:25,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:25,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:25,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2022-04-28 08:47:25,356 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 67 [2022-04-28 08:47:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:25,356 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2022-04-28 08:47:25,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:25,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 488 transitions. [2022-04-28 08:47:26,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2022-04-28 08:47:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:47:26,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:26,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:47:26,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:47:26,391 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash -699706350, now seen corresponding path program 1 times [2022-04-28 08:47:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586639231] [2022-04-28 08:47:26,552 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:47:26,553 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:47:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1464347083, now seen corresponding path program 1 times [2022-04-28 08:47:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:26,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891257979] [2022-04-28 08:47:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:26,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19915#true} is VALID [2022-04-28 08:47:26,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {19915#true} assume true; {19915#true} is VALID [2022-04-28 08:47:26,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19915#true} {19915#true} #708#return; {19915#true} is VALID [2022-04-28 08:47:26,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {19915#true} call ULTIMATE.init(); {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:47:26,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {19921#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {19915#true} is VALID [2022-04-28 08:47:26,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {19915#true} assume true; {19915#true} is VALID [2022-04-28 08:47:26,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19915#true} {19915#true} #708#return; {19915#true} is VALID [2022-04-28 08:47:26,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {19915#true} call #t~ret161 := main(); {19915#true} is VALID [2022-04-28 08:47:26,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {19915#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; {19915#true} is VALID [2022-04-28 08:47:26,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {19915#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {19915#true} is VALID [2022-04-28 08:47:26,685 INFO L272 TraceCheckUtils]: 7: Hoare triple {19915#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {19915#true} is VALID [2022-04-28 08:47:26,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {19915#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); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {19920#(= 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; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {19920#(= 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; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {19920#(= 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)))); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} [722] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_42| |v_ssl3_accept_#t~mem82_40|)) (.cse1 (= |v_ssl3_accept_#t~mem83.offset_42| |v_ssl3_accept_#t~mem83.offset_40|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_38| |v_ssl3_accept_#t~mem150.offset_36|)) (.cse3 (= |v_ssl3_accept_#t~mem46_28| |v_ssl3_accept_#t~mem46_27|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_25| |v_ssl3_accept_#t~mem88.base_24|)) (.cse5 (= |v_ssl3_accept_#t~mem50_10| |v_ssl3_accept_#t~mem50_8|)) (.cse6 (= |v_ssl3_accept_#t~mem89_25| |v_ssl3_accept_#t~mem89_24|)) (.cse7 (= |v_ssl3_accept_#t~mem83.base_42| |v_ssl3_accept_#t~mem83.base_40|)) (.cse8 (= |v_ssl3_accept_#t~mem48_42| |v_ssl3_accept_#t~mem48_40|)) (.cse9 (= |v_ssl3_accept_#t~mem47_44| |v_ssl3_accept_#t~mem47_42|)) (.cse10 (= v_ssl3_accept_~skip~0_38 v_ssl3_accept_~skip~0_37)) (.cse11 (= |v_ssl3_accept_#t~mem150.base_38| |v_ssl3_accept_#t~mem150.base_36|)) (.cse12 (= |v_ssl3_accept_#t~mem49_26| |v_ssl3_accept_#t~mem49_24|)) (.cse13 (= |v_ssl3_accept_#t~mem88.offset_25| |v_ssl3_accept_#t~mem88.offset_24|))) (or (and .cse0 .cse1 (= |v_#memory_$Pointer$.offset_372| |v_#memory_$Pointer$.offset_378|) .cse2 (= |v_ssl3_accept_#t~mem151_38| |v_ssl3_accept_#t~mem151_40|) .cse3 .cse4 (= |v_#memory_$Pointer$.base_372| |v_#memory_$Pointer$.base_378|) .cse5 .cse6 .cse7 (= v_ssl3_accept_~state~0_29 v_ssl3_accept_~state~0_30) (= |v_#memory_int_349| |v_#memory_int_354|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |v_ssl3_accept_#t~mem85_40| |v_ssl3_accept_#t~mem85_42|)) (and .cse0 .cse1 .cse2 (= |v_#memory_$Pointer$.offset_378| |v_#memory_$Pointer$.offset_372|) .cse3 .cse4 (= v_ssl3_accept_~state~0_30 v_ssl3_accept_~state~0_29) .cse5 .cse6 .cse7 .cse8 (= |v_#memory_int_354| |v_#memory_int_349|) (= |v_ssl3_accept_#t~mem151_40| |v_ssl3_accept_#t~mem151_38|) (= |v_#memory_$Pointer$.base_378| |v_#memory_$Pointer$.base_372|) .cse9 (= |v_ssl3_accept_#t~mem85_42| |v_ssl3_accept_#t~mem85_40|) .cse10 .cse11 .cse12 .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_42|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_378|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_42|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_42|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_40|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_38|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_25|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_42|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_26|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_42|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_38|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_44|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_28|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_38, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_25|, #memory_int=|v_#memory_int_354|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_25|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_378|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_30} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_40|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_372|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_40|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_40|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_38|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_36|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_24|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_40|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_24|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_40|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_36|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_42|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_27|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_37, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_24|, #memory_int=|v_#memory_int_349|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_24|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_372|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_29} 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~mem50, 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] {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} [721] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {19920#(= 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); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,695 INFO L290 TraceCheckUtils]: 38: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,698 INFO L290 TraceCheckUtils]: 49: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {19920#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:26,699 INFO L290 TraceCheckUtils]: 50: Hoare triple {19920#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {19916#false} is VALID [2022-04-28 08:47:26,699 INFO L290 TraceCheckUtils]: 51: Hoare triple {19916#false} assume !false; {19916#false} is VALID [2022-04-28 08:47:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:47:26,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:26,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891257979] [2022-04-28 08:47:26,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891257979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:26,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:26,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:47:31,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:31,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586639231] [2022-04-28 08:47:31,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586639231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:31,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:31,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 08:47:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846387586] [2022-04-28 08:47:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:47:31,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:31,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:31,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:31,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 08:47:31,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:31,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 08:47:31,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:47:31,559 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:33,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:36,732 INFO L93 Difference]: Finished difference Result 497 states and 749 transitions. [2022-04-28 08:47:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 08:47:36,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:47:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 456 transitions. [2022-04-28 08:47:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:36,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 456 transitions. [2022-04-28 08:47:36,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 456 transitions. [2022-04-28 08:47:37,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 456 edges. 456 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:37,048 INFO L225 Difference]: With dead ends: 497 [2022-04-28 08:47:37,048 INFO L226 Difference]: Without dead ends: 337 [2022-04-28 08:47:37,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:47:37,049 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 9 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 408 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:37,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 992 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 728 Invalid, 1 Unknown, 408 Unchecked, 3.0s Time] [2022-04-28 08:47:37,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-04-28 08:47:37,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 328. [2022-04-28 08:47:37,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:37,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:37,061 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:37,061 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:37,066 INFO L93 Difference]: Finished difference Result 337 states and 501 transitions. [2022-04-28 08:47:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2022-04-28 08:47:37,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:37,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:37,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-28 08:47:37,067 INFO L87 Difference]: Start difference. First operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 337 states. [2022-04-28 08:47:37,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:37,071 INFO L93 Difference]: Finished difference Result 337 states and 501 transitions. [2022-04-28 08:47:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2022-04-28 08:47:37,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:37,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:37,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:37,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:37,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 323 states have internal predecessors, (487), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 491 transitions. [2022-04-28 08:47:37,077 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 491 transitions. Word has length 67 [2022-04-28 08:47:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:37,077 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 491 transitions. [2022-04-28 08:47:37,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:37,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 328 states and 491 transitions. [2022-04-28 08:47:39,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:39,079 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 491 transitions. [2022-04-28 08:47:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 08:47:39,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:39,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:47:39,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:47:39,080 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1228566352, now seen corresponding path program 1 times [2022-04-28 08:47:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:39,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [889843325] [2022-04-28 08:47:39,298 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 20 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:47:39,298 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:47:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1834174859, now seen corresponding path program 1 times [2022-04-28 08:47:39,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:39,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002667390] [2022-04-28 08:47:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:39,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22259#true} is VALID [2022-04-28 08:47:39,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {22259#true} assume true; {22259#true} is VALID [2022-04-28 08:47:39,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22259#true} {22259#true} #708#return; {22259#true} is VALID [2022-04-28 08:47:39,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {22259#true} call ULTIMATE.init(); {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:47:39,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {22265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22259#true} is VALID [2022-04-28 08:47:39,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {22259#true} assume true; {22259#true} is VALID [2022-04-28 08:47:39,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22259#true} {22259#true} #708#return; {22259#true} is VALID [2022-04-28 08:47:39,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {22259#true} call #t~ret161 := main(); {22259#true} is VALID [2022-04-28 08:47:39,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {22259#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; {22259#true} is VALID [2022-04-28 08:47:39,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {22259#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22259#true} is VALID [2022-04-28 08:47:39,427 INFO L272 TraceCheckUtils]: 7: Hoare triple {22259#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22259#true} is VALID [2022-04-28 08:47:39,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {22259#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); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {22264#(= 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; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {22264#(= 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; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {22264#(= 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)))); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} [724] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_30| |v_ssl3_accept_#t~mem88.offset_29|)) (.cse1 (= |v_ssl3_accept_#t~mem82_49| |v_ssl3_accept_#t~mem82_47|)) (.cse2 (= |v_ssl3_accept_#t~mem150.base_44| |v_ssl3_accept_#t~mem150.base_42|)) (.cse3 (= |v_ssl3_accept_#t~mem85_49| |v_ssl3_accept_#t~mem85_47|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_30| |v_ssl3_accept_#t~mem88.base_29|)) (.cse5 (= |v_ssl3_accept_#t~mem46_33| |v_ssl3_accept_#t~mem46_32|)) (.cse6 (= |v_ssl3_accept_#t~mem150.offset_44| |v_ssl3_accept_#t~mem150.offset_42|)) (.cse7 (= v_ssl3_accept_~state~0_35 v_ssl3_accept_~state~0_34)) (.cse8 (= |v_ssl3_accept_#t~mem49_33| |v_ssl3_accept_#t~mem49_31|)) (.cse9 (= |v_ssl3_accept_#t~mem151_46| |v_ssl3_accept_#t~mem151_44|)) (.cse10 (= |v_ssl3_accept_#t~mem50_17| |v_ssl3_accept_#t~mem50_15|)) (.cse11 (= |v_ssl3_accept_#t~mem83.offset_49| |v_ssl3_accept_#t~mem83.offset_47|)) (.cse12 (= v_ssl3_accept_~skip~0_43 v_ssl3_accept_~skip~0_42))) (or (and (= |v_ssl3_accept_#t~mem48_49| |v_ssl3_accept_#t~mem48_47|) .cse0 .cse1 .cse2 .cse3 (= |v_ssl3_accept_#t~mem89_30| |v_ssl3_accept_#t~mem89_29|) .cse4 .cse5 .cse6 (= |v_#memory_int_373| |v_#memory_int_368|) .cse7 .cse8 .cse9 (= |v_#memory_$Pointer$.offset_398| |v_#memory_$Pointer$.offset_392|) (= |v_#memory_$Pointer$.base_398| |v_#memory_$Pointer$.base_392|) .cse10 (= |v_ssl3_accept_#t~mem83.base_49| |v_ssl3_accept_#t~mem83.base_47|) (= |v_ssl3_accept_#t~mem47_51| |v_ssl3_accept_#t~mem47_49|) .cse11 .cse12) (and (= |v_ssl3_accept_#t~mem89_29| |v_ssl3_accept_#t~mem89_30|) (= |v_#memory_int_368| |v_#memory_int_373|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem83.base_47| |v_ssl3_accept_#t~mem83.base_49|) (= |v_#memory_$Pointer$.offset_392| |v_#memory_$Pointer$.offset_398|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_#memory_$Pointer$.base_392| |v_#memory_$Pointer$.base_398|) (= |v_ssl3_accept_#t~mem47_49| |v_ssl3_accept_#t~mem47_51|) .cse11 (= |v_ssl3_accept_#t~mem48_47| |v_ssl3_accept_#t~mem48_49|) .cse12))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_49|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_398|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_49|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_49|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_46|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_44|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_17|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_30|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_49|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_33|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_49|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_44|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_51|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_33|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_43, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_30|, #memory_int=|v_#memory_int_373|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_30|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_398|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_35} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_47|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_392|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_47|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_47|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_44|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_42|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_15|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_29|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_47|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_31|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_47|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_42|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_49|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_32|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_42, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_29|, #memory_int=|v_#memory_int_368|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_29|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_392|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_34} 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~mem50, 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] {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} [723] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {22264#(= 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); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,436 INFO L290 TraceCheckUtils]: 37: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,436 INFO L290 TraceCheckUtils]: 38: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {22264#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:47:39,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {22264#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {22260#false} is VALID [2022-04-28 08:47:39,439 INFO L290 TraceCheckUtils]: 51: Hoare triple {22260#false} assume !false; {22260#false} is VALID [2022-04-28 08:47:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:47:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:39,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002667390] [2022-04-28 08:47:39,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002667390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:39,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:39,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:47:42,863 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:42,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [889843325] [2022-04-28 08:47:42,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [889843325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:42,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:42,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 08:47:42,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137277953] [2022-04-28 08:47:42,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:47:42,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:42,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:42,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 08:47:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 08:47:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:47:42,930 INFO L87 Difference]: Start difference. First operand 328 states and 491 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:46,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:48,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:50,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:47:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:56,110 INFO L93 Difference]: Finished difference Result 498 states and 750 transitions. [2022-04-28 08:47:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 08:47:56,110 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 08:47:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:47:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 457 transitions. [2022-04-28 08:47:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 457 transitions. [2022-04-28 08:47:56,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 457 transitions. [2022-04-28 08:47:56,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:56,437 INFO L225 Difference]: With dead ends: 498 [2022-04-28 08:47:56,437 INFO L226 Difference]: Without dead ends: 338 [2022-04-28 08:47:56,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=54, Invalid=155, Unknown=1, NotChecked=0, Total=210 [2022-04-28 08:47:56,438 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 10 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:47:56,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 860 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 628 Invalid, 2 Unknown, 305 Unchecked, 8.3s Time] [2022-04-28 08:47:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-28 08:47:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 326. [2022-04-28 08:47:56,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:47:56,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:56,451 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:56,451 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:56,457 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-28 08:47:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-28 08:47:56,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:56,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:56,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-28 08:47:56,459 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-28 08:47:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:47:56,463 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-28 08:47:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-28 08:47:56,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:47:56,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:47:56,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:47:56,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:47:56,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5077881619937694) internal successors, (484), 321 states have internal predecessors, (484), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 488 transitions. [2022-04-28 08:47:56,469 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 488 transitions. Word has length 67 [2022-04-28 08:47:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:47:56,470 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 488 transitions. [2022-04-28 08:47:56,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:56,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 488 transitions. [2022-04-28 08:47:58,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 487 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 488 transitions. [2022-04-28 08:47:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 08:47:58,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:47:58,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:47:58,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:47:58,968 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:47:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:47:58,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1333693539, now seen corresponding path program 1 times [2022-04-28 08:47:58,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:58,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851157635] [2022-04-28 08:47:58,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:47:58,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:47:58,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:47:58,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1333693539, now seen corresponding path program 2 times [2022-04-28 08:47:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:47:58,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827642092] [2022-04-28 08:47:58,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:47:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:47:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:47:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:47:59,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24603#true} is VALID [2022-04-28 08:47:59,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {24603#true} assume true; {24603#true} is VALID [2022-04-28 08:47:59,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24603#true} {24603#true} #708#return; {24603#true} is VALID [2022-04-28 08:47:59,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {24603#true} call ULTIMATE.init(); {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:47:59,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {24610#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {24603#true} is VALID [2022-04-28 08:47:59,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {24603#true} assume true; {24603#true} is VALID [2022-04-28 08:47:59,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24603#true} {24603#true} #708#return; {24603#true} is VALID [2022-04-28 08:47:59,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {24603#true} call #t~ret161 := main(); {24603#true} is VALID [2022-04-28 08:47:59,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {24603#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; {24603#true} is VALID [2022-04-28 08:47:59,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {24603#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {24603#true} is VALID [2022-04-28 08:47:59,138 INFO L272 TraceCheckUtils]: 7: Hoare triple {24603#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {24603#true} is VALID [2022-04-28 08:47:59,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {24603#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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {24608#(= 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; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {24608#(= 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; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {24608#(= 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)))); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {24608#(= 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; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {24608#(= 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); {24608#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:47:59,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {24608#(= 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); {24609#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-28 08:47:59,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {24609#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {24604#false} is VALID [2022-04-28 08:47:59,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {24604#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {24604#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {24604#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {24604#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); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {24604#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {24604#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); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {24604#false} assume 12292 != #t~mem85;havoc #t~mem85; {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {24604#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; {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {24604#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {24604#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {24604#false} ~skip~0 := 0; {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {24604#false} assume !false; {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {24604#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {24604#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {24604#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {24604#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {24604#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {24604#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {24604#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {24604#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {24604#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {24604#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {24604#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {24604#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {24604#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {24604#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {24604#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {24604#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {24604#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {24604#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {24604#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {24604#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {24604#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {24604#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {24604#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {24604#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {24604#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {24604#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {24604#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {24604#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {24604#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {24604#false} assume 8640 == #t~mem75;havoc #t~mem75; {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {24604#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {24604#false} assume !(4 == ~blastFlag~0); {24604#false} is VALID [2022-04-28 08:47:59,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {24604#false} assume !(7 == ~blastFlag~0); {24604#false} is VALID [2022-04-28 08:47:59,148 INFO L290 TraceCheckUtils]: 65: Hoare triple {24604#false} assume !(10 == ~blastFlag~0); {24604#false} is VALID [2022-04-28 08:47:59,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {24604#false} assume 13 == ~blastFlag~0; {24604#false} is VALID [2022-04-28 08:47:59,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {24604#false} assume !false; {24604#false} is VALID [2022-04-28 08:47:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:47:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:47:59,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827642092] [2022-04-28 08:47:59,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827642092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:59,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:59,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:59,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:47:59,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851157635] [2022-04-28 08:47:59,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851157635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:47:59,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:47:59,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:47:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259027560] [2022-04-28 08:47:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:47:59,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:47:59,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:47:59,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:47:59,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:47:59,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:47:59,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:47:59,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:47:59,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:47:59,198 INFO L87 Difference]: Start difference. First operand 326 states and 488 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:01,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:03,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:07,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:12,895 INFO L93 Difference]: Finished difference Result 509 states and 763 transitions. [2022-04-28 08:48:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:48:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:48:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:48:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 08:48:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 461 transitions. [2022-04-28 08:48:12,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 461 transitions. [2022-04-28 08:48:13,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:13,202 INFO L225 Difference]: With dead ends: 509 [2022-04-28 08:48:13,202 INFO L226 Difference]: Without dead ends: 342 [2022-04-28 08:48:13,202 INFO L412 NwaCegarLoop]: 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-28 08:48:13,203 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 21 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:48:13,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 509 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 369 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 08:48:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-28 08:48:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 326. [2022-04-28 08:48:13,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:48:13,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:13,214 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:13,215 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:13,219 INFO L93 Difference]: Finished difference Result 342 states and 506 transitions. [2022-04-28 08:48:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 506 transitions. [2022-04-28 08:48:13,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:13,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:13,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 342 states. [2022-04-28 08:48:13,221 INFO L87 Difference]: Start difference. First operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 342 states. [2022-04-28 08:48:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:13,226 INFO L93 Difference]: Finished difference Result 342 states and 506 transitions. [2022-04-28 08:48:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 506 transitions. [2022-04-28 08:48:13,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:13,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:13,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:48:13,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:48:13,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 487 transitions. [2022-04-28 08:48:13,232 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 487 transitions. Word has length 68 [2022-04-28 08:48:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:48:13,232 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 487 transitions. [2022-04-28 08:48:13,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:13,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 326 states and 487 transitions. [2022-04-28 08:48:15,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 486 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 487 transitions. [2022-04-28 08:48:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 08:48:15,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:48:15,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:48:15,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:48:15,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:48:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:48:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1680521453, now seen corresponding path program 1 times [2022-04-28 08:48:15,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:15,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015593645] [2022-04-28 08:48:16,080 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:48:16,081 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:48:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2090964661, now seen corresponding path program 1 times [2022-04-28 08:48:16,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:48:16,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237882274] [2022-04-28 08:48:16,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:48:16,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:48:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:48:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:16,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26969#true} is VALID [2022-04-28 08:48:16,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {26969#true} assume true; {26969#true} is VALID [2022-04-28 08:48:16,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26969#true} {26969#true} #708#return; {26969#true} is VALID [2022-04-28 08:48:16,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {26969#true} call ULTIMATE.init(); {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:48:16,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {26975#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26969#true} is VALID [2022-04-28 08:48:16,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {26969#true} assume true; {26969#true} is VALID [2022-04-28 08:48:16,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26969#true} {26969#true} #708#return; {26969#true} is VALID [2022-04-28 08:48:16,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {26969#true} call #t~ret161 := main(); {26969#true} is VALID [2022-04-28 08:48:16,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {26969#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; {26969#true} is VALID [2022-04-28 08:48:16,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {26969#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26969#true} is VALID [2022-04-28 08:48:16,202 INFO L272 TraceCheckUtils]: 7: Hoare triple {26969#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26969#true} is VALID [2022-04-28 08:48:16,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {26969#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); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {26974#(= 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; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {26974#(= 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; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {26974#(= 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)))); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} [726] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem47_60| |v_ssl3_accept_#t~mem47_58|)) (.cse1 (= v_ssl3_accept_~skip~0_49 v_ssl3_accept_~skip~0_48)) (.cse2 (= |v_ssl3_accept_#t~mem50_26| |v_ssl3_accept_#t~mem50_24|)) (.cse3 (= |v_ssl3_accept_#t~mem46_39| |v_ssl3_accept_#t~mem46_38|)) (.cse4 (= |v_ssl3_accept_#t~mem88.base_35| |v_ssl3_accept_#t~mem88.base_34|)) (.cse5 (= |v_ssl3_accept_#t~mem85_58| |v_ssl3_accept_#t~mem85_56|)) (.cse6 (= |v_ssl3_accept_#t~mem82_58| |v_ssl3_accept_#t~mem82_56|)) (.cse7 (= |v_ssl3_accept_#t~mem151_54| |v_ssl3_accept_#t~mem151_52|)) (.cse8 (= |v_ssl3_accept_#t~mem83.offset_58| |v_ssl3_accept_#t~mem83.offset_56|)) (.cse9 (= |v_ssl3_accept_#t~mem51_10| |v_ssl3_accept_#t~mem51_8|)) (.cse10 (= |v_ssl3_accept_#t~mem49_42| |v_ssl3_accept_#t~mem49_40|)) (.cse11 (= |v_ssl3_accept_#t~mem83.base_58| |v_ssl3_accept_#t~mem83.base_56|)) (.cse12 (= v_ssl3_accept_~state~0_41 v_ssl3_accept_~state~0_40)) (.cse13 (= |v_ssl3_accept_#t~mem150.offset_52| |v_ssl3_accept_#t~mem150.offset_50|)) (.cse14 (= |v_ssl3_accept_#t~mem48_58| |v_ssl3_accept_#t~mem48_56|)) (.cse15 (= |v_ssl3_accept_#t~mem150.base_52| |v_ssl3_accept_#t~mem150.base_50|))) (or (and .cse0 (= |v_ssl3_accept_#t~mem88.offset_35| |v_ssl3_accept_#t~mem88.offset_34|) (= |v_ssl3_accept_#t~mem89_35| |v_ssl3_accept_#t~mem89_34|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_#memory_$Pointer$.base_439| |v_#memory_$Pointer$.base_433|) .cse6 (= |v_#memory_$Pointer$.offset_439| |v_#memory_$Pointer$.offset_433|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_403| |v_#memory_int_398|) .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 (= |v_#memory_$Pointer$.offset_433| |v_#memory_$Pointer$.offset_439|) .cse4 (= |v_ssl3_accept_#t~mem89_34| |v_ssl3_accept_#t~mem89_35|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_#memory_int_398| |v_#memory_int_403|) (= |v_ssl3_accept_#t~mem88.offset_34| |v_ssl3_accept_#t~mem88.offset_35|) .cse12 (= |v_#memory_$Pointer$.base_433| |v_#memory_$Pointer$.base_439|) .cse13 .cse14 .cse15))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_58|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_439|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_58|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_58|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_54|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_52|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_26|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_35|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_58|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_42|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_58|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_52|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_60|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_39|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_49, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_35|, #memory_int=|v_#memory_int_403|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_439|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_41} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_56|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_433|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_56|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_56|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_52|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_8|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_50|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_34|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_56|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_40|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_56|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_50|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_58|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_38|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_48, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_34|, #memory_int=|v_#memory_int_398|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_34|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_433|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_40} 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~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, 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] {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} [725] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {26974#(= 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); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,212 INFO L290 TraceCheckUtils]: 42: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {26974#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:16,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {26974#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {26970#false} is VALID [2022-04-28 08:48:16,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {26970#false} assume !false; {26970#false} is VALID [2022-04-28 08:48:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:48:16,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:48:16,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237882274] [2022-04-28 08:48:16,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237882274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:16,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:16,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:48:20,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:48:20,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015593645] [2022-04-28 08:48:20,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015593645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:20,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:20,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 08:48:20,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570307796] [2022-04-28 08:48:20,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:48:20,372 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:48:20,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:48:20,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:20,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:20,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 08:48:20,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 08:48:20,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-28 08:48:20,447 INFO L87 Difference]: Start difference. First operand 326 states and 487 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:24,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:29,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:31,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:33,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:48:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:41,714 INFO L93 Difference]: Finished difference Result 498 states and 750 transitions. [2022-04-28 08:48:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 08:48:41,714 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:48:41,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:48:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-04-28 08:48:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:41,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 617 transitions. [2022-04-28 08:48:41,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 617 transitions. [2022-04-28 08:48:42,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:42,139 INFO L225 Difference]: With dead ends: 498 [2022-04-28 08:48:42,139 INFO L226 Difference]: Without dead ends: 338 [2022-04-28 08:48:42,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-28 08:48:42,139 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 143 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:48:42,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 972 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1056 Invalid, 2 Unknown, 154 Unchecked, 11.7s Time] [2022-04-28 08:48:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-28 08:48:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 328. [2022-04-28 08:48:42,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:48:42,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:42,152 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:42,152 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:42,156 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-28 08:48:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-28 08:48:42,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:42,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:42,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-28 08:48:42,157 INFO L87 Difference]: Start difference. First operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 338 states. [2022-04-28 08:48:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:48:42,162 INFO L93 Difference]: Finished difference Result 338 states and 502 transitions. [2022-04-28 08:48:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2022-04-28 08:48:42,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:48:42,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:48:42,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:48:42,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:48:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 323 states have internal predecessors, (486), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 490 transitions. [2022-04-28 08:48:42,167 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 490 transitions. Word has length 68 [2022-04-28 08:48:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:48:42,168 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 490 transitions. [2022-04-28 08:48:42,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:42,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 328 states and 490 transitions. [2022-04-28 08:48:44,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 489 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 490 transitions. [2022-04-28 08:48:44,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 08:48:44,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:48:44,787 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:48:44,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:48:44,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:48:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:48:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash -686173141, now seen corresponding path program 1 times [2022-04-28 08:48:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:44,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [730731812] [2022-04-28 08:48:45,077 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 21 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 08:48:45,077 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:48:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1721136885, now seen corresponding path program 1 times [2022-04-28 08:48:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:48:45,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362294596] [2022-04-28 08:48:45,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:48:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:48:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:48:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:48:45,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29318#true} is VALID [2022-04-28 08:48:45,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {29318#true} assume true; {29318#true} is VALID [2022-04-28 08:48:45,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29318#true} {29318#true} #708#return; {29318#true} is VALID [2022-04-28 08:48:45,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {29318#true} call ULTIMATE.init(); {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:48:45,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {29324#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {29318#true} is VALID [2022-04-28 08:48:45,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {29318#true} assume true; {29318#true} is VALID [2022-04-28 08:48:45,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29318#true} {29318#true} #708#return; {29318#true} is VALID [2022-04-28 08:48:45,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {29318#true} call #t~ret161 := main(); {29318#true} is VALID [2022-04-28 08:48:45,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {29318#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; {29318#true} is VALID [2022-04-28 08:48:45,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {29318#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {29318#true} is VALID [2022-04-28 08:48:45,238 INFO L272 TraceCheckUtils]: 7: Hoare triple {29318#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {29318#true} is VALID [2022-04-28 08:48:45,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {29318#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); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {29323#(= 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; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {29323#(= 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; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {29323#(= 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)))); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} [728] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem89_40| |v_ssl3_accept_#t~mem89_39|)) (.cse1 (= |v_ssl3_accept_#t~mem51_17| |v_ssl3_accept_#t~mem51_15|)) (.cse2 (= |v_#memory_int_422| |v_#memory_int_417|)) (.cse3 (= |v_ssl3_accept_#t~mem150.offset_58| |v_ssl3_accept_#t~mem150.offset_56|)) (.cse4 (= |v_ssl3_accept_#t~mem83.base_65| |v_ssl3_accept_#t~mem83.base_63|)) (.cse5 (= |v_ssl3_accept_#t~mem50_33| |v_ssl3_accept_#t~mem50_31|)) (.cse6 (= |v_ssl3_accept_#t~mem47_67| |v_ssl3_accept_#t~mem47_65|)) (.cse7 (= |v_ssl3_accept_#t~mem49_49| |v_ssl3_accept_#t~mem49_47|)) (.cse8 (= |v_ssl3_accept_#t~mem48_65| |v_ssl3_accept_#t~mem48_63|)) (.cse9 (= |v_ssl3_accept_#t~mem83.offset_65| |v_ssl3_accept_#t~mem83.offset_63|)) (.cse10 (= v_ssl3_accept_~state~0_46 v_ssl3_accept_~state~0_45)) (.cse11 (= |v_ssl3_accept_#t~mem150.base_58| |v_ssl3_accept_#t~mem150.base_56|)) (.cse12 (= v_ssl3_accept_~skip~0_54 v_ssl3_accept_~skip~0_53)) (.cse13 (= |v_ssl3_accept_#t~mem46_44| |v_ssl3_accept_#t~mem46_43|)) (.cse14 (= |v_ssl3_accept_#t~mem82_65| |v_ssl3_accept_#t~mem82_63|))) (or (and (= |v_#memory_$Pointer$.offset_453| |v_#memory_$Pointer$.offset_459|) (= |v_ssl3_accept_#t~mem88.offset_39| |v_ssl3_accept_#t~mem88.offset_40|) .cse0 (= |v_ssl3_accept_#t~mem85_63| |v_ssl3_accept_#t~mem85_65|) .cse1 (= |v_ssl3_accept_#t~mem88.base_39| |v_ssl3_accept_#t~mem88.base_40|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem151_58| |v_ssl3_accept_#t~mem151_60|) .cse12 .cse13 .cse14 (= |v_#memory_$Pointer$.base_453| |v_#memory_$Pointer$.base_459|)) (and (= |v_ssl3_accept_#t~mem85_65| |v_ssl3_accept_#t~mem85_63|) (= |v_ssl3_accept_#t~mem151_60| |v_ssl3_accept_#t~mem151_58|) (= |v_ssl3_accept_#t~mem88.base_40| |v_ssl3_accept_#t~mem88.base_39|) .cse0 (= |v_#memory_$Pointer$.offset_459| |v_#memory_$Pointer$.offset_453|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem88.offset_40| |v_ssl3_accept_#t~mem88.offset_39|) .cse12 (= |v_#memory_$Pointer$.base_459| |v_#memory_$Pointer$.base_453|) .cse13 .cse14))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_65|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_459|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_65|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_65|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_60|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_17|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_58|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_33|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_40|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_65|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_49|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_65|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_58|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_67|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_44|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_54, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_40|, #memory_int=|v_#memory_int_422|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_459|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_46} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_63|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_453|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_63|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_63|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_58|, ssl3_accept_#t~mem51=|v_ssl3_accept_#t~mem51_15|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_56|, ssl3_accept_#t~mem50=|v_ssl3_accept_#t~mem50_31|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_39|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_63|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_47|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_63|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_56|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_65|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_43|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_53, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_39|, #memory_int=|v_#memory_int_417|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_39|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_453|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_45} 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~mem51, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem50, 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] {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} [727] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {29323#(= 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); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,246 INFO L290 TraceCheckUtils]: 34: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,246 INFO L290 TraceCheckUtils]: 35: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume 8640 == #t~mem75;havoc #t~mem75; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,249 INFO L290 TraceCheckUtils]: 47: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(4 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,250 INFO L290 TraceCheckUtils]: 48: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(7 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,250 INFO L290 TraceCheckUtils]: 49: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume !(10 == ~blastFlag~0); {29323#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-28 08:48:45,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {29323#(= ssl3_accept_~blastFlag~0 0)} assume 13 == ~blastFlag~0; {29319#false} is VALID [2022-04-28 08:48:45,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {29319#false} assume !false; {29319#false} is VALID [2022-04-28 08:48:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:48:45,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:48:45,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362294596] [2022-04-28 08:48:45,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362294596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:45,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:45,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:48:48,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:48:48,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [730731812] [2022-04-28 08:48:48,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [730731812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:48:48,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:48:48,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 08:48:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265405909] [2022-04-28 08:48:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:48:48,959 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:48:48,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:48:48,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:49,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:48:49,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 08:48:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:48:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 08:48:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-28 08:48:49,025 INFO L87 Difference]: Start difference. First operand 328 states and 490 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:48:57,014 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-28 08:48:58,856 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-28 08:49:01,124 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-28 08:49:10,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:10,815 INFO L93 Difference]: Finished difference Result 665 states and 1008 transitions. [2022-04-28 08:49:10,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 08:49:10,815 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:49:10,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 649 transitions. [2022-04-28 08:49:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 649 transitions. [2022-04-28 08:49:10,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 649 transitions. [2022-04-28 08:49:11,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 649 edges. 649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:11,275 INFO L225 Difference]: With dead ends: 665 [2022-04-28 08:49:11,275 INFO L226 Difference]: Without dead ends: 505 [2022-04-28 08:49:11,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=57, Invalid=182, Unknown=1, NotChecked=0, Total=240 [2022-04-28 08:49:11,276 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 159 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:11,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 977 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1026 Invalid, 0 Unknown, 180 Unchecked, 9.6s Time] [2022-04-28 08:49:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-04-28 08:49:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 483. [2022-04-28 08:49:11,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:11,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:11,292 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:11,292 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:11,300 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2022-04-28 08:49:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2022-04-28 08:49:11,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:11,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:11,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 505 states. [2022-04-28 08:49:11,301 INFO L87 Difference]: Start difference. First operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 505 states. [2022-04-28 08:49:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:11,309 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2022-04-28 08:49:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 746 transitions. [2022-04-28 08:49:11,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:11,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:11,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:11,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 478 states have (on average 1.49581589958159) internal successors, (715), 478 states have internal predecessors, (715), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 719 transitions. [2022-04-28 08:49:11,320 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 719 transitions. Word has length 68 [2022-04-28 08:49:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:11,320 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 719 transitions. [2022-04-28 08:49:11,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 15 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:11,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 483 states and 719 transitions. [2022-04-28 08:49:14,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 719 edges. 718 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 719 transitions. [2022-04-28 08:49:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 08:49:14,089 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:14,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:49:14,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:49:14,089 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:14,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1132379676, now seen corresponding path program 1 times [2022-04-28 08:49:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:14,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645430795] [2022-04-28 08:49:14,103 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:14,103 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:14,103 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1132379676, now seen corresponding path program 2 times [2022-04-28 08:49:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:14,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878357526] [2022-04-28 08:49:14,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:14,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:14,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32645#true} is VALID [2022-04-28 08:49:14,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {32645#true} assume true; {32645#true} is VALID [2022-04-28 08:49:14,262 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32645#true} {32645#true} #708#return; {32645#true} is VALID [2022-04-28 08:49:14,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {32645#true} call ULTIMATE.init(); {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:49:14,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {32652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32645#true} is VALID [2022-04-28 08:49:14,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {32645#true} assume true; {32645#true} is VALID [2022-04-28 08:49:14,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32645#true} {32645#true} #708#return; {32645#true} is VALID [2022-04-28 08:49:14,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {32645#true} call #t~ret161 := main(); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {32645#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; {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {32645#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L272 TraceCheckUtils]: 7: Hoare triple {32645#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {32645#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); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {32645#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; {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {32645#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; {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {32645#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {32645#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {32645#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {32645#true} assume !false; {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {32645#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); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {32645#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {32645#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {32645#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {32645#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {32645#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {32645#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {32645#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {32645#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {32645#true} assume 8464 == #t~mem55;havoc #t~mem55; {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {32645#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; {32645#true} is VALID [2022-04-28 08:49:14,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {32645#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32645#true} is VALID [2022-04-28 08:49:14,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {32645#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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {32650#(= 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; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {32650#(= 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); {32650#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:14,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {32650#(= 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); {32651#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-28 08:49:14,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {32651#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {32646#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {32646#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {32646#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {32646#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,272 INFO L290 TraceCheckUtils]: 49: Hoare triple {32646#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {32646#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 51: Hoare triple {32646#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 52: Hoare triple {32646#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 53: Hoare triple {32646#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 54: Hoare triple {32646#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 55: Hoare triple {32646#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 56: Hoare triple {32646#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 57: Hoare triple {32646#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 58: Hoare triple {32646#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 59: Hoare triple {32646#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 60: Hoare triple {32646#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 61: Hoare triple {32646#false} assume 8640 == #t~mem75;havoc #t~mem75; {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 62: Hoare triple {32646#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 63: Hoare triple {32646#false} assume !(4 == ~blastFlag~0); {32646#false} is VALID [2022-04-28 08:49:14,273 INFO L290 TraceCheckUtils]: 64: Hoare triple {32646#false} assume !(7 == ~blastFlag~0); {32646#false} is VALID [2022-04-28 08:49:14,274 INFO L290 TraceCheckUtils]: 65: Hoare triple {32646#false} assume !(10 == ~blastFlag~0); {32646#false} is VALID [2022-04-28 08:49:14,274 INFO L290 TraceCheckUtils]: 66: Hoare triple {32646#false} assume 13 == ~blastFlag~0; {32646#false} is VALID [2022-04-28 08:49:14,274 INFO L290 TraceCheckUtils]: 67: Hoare triple {32646#false} assume !false; {32646#false} is VALID [2022-04-28 08:49:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:49:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:14,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878357526] [2022-04-28 08:49:14,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878357526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:14,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:14,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:14,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:14,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645430795] [2022-04-28 08:49:14,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645430795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:14,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:14,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584657484] [2022-04-28 08:49:14,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:14,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:49:14,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:14,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:14,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:14,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:14,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:14,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:14,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:14,322 INFO L87 Difference]: Start difference. First operand 483 states and 719 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:17,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:21,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:27,617 INFO L93 Difference]: Finished difference Result 686 states and 1029 transitions. [2022-04-28 08:49:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:49:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 08:49:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-28 08:49:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-28 08:49:27,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 490 transitions. [2022-04-28 08:49:27,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 490 edges. 490 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:27,956 INFO L225 Difference]: With dead ends: 686 [2022-04-28 08:49:27,956 INFO L226 Difference]: Without dead ends: 526 [2022-04-28 08:49:27,956 INFO L412 NwaCegarLoop]: 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-28 08:49:27,956 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 31 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:27,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 615 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 457 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 08:49:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-04-28 08:49:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 505. [2022-04-28 08:49:27,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:27,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:27,973 INFO L74 IsIncluded]: Start isIncluded. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:27,973 INFO L87 Difference]: Start difference. First operand 526 states. Second operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:27,983 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2022-04-28 08:49:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 781 transitions. [2022-04-28 08:49:27,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:27,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:27,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 526 states. [2022-04-28 08:49:27,985 INFO L87 Difference]: Start difference. First operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 526 states. [2022-04-28 08:49:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:27,993 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2022-04-28 08:49:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 781 transitions. [2022-04-28 08:49:27,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:27,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:27,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:27,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 500 states have (on average 1.5) internal successors, (750), 500 states have internal predecessors, (750), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 754 transitions. [2022-04-28 08:49:28,005 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 754 transitions. Word has length 68 [2022-04-28 08:49:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:28,005 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 754 transitions. [2022-04-28 08:49:28,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:28,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 505 states and 754 transitions. [2022-04-28 08:49:30,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 754 edges. 753 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 754 transitions. [2022-04-28 08:49:30,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 08:49:30,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:30,982 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:49:30,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:49:30,982 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1067744169, now seen corresponding path program 1 times [2022-04-28 08:49:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [94663156] [2022-04-28 08:49:31,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:31,013 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:31,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1067744169, now seen corresponding path program 2 times [2022-04-28 08:49:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:31,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050565096] [2022-04-28 08:49:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:31,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36091#true} is VALID [2022-04-28 08:49:31,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {36091#true} assume true; {36091#true} is VALID [2022-04-28 08:49:31,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36091#true} {36091#true} #708#return; {36091#true} is VALID [2022-04-28 08:49:31,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {36091#true} call ULTIMATE.init(); {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:49:31,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {36098#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36091#true} is VALID [2022-04-28 08:49:31,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {36091#true} assume true; {36091#true} is VALID [2022-04-28 08:49:31,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36091#true} {36091#true} #708#return; {36091#true} is VALID [2022-04-28 08:49:31,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {36091#true} call #t~ret161 := main(); {36091#true} is VALID [2022-04-28 08:49:31,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {36091#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; {36091#true} is VALID [2022-04-28 08:49:31,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {36091#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,267 INFO L272 TraceCheckUtils]: 7: Hoare triple {36091#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {36091#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); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {36091#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; {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {36091#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; {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {36091#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {36091#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {36091#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {36091#true} assume !false; {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {36091#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); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {36091#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {36091#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {36091#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {36091#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {36091#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {36091#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {36091#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {36091#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {36091#true} assume 8464 == #t~mem55;havoc #t~mem55; {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {36091#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; {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {36091#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {36091#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); {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {36091#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); {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {36091#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {36091#true} ~skip~0 := 0; {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {36091#true} assume !false; {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {36091#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); {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {36091#true} assume 12292 == #t~mem47;havoc #t~mem47; {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {36091#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {36091#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {36091#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {36091#true} is VALID [2022-04-28 08:49:31,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {36091#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {36091#true} is VALID [2022-04-28 08:49:31,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {36091#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); {36091#true} is VALID [2022-04-28 08:49:31,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {36091#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {36091#true} is VALID [2022-04-28 08:49:31,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {36091#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); {36091#true} is VALID [2022-04-28 08:49:31,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {36091#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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {36096#(= 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; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {36096#(= 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); {36096#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:31,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {36096#(= 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); {36097#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {36097#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {36092#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {36092#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {36092#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {36092#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 57: Hoare triple {36092#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 58: Hoare triple {36092#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {36092#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 60: Hoare triple {36092#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 61: Hoare triple {36092#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 62: Hoare triple {36092#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,275 INFO L290 TraceCheckUtils]: 63: Hoare triple {36092#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {36092#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {36092#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {36092#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {36092#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {36092#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {36092#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {36092#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {36092#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {36092#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {36092#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 74: Hoare triple {36092#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 75: Hoare triple {36092#false} assume 8640 == #t~mem75;havoc #t~mem75; {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 76: Hoare triple {36092#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {36092#false} is VALID [2022-04-28 08:49:31,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {36092#false} assume !(4 == ~blastFlag~0); {36092#false} is VALID [2022-04-28 08:49:31,277 INFO L290 TraceCheckUtils]: 78: Hoare triple {36092#false} assume !(7 == ~blastFlag~0); {36092#false} is VALID [2022-04-28 08:49:31,277 INFO L290 TraceCheckUtils]: 79: Hoare triple {36092#false} assume !(10 == ~blastFlag~0); {36092#false} is VALID [2022-04-28 08:49:31,277 INFO L290 TraceCheckUtils]: 80: Hoare triple {36092#false} assume 13 == ~blastFlag~0; {36092#false} is VALID [2022-04-28 08:49:31,277 INFO L290 TraceCheckUtils]: 81: Hoare triple {36092#false} assume !false; {36092#false} is VALID [2022-04-28 08:49:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 08:49:31,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050565096] [2022-04-28 08:49:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050565096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:31,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:31,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:31,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:31,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [94663156] [2022-04-28 08:49:31,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [94663156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:31,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:31,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:31,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059675292] [2022-04-28 08:49:31,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:49:31,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:31,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:31,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:31,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:31,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:31,336 INFO L87 Difference]: Start difference. First operand 505 states and 754 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:33,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:38,268 INFO L93 Difference]: Finished difference Result 890 states and 1329 transitions. [2022-04-28 08:49:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:49:38,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:49:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-28 08:49:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-28 08:49:38,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-28 08:49:38,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:38,597 INFO L225 Difference]: With dead ends: 890 [2022-04-28 08:49:38,597 INFO L226 Difference]: Without dead ends: 544 [2022-04-28 08:49:38,598 INFO L412 NwaCegarLoop]: 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-28 08:49:38,599 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 20 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:38,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 598 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 08:49:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-04-28 08:49:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 511. [2022-04-28 08:49:38,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:38,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:38,615 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:38,615 INFO L87 Difference]: Start difference. First operand 544 states. Second operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:38,624 INFO L93 Difference]: Finished difference Result 544 states and 805 transitions. [2022-04-28 08:49:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 805 transitions. [2022-04-28 08:49:38,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:38,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:38,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 544 states. [2022-04-28 08:49:38,625 INFO L87 Difference]: Start difference. First operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 544 states. [2022-04-28 08:49:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:38,634 INFO L93 Difference]: Finished difference Result 544 states and 805 transitions. [2022-04-28 08:49:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 805 transitions. [2022-04-28 08:49:38,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:38,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:38,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:38,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.5019762845849802) internal successors, (760), 506 states have internal predecessors, (760), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 764 transitions. [2022-04-28 08:49:38,645 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 764 transitions. Word has length 82 [2022-04-28 08:49:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:38,645 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 764 transitions. [2022-04-28 08:49:38,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:38,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 764 transitions. [2022-04-28 08:49:41,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 764 edges. 763 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 764 transitions. [2022-04-28 08:49:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 08:49:41,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:41,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:49:41,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:49:41,509 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1797161388, now seen corresponding path program 1 times [2022-04-28 08:49:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:41,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554310136] [2022-04-28 08:49:41,536 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:41,536 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:41,536 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1797161388, now seen corresponding path program 2 times [2022-04-28 08:49:41,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:41,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977646254] [2022-04-28 08:49:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:41,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:41,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39993#true} is VALID [2022-04-28 08:49:41,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {39993#true} assume true; {39993#true} is VALID [2022-04-28 08:49:41,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39993#true} {39993#true} #708#return; {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {39993#true} call ULTIMATE.init(); {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:49:41,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {40000#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {39993#true} assume true; {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39993#true} {39993#true} #708#return; {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {39993#true} call #t~ret161 := main(); {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {39993#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; {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {39993#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L272 TraceCheckUtils]: 7: Hoare triple {39993#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {39993#true} is VALID [2022-04-28 08:49:41,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {39993#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); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {39993#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; {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {39993#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; {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {39993#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {39993#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {39993#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {39993#true} assume !false; {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {39993#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); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {39993#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {39993#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {39993#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {39993#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {39993#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {39993#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {39993#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {39993#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39993#true} is VALID [2022-04-28 08:49:41,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {39993#true} assume 8464 == #t~mem55;havoc #t~mem55; {39993#true} is VALID [2022-04-28 08:49:41,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {39993#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; {39993#true} is VALID [2022-04-28 08:49:41,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {39993#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {39993#true} is VALID [2022-04-28 08:49:41,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {39993#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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {39998#(= 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; {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {39998#(= 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); {39998#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:41,723 INFO L290 TraceCheckUtils]: 38: Hoare triple {39998#(= 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); {39999#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-28 08:49:41,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {39999#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {39994#false} is VALID [2022-04-28 08:49:41,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {39994#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; {39994#false} is VALID [2022-04-28 08:49:41,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {39994#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); {39994#false} is VALID [2022-04-28 08:49:41,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {39994#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {39994#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {39994#false} is VALID [2022-04-28 08:49:41,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {39994#false} ~skip~0 := 0; {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 45: Hoare triple {39994#false} assume !false; {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 46: Hoare triple {39994#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 47: Hoare triple {39994#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {39994#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {39994#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {39994#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {39994#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {39994#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {39994#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 54: Hoare triple {39994#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 55: Hoare triple {39994#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 56: Hoare triple {39994#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 57: Hoare triple {39994#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,724 INFO L290 TraceCheckUtils]: 58: Hoare triple {39994#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {39994#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 60: Hoare triple {39994#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 61: Hoare triple {39994#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 62: Hoare triple {39994#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 63: Hoare triple {39994#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 64: Hoare triple {39994#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 65: Hoare triple {39994#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {39994#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {39994#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {39994#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {39994#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {39994#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {39994#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {39994#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {39994#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {39994#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 75: Hoare triple {39994#false} assume 8640 == #t~mem75;havoc #t~mem75; {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 76: Hoare triple {39994#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 77: Hoare triple {39994#false} assume !(4 == ~blastFlag~0); {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 78: Hoare triple {39994#false} assume !(7 == ~blastFlag~0); {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 79: Hoare triple {39994#false} assume !(10 == ~blastFlag~0); {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 80: Hoare triple {39994#false} assume 13 == ~blastFlag~0; {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L290 TraceCheckUtils]: 81: Hoare triple {39994#false} assume !false; {39994#false} is VALID [2022-04-28 08:49:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:49:41,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:41,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977646254] [2022-04-28 08:49:41,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977646254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:41,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:41,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:41,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:41,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554310136] [2022-04-28 08:49:41,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554310136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:41,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:41,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399143321] [2022-04-28 08:49:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:49:41,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:41,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:41,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:41,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:41,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:41,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:41,783 INFO L87 Difference]: Start difference. First operand 511 states and 764 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:45,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:49:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:52,139 INFO L93 Difference]: Finished difference Result 715 states and 1076 transitions. [2022-04-28 08:49:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:49:52,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:49:52,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:49:52,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-28 08:49:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-04-28 08:49:52,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 487 transitions. [2022-04-28 08:49:52,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:52,454 INFO L225 Difference]: With dead ends: 715 [2022-04-28 08:49:52,454 INFO L226 Difference]: Without dead ends: 530 [2022-04-28 08:49:52,454 INFO L412 NwaCegarLoop]: 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-28 08:49:52,455 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 35 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:49:52,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 615 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 447 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 08:49:52,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-04-28 08:49:52,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 511. [2022-04-28 08:49:52,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:49:52,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 530 states. Second operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:52,476 INFO L74 IsIncluded]: Start isIncluded. First operand 530 states. Second operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:52,476 INFO L87 Difference]: Start difference. First operand 530 states. Second operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:52,485 INFO L93 Difference]: Finished difference Result 530 states and 788 transitions. [2022-04-28 08:49:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 788 transitions. [2022-04-28 08:49:52,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:52,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:52,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 530 states. [2022-04-28 08:49:52,486 INFO L87 Difference]: Start difference. First operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 530 states. [2022-04-28 08:49:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:49:52,494 INFO L93 Difference]: Finished difference Result 530 states and 788 transitions. [2022-04-28 08:49:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 788 transitions. [2022-04-28 08:49:52,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:49:52,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:49:52,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:49:52,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:49:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.5) internal successors, (759), 506 states have internal predecessors, (759), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 763 transitions. [2022-04-28 08:49:52,505 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 763 transitions. Word has length 82 [2022-04-28 08:49:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:49:52,505 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 763 transitions. [2022-04-28 08:49:52,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:52,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 763 transitions. [2022-04-28 08:49:55,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 763 edges. 762 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 763 transitions. [2022-04-28 08:49:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 08:49:55,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:49:55,386 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-28 08:49:55,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:49:55,386 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:49:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:49:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash -403445877, now seen corresponding path program 1 times [2022-04-28 08:49:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:55,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408999827] [2022-04-28 08:49:55,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:49:55,410 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:49:55,410 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:49:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash -403445877, now seen corresponding path program 2 times [2022-04-28 08:49:55,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:49:55,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433607186] [2022-04-28 08:49:55,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:49:55,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:49:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:55,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:49:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:49:55,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {43524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {43517#true} is VALID [2022-04-28 08:49:55,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {43517#true} assume true; {43517#true} is VALID [2022-04-28 08:49:55,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43517#true} {43517#true} #708#return; {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {43517#true} call ULTIMATE.init(); {43524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {43524#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {43517#true} assume true; {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43517#true} {43517#true} #708#return; {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {43517#true} call #t~ret161 := main(); {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {43517#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; {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {43517#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L272 TraceCheckUtils]: 7: Hoare triple {43517#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {43517#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); {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {43517#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; {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {43517#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; {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {43517#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {43517#true} is VALID [2022-04-28 08:49:55,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {43517#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {43517#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {43517#true} assume !false; {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {43517#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); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {43517#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {43517#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {43517#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {43517#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {43517#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {43517#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {43517#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {43517#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {43517#true} assume 8464 == #t~mem55;havoc #t~mem55; {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {43517#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; {43517#true} is VALID [2022-04-28 08:49:55,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {43517#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {43517#true} is VALID [2022-04-28 08:49:55,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {43517#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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {43522#(= 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; {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {43522#(= 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); {43522#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {43522#(= 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); {43523#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {43523#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {43518#false} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 41: Hoare triple {43518#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 42: Hoare triple {43518#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 43: Hoare triple {43518#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {43518#false} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {43518#false} ~skip~0 := 0; {43518#false} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {43518#false} assume !false; {43518#false} is VALID [2022-04-28 08:49:55,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {43518#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 47: Hoare triple {43518#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {43518#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {43518#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {43518#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 51: Hoare triple {43518#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {43518#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 53: Hoare triple {43518#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {43518#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {43518#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {43518#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {43518#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {43518#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {43518#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {43518#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {43518#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {43518#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {43518#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {43518#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {43518#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {43518#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {43518#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {43518#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {43518#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {43518#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 71: Hoare triple {43518#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 72: Hoare triple {43518#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 73: Hoare triple {43518#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 74: Hoare triple {43518#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {43518#false} is VALID [2022-04-28 08:49:55,656 INFO L290 TraceCheckUtils]: 75: Hoare triple {43518#false} assume 8640 == #t~mem75;havoc #t~mem75; {43518#false} is VALID [2022-04-28 08:49:55,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {43518#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {43518#false} is VALID [2022-04-28 08:49:55,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {43518#false} assume !(4 == ~blastFlag~0); {43518#false} is VALID [2022-04-28 08:49:55,657 INFO L290 TraceCheckUtils]: 78: Hoare triple {43518#false} assume !(7 == ~blastFlag~0); {43518#false} is VALID [2022-04-28 08:49:55,657 INFO L290 TraceCheckUtils]: 79: Hoare triple {43518#false} assume !(10 == ~blastFlag~0); {43518#false} is VALID [2022-04-28 08:49:55,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {43518#false} assume 13 == ~blastFlag~0; {43518#false} is VALID [2022-04-28 08:49:55,657 INFO L290 TraceCheckUtils]: 81: Hoare triple {43518#false} assume !false; {43518#false} is VALID [2022-04-28 08:49:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:49:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:49:55,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433607186] [2022-04-28 08:49:55,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433607186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:55,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:55,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:55,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:49:55,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408999827] [2022-04-28 08:49:55,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408999827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:49:55,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:49:55,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:49:55,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604506717] [2022-04-28 08:49:55,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:49:55,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:49:55,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:49:55,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:55,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:49:55,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:49:55,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:49:55,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:49:55,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:49:55,710 INFO L87 Difference]: Start difference. First operand 511 states and 763 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:49:57,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:03,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:08,536 INFO L93 Difference]: Finished difference Result 714 states and 1073 transitions. [2022-04-28 08:50:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:50:08,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 08:50:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:50:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:08,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-28 08:50:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-04-28 08:50:08,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 485 transitions. [2022-04-28 08:50:08,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:08,873 INFO L225 Difference]: With dead ends: 714 [2022-04-28 08:50:08,873 INFO L226 Difference]: Without dead ends: 529 [2022-04-28 08:50:08,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:50:08,874 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 33 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:50:08,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 613 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 442 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-04-28 08:50:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-28 08:50:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 511. [2022-04-28 08:50:08,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:50:08,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:08,890 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:08,891 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:08,899 INFO L93 Difference]: Finished difference Result 529 states and 786 transitions. [2022-04-28 08:50:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 786 transitions. [2022-04-28 08:50:08,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:08,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:08,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 529 states. [2022-04-28 08:50:08,901 INFO L87 Difference]: Start difference. First operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 529 states. [2022-04-28 08:50:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:08,910 INFO L93 Difference]: Finished difference Result 529 states and 786 transitions. [2022-04-28 08:50:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 786 transitions. [2022-04-28 08:50:08,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:08,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:08,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:50:08,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:50:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 506 states have (on average 1.4980237154150198) internal successors, (758), 506 states have internal predecessors, (758), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 762 transitions. [2022-04-28 08:50:08,923 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 762 transitions. Word has length 82 [2022-04-28 08:50:08,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:50:08,923 INFO L495 AbstractCegarLoop]: Abstraction has 511 states and 762 transitions. [2022-04-28 08:50:08,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:08,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 511 states and 762 transitions. [2022-04-28 08:50:11,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 762 edges. 761 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 762 transitions. [2022-04-28 08:50:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 08:50:11,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:50:11,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:50:11,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:50:11,914 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:50:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:50:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1485544258, now seen corresponding path program 1 times [2022-04-28 08:50:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:11,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [567969283] [2022-04-28 08:50:11,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:50:11,939 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:50:11,939 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:50:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1485544258, now seen corresponding path program 2 times [2022-04-28 08:50:11,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:50:11,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133784223] [2022-04-28 08:50:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:50:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:50:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:50:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:12,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {47045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47037#true} is VALID [2022-04-28 08:50:12,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {47037#true} assume true; {47037#true} is VALID [2022-04-28 08:50:12,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47037#true} {47037#true} #708#return; {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {47037#true} call ULTIMATE.init(); {47045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:50:12,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {47045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {47037#true} assume true; {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47037#true} {47037#true} #708#return; {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {47037#true} call #t~ret161 := main(); {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {47037#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; {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {47037#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L272 TraceCheckUtils]: 7: Hoare triple {47037#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {47037#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); {47037#true} is VALID [2022-04-28 08:50:12,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {47037#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; {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {47037#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; {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {47037#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {47037#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {47037#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {47037#true} assume !false; {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {47037#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); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {47037#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {47037#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {47037#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {47037#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {47037#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {47037#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {47037#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {47037#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {47037#true} assume 8464 == #t~mem55;havoc #t~mem55; {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {47037#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; {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {47037#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {47037#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); {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {47037#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); {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 29: Hoare triple {47037#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {47037#true} ~skip~0 := 0; {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 31: Hoare triple {47037#true} assume !false; {47037#true} is VALID [2022-04-28 08:50:12,237 INFO L290 TraceCheckUtils]: 32: Hoare triple {47037#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); {47042#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {47042#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {47043#(= 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); {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {47043#(= 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; {47043#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:50:12,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {47043#(= 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); {47044#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {47044#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {47038#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; {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {47038#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {47038#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {47038#false} ~skip~0 := 0; {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {47038#false} assume !false; {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {47038#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {47038#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {47038#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {47038#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {47038#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {47038#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {47038#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {47038#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 55: Hoare triple {47038#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 56: Hoare triple {47038#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 57: Hoare triple {47038#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {47038#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {47038#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {47038#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 61: Hoare triple {47038#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 62: Hoare triple {47038#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 63: Hoare triple {47038#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 64: Hoare triple {47038#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,247 INFO L290 TraceCheckUtils]: 65: Hoare triple {47038#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {47038#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {47038#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 68: Hoare triple {47038#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 69: Hoare triple {47038#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 70: Hoare triple {47038#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 71: Hoare triple {47038#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 72: Hoare triple {47038#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {47038#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 74: Hoare triple {47038#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 75: Hoare triple {47038#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 76: Hoare triple {47038#false} assume 8640 == #t~mem75;havoc #t~mem75; {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 77: Hoare triple {47038#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 78: Hoare triple {47038#false} assume !(4 == ~blastFlag~0); {47038#false} is VALID [2022-04-28 08:50:12,248 INFO L290 TraceCheckUtils]: 79: Hoare triple {47038#false} assume !(7 == ~blastFlag~0); {47038#false} is VALID [2022-04-28 08:50:12,249 INFO L290 TraceCheckUtils]: 80: Hoare triple {47038#false} assume !(10 == ~blastFlag~0); {47038#false} is VALID [2022-04-28 08:50:12,249 INFO L290 TraceCheckUtils]: 81: Hoare triple {47038#false} assume 13 == ~blastFlag~0; {47038#false} is VALID [2022-04-28 08:50:12,249 INFO L290 TraceCheckUtils]: 82: Hoare triple {47038#false} assume !false; {47038#false} is VALID [2022-04-28 08:50:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 08:50:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:50:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133784223] [2022-04-28 08:50:12,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133784223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:12,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:12,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:50:12,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:50:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [567969283] [2022-04-28 08:50:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [567969283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:12,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:50:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644348855] [2022-04-28 08:50:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:50:12,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 08:50:12,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:50:12,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:12,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:12,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:50:12,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:50:12,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:50:12,295 INFO L87 Difference]: Start difference. First operand 511 states and 762 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:14,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:19,840 INFO L93 Difference]: Finished difference Result 881 states and 1316 transitions. [2022-04-28 08:50:19,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:50:19,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 08:50:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:50:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:19,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2022-04-28 08:50:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2022-04-28 08:50:19,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 439 transitions. [2022-04-28 08:50:20,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:20,127 INFO L225 Difference]: With dead ends: 881 [2022-04-28 08:50:20,127 INFO L226 Difference]: Without dead ends: 529 [2022-04-28 08:50:20,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 08:50:20,128 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 3 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:50:20,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 690 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 08:50:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-28 08:50:20,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2022-04-28 08:50:20,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:50:20,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 529 states. Second operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:20,144 INFO L74 IsIncluded]: Start isIncluded. First operand 529 states. Second operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:20,144 INFO L87 Difference]: Start difference. First operand 529 states. Second operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:20,153 INFO L93 Difference]: Finished difference Result 529 states and 784 transitions. [2022-04-28 08:50:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 784 transitions. [2022-04-28 08:50:20,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:20,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:20,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 529 states. [2022-04-28 08:50:20,154 INFO L87 Difference]: Start difference. First operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 529 states. [2022-04-28 08:50:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:20,162 INFO L93 Difference]: Finished difference Result 529 states and 784 transitions. [2022-04-28 08:50:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 784 transitions. [2022-04-28 08:50:20,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:20,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:20,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:50:20,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:50:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.4885496183206106) internal successors, (780), 524 states have internal predecessors, (780), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 784 transitions. [2022-04-28 08:50:20,174 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 784 transitions. Word has length 83 [2022-04-28 08:50:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:50:20,174 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 784 transitions. [2022-04-28 08:50:20,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:20,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 529 states and 784 transitions. [2022-04-28 08:50:23,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 784 edges. 783 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 784 transitions. [2022-04-28 08:50:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 08:50:23,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:50:23,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:50:23,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:50:23,093 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:50:23,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:50:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1443200503, now seen corresponding path program 1 times [2022-04-28 08:50:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:23,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1770763649] [2022-04-28 08:50:23,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:50:23,122 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:50:23,122 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:50:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1443200503, now seen corresponding path program 2 times [2022-04-28 08:50:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:50:23,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715608844] [2022-04-28 08:50:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:50:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:50:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:50:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:23,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {50935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {50928#true} is VALID [2022-04-28 08:50:23,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {50928#true} assume true; {50928#true} is VALID [2022-04-28 08:50:23,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50928#true} {50928#true} #708#return; {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {50928#true} call ULTIMATE.init(); {50935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {50935#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {50928#true} assume true; {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50928#true} {50928#true} #708#return; {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {50928#true} call #t~ret161 := main(); {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {50928#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; {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {50928#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L272 TraceCheckUtils]: 7: Hoare triple {50928#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {50928#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); {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {50928#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; {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {50928#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; {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {50928#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {50928#true} is VALID [2022-04-28 08:50:23,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {50928#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {50928#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {50928#true} assume !false; {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {50928#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); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {50928#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {50928#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {50928#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {50928#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {50928#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {50928#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {50928#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {50928#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {50928#true} assume 8464 == #t~mem55;havoc #t~mem55; {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {50928#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; {50928#true} is VALID [2022-04-28 08:50:23,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {50928#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {50928#true} is VALID [2022-04-28 08:50:23,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {50928#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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {50933#(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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {50933#(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; {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {50933#(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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {50933#(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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {50933#(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); {50933#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:23,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {50933#(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); {50934#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {50934#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {50929#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {50929#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {50929#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {50929#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); {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 41: Hoare triple {50929#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {50929#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); {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {50929#false} assume 12292 != #t~mem85;havoc #t~mem85; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {50929#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; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {50929#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {50929#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {50929#false} ~skip~0 := 0; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {50929#false} assume !false; {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {50929#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {50929#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {50929#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {50929#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {50929#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {50929#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {50929#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {50929#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {50929#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {50929#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 59: Hoare triple {50929#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {50929#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {50929#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {50929#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {50929#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {50929#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {50929#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 66: Hoare triple {50929#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 67: Hoare triple {50929#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {50929#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {50929#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 70: Hoare triple {50929#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 71: Hoare triple {50929#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 72: Hoare triple {50929#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 73: Hoare triple {50929#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 74: Hoare triple {50929#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 75: Hoare triple {50929#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 76: Hoare triple {50929#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 77: Hoare triple {50929#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 78: Hoare triple {50929#false} assume 8640 == #t~mem75;havoc #t~mem75; {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 79: Hoare triple {50929#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {50929#false} is VALID [2022-04-28 08:50:23,344 INFO L290 TraceCheckUtils]: 80: Hoare triple {50929#false} assume !(4 == ~blastFlag~0); {50929#false} is VALID [2022-04-28 08:50:23,345 INFO L290 TraceCheckUtils]: 81: Hoare triple {50929#false} assume !(7 == ~blastFlag~0); {50929#false} is VALID [2022-04-28 08:50:23,345 INFO L290 TraceCheckUtils]: 82: Hoare triple {50929#false} assume !(10 == ~blastFlag~0); {50929#false} is VALID [2022-04-28 08:50:23,345 INFO L290 TraceCheckUtils]: 83: Hoare triple {50929#false} assume 13 == ~blastFlag~0; {50929#false} is VALID [2022-04-28 08:50:23,345 INFO L290 TraceCheckUtils]: 84: Hoare triple {50929#false} assume !false; {50929#false} is VALID [2022-04-28 08:50:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:50:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:50:23,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715608844] [2022-04-28 08:50:23,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715608844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:23,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:23,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:23,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:50:23,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1770763649] [2022-04-28 08:50:23,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1770763649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:23,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:23,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:23,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650717146] [2022-04-28 08:50:23,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:50:23,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 08:50:23,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:50:23,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:23,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:23,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:50:23,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:23,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:50:23,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:50:23,403 INFO L87 Difference]: Start difference. First operand 529 states and 784 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:26,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:29,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:32,280 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-28 08:50:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:36,992 INFO L93 Difference]: Finished difference Result 1217 states and 1810 transitions. [2022-04-28 08:50:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:50:36,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 08:50:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:50:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-28 08:50:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2022-04-28 08:50:36,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 613 transitions. [2022-04-28 08:50:37,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:37,447 INFO L225 Difference]: With dead ends: 1217 [2022-04-28 08:50:37,447 INFO L226 Difference]: Without dead ends: 847 [2022-04-28 08:50:37,447 INFO L412 NwaCegarLoop]: 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-28 08:50:37,448 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 150 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:50:37,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 366 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-04-28 08:50:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-04-28 08:50:37,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 529. [2022-04-28 08:50:37,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:50:37,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 847 states. Second operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:37,467 INFO L74 IsIncluded]: Start isIncluded. First operand 847 states. Second operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:37,468 INFO L87 Difference]: Start difference. First operand 847 states. Second operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:37,487 INFO L93 Difference]: Finished difference Result 847 states and 1252 transitions. [2022-04-28 08:50:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1252 transitions. [2022-04-28 08:50:37,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:37,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:37,488 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 847 states. [2022-04-28 08:50:37,488 INFO L87 Difference]: Start difference. First operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 847 states. [2022-04-28 08:50:37,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:37,508 INFO L93 Difference]: Finished difference Result 847 states and 1252 transitions. [2022-04-28 08:50:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1252 transitions. [2022-04-28 08:50:37,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:37,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:37,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:50:37,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:50:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 778 transitions. [2022-04-28 08:50:37,519 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 778 transitions. Word has length 85 [2022-04-28 08:50:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:50:37,519 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 778 transitions. [2022-04-28 08:50:37,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:37,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 529 states and 778 transitions. [2022-04-28 08:50:40,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 778 edges. 777 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 778 transitions. [2022-04-28 08:50:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 08:50:40,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:50:40,508 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:50:40,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:50:40,508 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:50:40,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:50:40,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1206059988, now seen corresponding path program 1 times [2022-04-28 08:50:40,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:40,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [331101599] [2022-04-28 08:50:40,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:50:40,537 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:50:40,537 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:50:40,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1206059988, now seen corresponding path program 2 times [2022-04-28 08:50:40,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:50:40,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301898704] [2022-04-28 08:50:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:50:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:50:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:50:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:40,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {56133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56126#true} is VALID [2022-04-28 08:50:40,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {56126#true} assume true; {56126#true} is VALID [2022-04-28 08:50:40,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56126#true} {56126#true} #708#return; {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {56126#true} call ULTIMATE.init(); {56133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {56133#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {56126#true} assume true; {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56126#true} {56126#true} #708#return; {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {56126#true} call #t~ret161 := main(); {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {56126#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; {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {56126#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L272 TraceCheckUtils]: 7: Hoare triple {56126#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {56126#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); {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {56126#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; {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {56126#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; {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {56126#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {56126#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {56126#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {56126#true} assume !false; {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {56126#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); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {56126#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {56126#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {56126#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {56126#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {56126#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {56126#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {56126#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {56126#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {56126#true} assume 8464 == #t~mem55;havoc #t~mem55; {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {56126#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; {56126#true} is VALID [2022-04-28 08:50:40,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {56126#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {56126#true} is VALID [2022-04-28 08:50:40,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {56126#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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {56131#(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; {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {56131#(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); {56131#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {56131#(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); {56132#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 37: Hoare triple {56132#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {56127#false} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 38: Hoare triple {56127#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 39: Hoare triple {56127#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {56127#false} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {56127#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {56127#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); {56127#false} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {56127#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {56127#false} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {56127#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); {56127#false} is VALID [2022-04-28 08:50:40,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {56127#false} assume 12292 != #t~mem85;havoc #t~mem85; {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {56127#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; {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {56127#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {56127#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {56127#false} ~skip~0 := 0; {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {56127#false} assume !false; {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 50: Hoare triple {56127#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {56127#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {56127#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 53: Hoare triple {56127#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {56127#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 55: Hoare triple {56127#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 56: Hoare triple {56127#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 57: Hoare triple {56127#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 58: Hoare triple {56127#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,725 INFO L290 TraceCheckUtils]: 59: Hoare triple {56127#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 60: Hoare triple {56127#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 61: Hoare triple {56127#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 62: Hoare triple {56127#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {56127#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {56127#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {56127#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 66: Hoare triple {56127#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 67: Hoare triple {56127#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {56127#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 69: Hoare triple {56127#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 70: Hoare triple {56127#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 71: Hoare triple {56127#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 72: Hoare triple {56127#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 73: Hoare triple {56127#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,726 INFO L290 TraceCheckUtils]: 74: Hoare triple {56127#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 75: Hoare triple {56127#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 76: Hoare triple {56127#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 77: Hoare triple {56127#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 78: Hoare triple {56127#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 79: Hoare triple {56127#false} assume 8640 == #t~mem75;havoc #t~mem75; {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 80: Hoare triple {56127#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 81: Hoare triple {56127#false} assume !(4 == ~blastFlag~0); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 82: Hoare triple {56127#false} assume !(7 == ~blastFlag~0); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 83: Hoare triple {56127#false} assume !(10 == ~blastFlag~0); {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 84: Hoare triple {56127#false} assume 13 == ~blastFlag~0; {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L290 TraceCheckUtils]: 85: Hoare triple {56127#false} assume !false; {56127#false} is VALID [2022-04-28 08:50:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:50:40,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:50:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301898704] [2022-04-28 08:50:40,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301898704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:40,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:40,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:40,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:50:40,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [331101599] [2022-04-28 08:50:40,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [331101599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:40,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:40,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604862724] [2022-04-28 08:50:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:50:40,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 08:50:40,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:50:40,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:40,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:50:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:40,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:50:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:50:40,788 INFO L87 Difference]: Start difference. First operand 529 states and 778 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:43,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:50:53,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:53,315 INFO L93 Difference]: Finished difference Result 1192 states and 1767 transitions. [2022-04-28 08:50:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:50:53,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-28 08:50:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:50:53,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:50:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:50:53,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-28 08:50:53,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:53,709 INFO L225 Difference]: With dead ends: 1192 [2022-04-28 08:50:53,710 INFO L226 Difference]: Without dead ends: 820 [2022-04-28 08:50:53,710 INFO L412 NwaCegarLoop]: 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-28 08:50:53,711 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 147 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:50:53,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 368 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 482 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 08:50:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-04-28 08:50:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 529. [2022-04-28 08:50:53,757 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:50:53,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 820 states. Second operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:53,758 INFO L74 IsIncluded]: Start isIncluded. First operand 820 states. Second operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:53,759 INFO L87 Difference]: Start difference. First operand 820 states. Second operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:53,777 INFO L93 Difference]: Finished difference Result 820 states and 1210 transitions. [2022-04-28 08:50:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1210 transitions. [2022-04-28 08:50:53,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:53,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:53,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 820 states. [2022-04-28 08:50:53,779 INFO L87 Difference]: Start difference. First operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 820 states. [2022-04-28 08:50:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:50:53,799 INFO L93 Difference]: Finished difference Result 820 states and 1210 transitions. [2022-04-28 08:50:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1210 transitions. [2022-04-28 08:50:53,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:50:53,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:50:53,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:50:53,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:50:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 771 transitions. [2022-04-28 08:50:53,811 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 771 transitions. Word has length 86 [2022-04-28 08:50:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:50:53,811 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 771 transitions. [2022-04-28 08:50:53,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:53,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 529 states and 771 transitions. [2022-04-28 08:50:56,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 770 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 771 transitions. [2022-04-28 08:50:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 08:50:56,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:50:56,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:50:56,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:50:56,756 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:50:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:50:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1811938044, now seen corresponding path program 1 times [2022-04-28 08:50:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113855218] [2022-04-28 08:50:56,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:50:56,783 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:50:56,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:50:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1811938044, now seen corresponding path program 2 times [2022-04-28 08:50:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:50:56,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000930683] [2022-04-28 08:50:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:50:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:50:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:57,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:50:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:50:57,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {61227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {61220#true} is VALID [2022-04-28 08:50:57,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {61220#true} assume true; {61220#true} is VALID [2022-04-28 08:50:57,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61220#true} {61220#true} #708#return; {61220#true} is VALID [2022-04-28 08:50:57,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {61220#true} call ULTIMATE.init(); {61227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:50:57,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {61227#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {61220#true} is VALID [2022-04-28 08:50:57,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {61220#true} assume true; {61220#true} is VALID [2022-04-28 08:50:57,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61220#true} {61220#true} #708#return; {61220#true} is VALID [2022-04-28 08:50:57,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {61220#true} call #t~ret161 := main(); {61220#true} is VALID [2022-04-28 08:50:57,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {61220#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; {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {61220#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L272 TraceCheckUtils]: 7: Hoare triple {61220#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {61220#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); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {61220#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; {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {61220#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; {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {61220#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {61220#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {61220#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {61220#true} assume !false; {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {61220#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); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {61220#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {61220#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {61220#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {61220#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {61220#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {61220#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {61220#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {61220#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {61220#true} assume 8464 == #t~mem55;havoc #t~mem55; {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {61220#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; {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {61220#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {61220#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); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {61220#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); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {61220#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {61220#true} ~skip~0 := 0; {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {61220#true} assume !false; {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {61220#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); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {61220#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {61220#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,062 INFO L290 TraceCheckUtils]: 35: Hoare triple {61220#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {61220#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {61220#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {61220#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 39: Hoare triple {61220#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {61220#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 41: Hoare triple {61220#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 42: Hoare triple {61220#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 43: Hoare triple {61220#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {61220#true} assume 8496 == #t~mem58;havoc #t~mem58; {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {61220#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {61220#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61220#true} is VALID [2022-04-28 08:50:57,063 INFO L290 TraceCheckUtils]: 47: Hoare triple {61220#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {61220#true} is VALID [2022-04-28 08:50:57,065 INFO L290 TraceCheckUtils]: 48: Hoare triple {61220#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,066 INFO L290 TraceCheckUtils]: 50: Hoare triple {61225#(not (= 8640 (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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,066 INFO L290 TraceCheckUtils]: 51: Hoare triple {61225#(not (= 8640 (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; {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,072 INFO L290 TraceCheckUtils]: 69: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,073 INFO L290 TraceCheckUtils]: 71: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,073 INFO L290 TraceCheckUtils]: 72: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,074 INFO L290 TraceCheckUtils]: 74: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,075 INFO L290 TraceCheckUtils]: 76: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,075 INFO L290 TraceCheckUtils]: 77: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,076 INFO L290 TraceCheckUtils]: 79: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,076 INFO L290 TraceCheckUtils]: 80: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,077 INFO L290 TraceCheckUtils]: 81: Hoare triple {61225#(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); {61225#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:50:57,077 INFO L290 TraceCheckUtils]: 82: Hoare triple {61225#(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); {61226#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-28 08:50:57,077 INFO L290 TraceCheckUtils]: 83: Hoare triple {61226#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {61221#false} is VALID [2022-04-28 08:50:57,077 INFO L290 TraceCheckUtils]: 84: Hoare triple {61221#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {61221#false} is VALID [2022-04-28 08:50:57,077 INFO L290 TraceCheckUtils]: 85: Hoare triple {61221#false} assume !(4 == ~blastFlag~0); {61221#false} is VALID [2022-04-28 08:50:57,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {61221#false} assume !(7 == ~blastFlag~0); {61221#false} is VALID [2022-04-28 08:50:57,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {61221#false} assume !(10 == ~blastFlag~0); {61221#false} is VALID [2022-04-28 08:50:57,078 INFO L290 TraceCheckUtils]: 88: Hoare triple {61221#false} assume 13 == ~blastFlag~0; {61221#false} is VALID [2022-04-28 08:50:57,078 INFO L290 TraceCheckUtils]: 89: Hoare triple {61221#false} assume !false; {61221#false} is VALID [2022-04-28 08:50:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:50:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:50:57,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000930683] [2022-04-28 08:50:57,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000930683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:57,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:57,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:57,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:50:57,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113855218] [2022-04-28 08:50:57,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113855218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:50:57,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:50:57,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:50:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421312982] [2022-04-28 08:50:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:50:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 08:50:57,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:50:57,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:50:57,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:50:57,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:50:57,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:50:57,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:50:57,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:50:57,136 INFO L87 Difference]: Start difference. First operand 529 states and 771 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:00,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:02,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:06,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:11,090 INFO L93 Difference]: Finished difference Result 1374 states and 2018 transitions. [2022-04-28 08:51:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:51:11,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 08:51:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:51:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:51:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-04-28 08:51:11,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 610 transitions. [2022-04-28 08:51:11,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 610 edges. 610 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:11,557 INFO L225 Difference]: With dead ends: 1374 [2022-04-28 08:51:11,557 INFO L226 Difference]: Without dead ends: 871 [2022-04-28 08:51:11,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:51:11,558 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 122 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:51:11,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 370 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 08:51:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-04-28 08:51:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 649. [2022-04-28 08:51:11,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:51:11,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 871 states. Second operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:11,585 INFO L74 IsIncluded]: Start isIncluded. First operand 871 states. Second operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:11,585 INFO L87 Difference]: Start difference. First operand 871 states. Second operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:11,605 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2022-04-28 08:51:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1276 transitions. [2022-04-28 08:51:11,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:11,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:11,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 871 states. [2022-04-28 08:51:11,607 INFO L87 Difference]: Start difference. First operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 871 states. [2022-04-28 08:51:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:11,627 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2022-04-28 08:51:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1276 transitions. [2022-04-28 08:51:11,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:11,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:11,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:51:11,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:51:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 644 states have (on average 1.5077639751552796) internal successors, (971), 644 states have internal predecessors, (971), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 975 transitions. [2022-04-28 08:51:11,643 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 975 transitions. Word has length 90 [2022-04-28 08:51:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:51:11,644 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 975 transitions. [2022-04-28 08:51:11,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:11,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 649 states and 975 transitions. [2022-04-28 08:51:14,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 975 edges. 974 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 975 transitions. [2022-04-28 08:51:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 08:51:14,858 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:51:14,858 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:51:14,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:51:14,858 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:51:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:51:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash -14689004, now seen corresponding path program 1 times [2022-04-28 08:51:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:14,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1439528033] [2022-04-28 08:51:14,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:51:14,903 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:51:14,903 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:51:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash -14689004, now seen corresponding path program 2 times [2022-04-28 08:51:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:51:14,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793775411] [2022-04-28 08:51:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:51:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:51:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:15,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:51:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:15,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {67027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {67020#true} is VALID [2022-04-28 08:51:15,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {67020#true} assume true; {67020#true} is VALID [2022-04-28 08:51:15,116 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67020#true} {67020#true} #708#return; {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {67020#true} call ULTIMATE.init(); {67027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {67027#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {67020#true} assume true; {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67020#true} {67020#true} #708#return; {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {67020#true} call #t~ret161 := main(); {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {67020#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; {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {67020#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L272 TraceCheckUtils]: 7: Hoare triple {67020#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {67020#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); {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {67020#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; {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {67020#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; {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {67020#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {67020#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {67020#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {67020#true} assume !false; {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {67020#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); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {67020#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {67020#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {67020#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {67020#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 20: Hoare triple {67020#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {67020#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {67020#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {67020#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 24: Hoare triple {67020#true} assume 8464 == #t~mem55;havoc #t~mem55; {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 25: Hoare triple {67020#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; {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 26: Hoare triple {67020#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 27: Hoare triple {67020#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); {67020#true} is VALID [2022-04-28 08:51:15,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {67020#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); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {67020#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 30: Hoare triple {67020#true} ~skip~0 := 0; {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 31: Hoare triple {67020#true} assume !false; {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 32: Hoare triple {67020#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); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 33: Hoare triple {67020#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {67020#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {67020#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {67020#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {67020#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 38: Hoare triple {67020#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 39: Hoare triple {67020#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 40: Hoare triple {67020#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 41: Hoare triple {67020#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 42: Hoare triple {67020#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {67020#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {67020#true} assume 8496 == #t~mem58;havoc #t~mem58; {67020#true} is VALID [2022-04-28 08:51:15,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {67020#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {67020#true} is VALID [2022-04-28 08:51:15,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {67020#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {67020#true} is VALID [2022-04-28 08:51:15,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {67020#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {67020#true} is VALID [2022-04-28 08:51:15,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {67020#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,125 INFO L290 TraceCheckUtils]: 49: Hoare triple {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,125 INFO L290 TraceCheckUtils]: 50: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,125 INFO L290 TraceCheckUtils]: 51: Hoare triple {67025#(= 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; {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,125 INFO L290 TraceCheckUtils]: 52: Hoare triple {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,127 INFO L290 TraceCheckUtils]: 57: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,127 INFO L290 TraceCheckUtils]: 60: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,128 INFO L290 TraceCheckUtils]: 63: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,129 INFO L290 TraceCheckUtils]: 67: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,129 INFO L290 TraceCheckUtils]: 68: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,130 INFO L290 TraceCheckUtils]: 70: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,130 INFO L290 TraceCheckUtils]: 71: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,130 INFO L290 TraceCheckUtils]: 72: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,131 INFO L290 TraceCheckUtils]: 74: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,131 INFO L290 TraceCheckUtils]: 75: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,131 INFO L290 TraceCheckUtils]: 76: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,132 INFO L290 TraceCheckUtils]: 77: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,133 INFO L290 TraceCheckUtils]: 81: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,133 INFO L290 TraceCheckUtils]: 82: Hoare triple {67025#(= 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); {67025#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:15,133 INFO L290 TraceCheckUtils]: 83: Hoare triple {67025#(= 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); {67026#(= |ssl3_accept_#t~mem76| 8656)} is VALID [2022-04-28 08:51:15,133 INFO L290 TraceCheckUtils]: 84: Hoare triple {67026#(= |ssl3_accept_#t~mem76| 8656)} assume 8641 == #t~mem76;havoc #t~mem76; {67021#false} is VALID [2022-04-28 08:51:15,133 INFO L290 TraceCheckUtils]: 85: Hoare triple {67021#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {67021#false} is VALID [2022-04-28 08:51:15,133 INFO L290 TraceCheckUtils]: 86: Hoare triple {67021#false} assume !(4 == ~blastFlag~0); {67021#false} is VALID [2022-04-28 08:51:15,133 INFO L290 TraceCheckUtils]: 87: Hoare triple {67021#false} assume !(7 == ~blastFlag~0); {67021#false} is VALID [2022-04-28 08:51:15,134 INFO L290 TraceCheckUtils]: 88: Hoare triple {67021#false} assume !(10 == ~blastFlag~0); {67021#false} is VALID [2022-04-28 08:51:15,134 INFO L290 TraceCheckUtils]: 89: Hoare triple {67021#false} assume 13 == ~blastFlag~0; {67021#false} is VALID [2022-04-28 08:51:15,134 INFO L290 TraceCheckUtils]: 90: Hoare triple {67021#false} assume !false; {67021#false} is VALID [2022-04-28 08:51:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:51:15,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:51:15,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793775411] [2022-04-28 08:51:15,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793775411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:15,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:15,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:15,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:51:15,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1439528033] [2022-04-28 08:51:15,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1439528033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:15,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:15,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:15,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221488775] [2022-04-28 08:51:15,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:51:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 08:51:15,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:51:15,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:15,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:15,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:51:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:15,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:51:15,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:51:15,173 INFO L87 Difference]: Start difference. First operand 649 states and 975 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:17,241 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:24,293 INFO L93 Difference]: Finished difference Result 1558 states and 2340 transitions. [2022-04-28 08:51:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:51:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 08:51:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:51:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-28 08:51:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2022-04-28 08:51:24,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 577 transitions. [2022-04-28 08:51:24,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:24,714 INFO L225 Difference]: With dead ends: 1558 [2022-04-28 08:51:24,714 INFO L226 Difference]: Without dead ends: 935 [2022-04-28 08:51:24,715 INFO L412 NwaCegarLoop]: 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-28 08:51:24,716 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 82 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:51:24,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 691 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 643 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 08:51:24,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2022-04-28 08:51:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 775. [2022-04-28 08:51:24,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:51:24,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 935 states. Second operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:24,785 INFO L74 IsIncluded]: Start isIncluded. First operand 935 states. Second operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:24,786 INFO L87 Difference]: Start difference. First operand 935 states. Second operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:24,808 INFO L93 Difference]: Finished difference Result 935 states and 1394 transitions. [2022-04-28 08:51:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1394 transitions. [2022-04-28 08:51:24,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:24,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:24,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 935 states. [2022-04-28 08:51:24,810 INFO L87 Difference]: Start difference. First operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 935 states. [2022-04-28 08:51:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:24,840 INFO L93 Difference]: Finished difference Result 935 states and 1394 transitions. [2022-04-28 08:51:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1394 transitions. [2022-04-28 08:51:24,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:24,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:24,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:51:24,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:51:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 770 states have (on average 1.5337662337662337) internal successors, (1181), 770 states have internal predecessors, (1181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1185 transitions. [2022-04-28 08:51:24,865 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1185 transitions. Word has length 91 [2022-04-28 08:51:24,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:51:24,865 INFO L495 AbstractCegarLoop]: Abstraction has 775 states and 1185 transitions. [2022-04-28 08:51:24,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:24,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 775 states and 1185 transitions. [2022-04-28 08:51:28,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1185 edges. 1184 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1185 transitions. [2022-04-28 08:51:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-28 08:51:28,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:51:28,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:51:28,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:51:28,213 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:51:28,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:51:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash -912082282, now seen corresponding path program 1 times [2022-04-28 08:51:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:28,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [815083234] [2022-04-28 08:51:28,246 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:51:28,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:51:28,246 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:51:28,246 INFO L85 PathProgramCache]: Analyzing trace with hash -912082282, now seen corresponding path program 2 times [2022-04-28 08:51:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:51:28,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201729230] [2022-04-28 08:51:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:51:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:51:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:51:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:28,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {73575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {73568#true} is VALID [2022-04-28 08:51:28,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {73568#true} assume true; {73568#true} is VALID [2022-04-28 08:51:28,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73568#true} {73568#true} #708#return; {73568#true} is VALID [2022-04-28 08:51:28,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {73568#true} call ULTIMATE.init(); {73575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:51:28,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {73575#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {73568#true} is VALID [2022-04-28 08:51:28,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {73568#true} assume true; {73568#true} is VALID [2022-04-28 08:51:28,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73568#true} {73568#true} #708#return; {73568#true} is VALID [2022-04-28 08:51:28,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {73568#true} call #t~ret161 := main(); {73568#true} is VALID [2022-04-28 08:51:28,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {73568#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; {73568#true} is VALID [2022-04-28 08:51:28,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {73568#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,480 INFO L272 TraceCheckUtils]: 7: Hoare triple {73568#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {73568#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); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {73568#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; {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {73568#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; {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {73568#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {73568#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {73568#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {73568#true} assume !false; {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {73568#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); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {73568#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {73568#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {73568#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {73568#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {73568#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {73568#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {73568#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {73568#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {73568#true} assume 8464 == #t~mem55;havoc #t~mem55; {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {73568#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; {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {73568#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {73568#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); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {73568#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); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {73568#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {73568#true} ~skip~0 := 0; {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 31: Hoare triple {73568#true} assume !false; {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {73568#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); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {73568#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {73568#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {73568#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {73568#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {73568#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {73568#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 39: Hoare triple {73568#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {73568#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {73568#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {73568#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {73568#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {73568#true} assume 8496 == #t~mem58;havoc #t~mem58; {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {73568#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {73568#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {73568#true} is VALID [2022-04-28 08:51:28,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {73568#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {73568#true} is VALID [2022-04-28 08:51:28,484 INFO L290 TraceCheckUtils]: 48: Hoare triple {73568#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,485 INFO L290 TraceCheckUtils]: 49: Hoare triple {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,485 INFO L290 TraceCheckUtils]: 51: Hoare triple {73573#(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; {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,486 INFO L290 TraceCheckUtils]: 54: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,488 INFO L290 TraceCheckUtils]: 59: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,489 INFO L290 TraceCheckUtils]: 60: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,489 INFO L290 TraceCheckUtils]: 61: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,489 INFO L290 TraceCheckUtils]: 62: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,490 INFO L290 TraceCheckUtils]: 65: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,491 INFO L290 TraceCheckUtils]: 66: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,491 INFO L290 TraceCheckUtils]: 67: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,491 INFO L290 TraceCheckUtils]: 68: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,492 INFO L290 TraceCheckUtils]: 69: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,492 INFO L290 TraceCheckUtils]: 70: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,492 INFO L290 TraceCheckUtils]: 71: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,493 INFO L290 TraceCheckUtils]: 72: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,493 INFO L290 TraceCheckUtils]: 73: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,494 INFO L290 TraceCheckUtils]: 74: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,494 INFO L290 TraceCheckUtils]: 75: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,494 INFO L290 TraceCheckUtils]: 76: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,495 INFO L290 TraceCheckUtils]: 77: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,495 INFO L290 TraceCheckUtils]: 79: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,496 INFO L290 TraceCheckUtils]: 80: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,496 INFO L290 TraceCheckUtils]: 81: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,496 INFO L290 TraceCheckUtils]: 82: Hoare triple {73573#(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); {73573#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 83: Hoare triple {73573#(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); {73574#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 84: Hoare triple {73574#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {73569#false} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 85: Hoare triple {73569#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {73569#false} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 86: Hoare triple {73569#false} assume !(4 == ~blastFlag~0); {73569#false} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 87: Hoare triple {73569#false} assume !(7 == ~blastFlag~0); {73569#false} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 88: Hoare triple {73569#false} assume !(10 == ~blastFlag~0); {73569#false} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 89: Hoare triple {73569#false} assume 13 == ~blastFlag~0; {73569#false} is VALID [2022-04-28 08:51:28,497 INFO L290 TraceCheckUtils]: 90: Hoare triple {73569#false} assume !false; {73569#false} is VALID [2022-04-28 08:51:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:51:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:51:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201729230] [2022-04-28 08:51:28,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201729230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:28,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:28,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:28,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:51:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [815083234] [2022-04-28 08:51:28,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [815083234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:28,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:28,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813523675] [2022-04-28 08:51:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:51:28,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 08:51:28,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:51:28,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:28,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:28,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:51:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:51:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:51:28,553 INFO L87 Difference]: Start difference. First operand 775 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:36,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:44,189 INFO L93 Difference]: Finished difference Result 1815 states and 2777 transitions. [2022-04-28 08:51:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:51:44,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 91 [2022-04-28 08:51:44,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:51:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:51:44,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-04-28 08:51:44,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 609 transitions. [2022-04-28 08:51:44,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 609 edges. 609 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:44,655 INFO L225 Difference]: With dead ends: 1815 [2022-04-28 08:51:44,655 INFO L226 Difference]: Without dead ends: 1066 [2022-04-28 08:51:44,656 INFO L412 NwaCegarLoop]: 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-28 08:51:44,656 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 121 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:51:44,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 396 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 08:51:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-04-28 08:51:44,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 721. [2022-04-28 08:51:44,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:51:44,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1066 states. Second operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:44,690 INFO L74 IsIncluded]: Start isIncluded. First operand 1066 states. Second operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:44,690 INFO L87 Difference]: Start difference. First operand 1066 states. Second operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:44,718 INFO L93 Difference]: Finished difference Result 1066 states and 1621 transitions. [2022-04-28 08:51:44,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1621 transitions. [2022-04-28 08:51:44,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:44,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:44,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1066 states. [2022-04-28 08:51:44,720 INFO L87 Difference]: Start difference. First operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1066 states. [2022-04-28 08:51:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:51:44,749 INFO L93 Difference]: Finished difference Result 1066 states and 1621 transitions. [2022-04-28 08:51:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1621 transitions. [2022-04-28 08:51:44,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:51:44,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:51:44,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:51:44,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:51:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 716 states have (on average 1.553072625698324) internal successors, (1112), 716 states have internal predecessors, (1112), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1116 transitions. [2022-04-28 08:51:44,768 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1116 transitions. Word has length 91 [2022-04-28 08:51:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:51:44,768 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 1116 transitions. [2022-04-28 08:51:44,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:44,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 721 states and 1116 transitions. [2022-04-28 08:51:48,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1116 edges. 1115 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1116 transitions. [2022-04-28 08:51:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 08:51:48,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:51:48,212 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:51:48,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:51:48,212 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:51:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:51:48,212 INFO L85 PathProgramCache]: Analyzing trace with hash 393910684, now seen corresponding path program 1 times [2022-04-28 08:51:48,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:48,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048248160] [2022-04-28 08:51:48,264 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:51:48,264 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:51:48,264 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:51:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash 393910684, now seen corresponding path program 2 times [2022-04-28 08:51:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:51:48,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167713722] [2022-04-28 08:51:48,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:51:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:51:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:51:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:51:48,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {80791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {80784#true} is VALID [2022-04-28 08:51:48,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {80784#true} assume true; {80784#true} is VALID [2022-04-28 08:51:48,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80784#true} {80784#true} #708#return; {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {80784#true} call ULTIMATE.init(); {80791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {80791#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {80784#true} assume true; {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80784#true} {80784#true} #708#return; {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {80784#true} call #t~ret161 := main(); {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {80784#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; {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {80784#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L272 TraceCheckUtils]: 7: Hoare triple {80784#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {80784#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); {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {80784#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; {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {80784#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; {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {80784#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {80784#true} is VALID [2022-04-28 08:51:48,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {80784#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {80784#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {80784#true} assume !false; {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {80784#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); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {80784#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {80784#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {80784#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {80784#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {80784#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {80784#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {80784#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {80784#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {80784#true} assume 8464 == #t~mem55;havoc #t~mem55; {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {80784#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; {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {80784#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {80784#true} is VALID [2022-04-28 08:51:48,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {80784#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); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {80784#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); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {80784#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {80784#true} ~skip~0 := 0; {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {80784#true} assume !false; {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {80784#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); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {80784#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {80784#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {80784#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {80784#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {80784#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {80784#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {80784#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 40: Hoare triple {80784#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,459 INFO L290 TraceCheckUtils]: 41: Hoare triple {80784#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {80784#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {80784#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {80784#true} assume 8496 == #t~mem58;havoc #t~mem58; {80784#true} is VALID [2022-04-28 08:51:48,460 INFO L290 TraceCheckUtils]: 45: Hoare triple {80784#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {80784#true} is VALID [2022-04-28 08:51:48,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {80784#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {80784#true} is VALID [2022-04-28 08:51:48,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {80784#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {80784#true} is VALID [2022-04-28 08:51:48,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {80784#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,462 INFO L290 TraceCheckUtils]: 51: Hoare triple {80789#(= 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; {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,463 INFO L290 TraceCheckUtils]: 53: Hoare triple {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,463 INFO L290 TraceCheckUtils]: 54: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,463 INFO L290 TraceCheckUtils]: 55: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,467 INFO L290 TraceCheckUtils]: 64: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,467 INFO L290 TraceCheckUtils]: 65: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,468 INFO L290 TraceCheckUtils]: 67: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,468 INFO L290 TraceCheckUtils]: 68: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,469 INFO L290 TraceCheckUtils]: 70: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,470 INFO L290 TraceCheckUtils]: 73: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,470 INFO L290 TraceCheckUtils]: 74: Hoare triple {80789#(= 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); {80789#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 75: Hoare triple {80789#(= 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); {80790#(= |ssl3_accept_#t~mem68| 8656)} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 76: Hoare triple {80790#(= |ssl3_accept_#t~mem68| 8656)} assume 8448 == #t~mem68;havoc #t~mem68; {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 77: Hoare triple {80785#false} assume !(~num1~0 > 0); {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {80785#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; {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {80785#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 80: Hoare triple {80785#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 81: Hoare triple {80785#false} ~skip~0 := 0; {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 82: Hoare triple {80785#false} assume !false; {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 83: Hoare triple {80785#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,471 INFO L290 TraceCheckUtils]: 84: Hoare triple {80785#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 85: Hoare triple {80785#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 86: Hoare triple {80785#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 87: Hoare triple {80785#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 88: Hoare triple {80785#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 89: Hoare triple {80785#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 90: Hoare triple {80785#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 91: Hoare triple {80785#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {80785#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {80785#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 94: Hoare triple {80785#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 95: Hoare triple {80785#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 96: Hoare triple {80785#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 97: Hoare triple {80785#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 98: Hoare triple {80785#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,472 INFO L290 TraceCheckUtils]: 99: Hoare triple {80785#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 100: Hoare triple {80785#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 101: Hoare triple {80785#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 102: Hoare triple {80785#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 103: Hoare triple {80785#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 104: Hoare triple {80785#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 105: Hoare triple {80785#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 106: Hoare triple {80785#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 107: Hoare triple {80785#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 108: Hoare triple {80785#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 109: Hoare triple {80785#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 110: Hoare triple {80785#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 111: Hoare triple {80785#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 112: Hoare triple {80785#false} assume 8640 == #t~mem75;havoc #t~mem75; {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 113: Hoare triple {80785#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {80785#false} is VALID [2022-04-28 08:51:48,473 INFO L290 TraceCheckUtils]: 114: Hoare triple {80785#false} assume !(4 == ~blastFlag~0); {80785#false} is VALID [2022-04-28 08:51:48,474 INFO L290 TraceCheckUtils]: 115: Hoare triple {80785#false} assume !(7 == ~blastFlag~0); {80785#false} is VALID [2022-04-28 08:51:48,474 INFO L290 TraceCheckUtils]: 116: Hoare triple {80785#false} assume !(10 == ~blastFlag~0); {80785#false} is VALID [2022-04-28 08:51:48,474 INFO L290 TraceCheckUtils]: 117: Hoare triple {80785#false} assume 13 == ~blastFlag~0; {80785#false} is VALID [2022-04-28 08:51:48,474 INFO L290 TraceCheckUtils]: 118: Hoare triple {80785#false} assume !false; {80785#false} is VALID [2022-04-28 08:51:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:51:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:51:48,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167713722] [2022-04-28 08:51:48,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167713722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:48,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:48,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:48,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:51:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048248160] [2022-04-28 08:51:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048248160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:51:48,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:51:48,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:51:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093617789] [2022-04-28 08:51:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:51:48,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 08:51:48,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:51:48,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:48,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:51:48,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:51:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:51:48,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:51:48,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:51:48,529 INFO L87 Difference]: Start difference. First operand 721 states and 1116 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:51:51,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:51:53,961 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-28 08:51:57,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:04,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:04,060 INFO L93 Difference]: Finished difference Result 1693 states and 2607 transitions. [2022-04-28 08:52:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:04,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 08:52:04,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 08:52:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-04-28 08:52:04,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 572 transitions. [2022-04-28 08:52:04,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:04,487 INFO L225 Difference]: With dead ends: 1693 [2022-04-28 08:52:04,487 INFO L226 Difference]: Without dead ends: 998 [2022-04-28 08:52:04,492 INFO L412 NwaCegarLoop]: 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-28 08:52:04,492 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 88 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:52:04,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 687 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 633 Invalid, 2 Unknown, 0 Unchecked, 7.6s Time] [2022-04-28 08:52:04,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-04-28 08:52:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 823. [2022-04-28 08:52:04,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:52:04,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 998 states. Second operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:04,549 INFO L74 IsIncluded]: Start isIncluded. First operand 998 states. Second operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:04,549 INFO L87 Difference]: Start difference. First operand 998 states. Second operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:04,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:04,576 INFO L93 Difference]: Finished difference Result 998 states and 1520 transitions. [2022-04-28 08:52:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1520 transitions. [2022-04-28 08:52:04,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:04,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:04,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 998 states. [2022-04-28 08:52:04,578 INFO L87 Difference]: Start difference. First operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 998 states. [2022-04-28 08:52:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:04,623 INFO L93 Difference]: Finished difference Result 998 states and 1520 transitions. [2022-04-28 08:52:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1520 transitions. [2022-04-28 08:52:04,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:04,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:04,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:52:04,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:52:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 818 states have (on average 1.561124694376528) internal successors, (1277), 818 states have internal predecessors, (1277), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1281 transitions. [2022-04-28 08:52:04,650 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1281 transitions. Word has length 119 [2022-04-28 08:52:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:52:04,650 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1281 transitions. [2022-04-28 08:52:04,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:04,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 823 states and 1281 transitions. [2022-04-28 08:52:08,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1281 edges. 1280 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1281 transitions. [2022-04-28 08:52:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-28 08:52:08,212 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:52:08,212 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:52:08,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:52:08,212 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:52:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:52:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -573439970, now seen corresponding path program 1 times [2022-04-28 08:52:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:08,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [624147194] [2022-04-28 08:52:08,267 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:52:08,267 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:52:08,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:52:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash -573439970, now seen corresponding path program 2 times [2022-04-28 08:52:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:52:08,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441762155] [2022-04-28 08:52:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:52:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:52:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:52:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:08,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {87831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {87824#true} is VALID [2022-04-28 08:52:08,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {87824#true} assume true; {87824#true} is VALID [2022-04-28 08:52:08,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87824#true} {87824#true} #708#return; {87824#true} is VALID [2022-04-28 08:52:08,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {87824#true} call ULTIMATE.init(); {87831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:52:08,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {87831#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {87824#true} assume true; {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87824#true} {87824#true} #708#return; {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {87824#true} call #t~ret161 := main(); {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {87824#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; {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {87824#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L272 TraceCheckUtils]: 7: Hoare triple {87824#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {87824#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); {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {87824#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; {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {87824#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; {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {87824#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {87824#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {87824#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {87824#true} assume !false; {87824#true} is VALID [2022-04-28 08:52:08,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {87824#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); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {87824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {87824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {87824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {87824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {87824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {87824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {87824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {87824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 24: Hoare triple {87824#true} assume 8464 == #t~mem55;havoc #t~mem55; {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 25: Hoare triple {87824#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; {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 26: Hoare triple {87824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 27: Hoare triple {87824#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); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {87824#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); {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {87824#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87824#true} is VALID [2022-04-28 08:52:08,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {87824#true} ~skip~0 := 0; {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 31: Hoare triple {87824#true} assume !false; {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {87824#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); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {87824#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 34: Hoare triple {87824#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 35: Hoare triple {87824#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {87824#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {87824#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {87824#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {87824#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {87824#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {87824#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {87824#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {87824#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {87824#true} assume 8496 == #t~mem58;havoc #t~mem58; {87824#true} is VALID [2022-04-28 08:52:08,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {87824#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {87824#true} is VALID [2022-04-28 08:52:08,560 INFO L290 TraceCheckUtils]: 46: Hoare triple {87824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {87824#true} is VALID [2022-04-28 08:52:08,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {87824#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {87824#true} is VALID [2022-04-28 08:52:08,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {87824#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {87829#(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; {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,563 INFO L290 TraceCheckUtils]: 53: Hoare triple {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,564 INFO L290 TraceCheckUtils]: 56: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,568 INFO L290 TraceCheckUtils]: 68: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,569 INFO L290 TraceCheckUtils]: 71: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,569 INFO L290 TraceCheckUtils]: 72: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,569 INFO L290 TraceCheckUtils]: 73: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {87829#(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); {87829#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:08,570 INFO L290 TraceCheckUtils]: 75: Hoare triple {87829#(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); {87830#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-28 08:52:08,570 INFO L290 TraceCheckUtils]: 76: Hoare triple {87830#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 77: Hoare triple {87825#false} assume !(~num1~0 > 0); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 78: Hoare triple {87825#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; {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 79: Hoare triple {87825#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 80: Hoare triple {87825#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 81: Hoare triple {87825#false} ~skip~0 := 0; {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 82: Hoare triple {87825#false} assume !false; {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 83: Hoare triple {87825#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 84: Hoare triple {87825#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 85: Hoare triple {87825#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 86: Hoare triple {87825#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 87: Hoare triple {87825#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 88: Hoare triple {87825#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 89: Hoare triple {87825#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 90: Hoare triple {87825#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,571 INFO L290 TraceCheckUtils]: 91: Hoare triple {87825#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 92: Hoare triple {87825#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 93: Hoare triple {87825#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 94: Hoare triple {87825#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 95: Hoare triple {87825#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 96: Hoare triple {87825#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 97: Hoare triple {87825#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 98: Hoare triple {87825#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 99: Hoare triple {87825#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 100: Hoare triple {87825#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 101: Hoare triple {87825#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 102: Hoare triple {87825#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 103: Hoare triple {87825#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 104: Hoare triple {87825#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 105: Hoare triple {87825#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,572 INFO L290 TraceCheckUtils]: 106: Hoare triple {87825#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 107: Hoare triple {87825#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 108: Hoare triple {87825#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 109: Hoare triple {87825#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 110: Hoare triple {87825#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 111: Hoare triple {87825#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 112: Hoare triple {87825#false} assume 8640 == #t~mem75;havoc #t~mem75; {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 113: Hoare triple {87825#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 114: Hoare triple {87825#false} assume !(4 == ~blastFlag~0); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 115: Hoare triple {87825#false} assume !(7 == ~blastFlag~0); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 116: Hoare triple {87825#false} assume !(10 == ~blastFlag~0); {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 117: Hoare triple {87825#false} assume 13 == ~blastFlag~0; {87825#false} is VALID [2022-04-28 08:52:08,573 INFO L290 TraceCheckUtils]: 118: Hoare triple {87825#false} assume !false; {87825#false} is VALID [2022-04-28 08:52:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:52:08,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:52:08,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441762155] [2022-04-28 08:52:08,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441762155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:08,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:08,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:08,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:52:08,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [624147194] [2022-04-28 08:52:08,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [624147194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:08,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:08,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21735542] [2022-04-28 08:52:08,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:52:08,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 08:52:08,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:52:08,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:08,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:08,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:52:08,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:08,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:52:08,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:52:08,648 INFO L87 Difference]: Start difference. First operand 823 states and 1281 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:11,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:14,462 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-28 08:52:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:22,753 INFO L93 Difference]: Finished difference Result 2067 states and 3221 transitions. [2022-04-28 08:52:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:22,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-04-28 08:52:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-28 08:52:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-28 08:52:22,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-28 08:52:23,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:23,162 INFO L225 Difference]: With dead ends: 2067 [2022-04-28 08:52:23,162 INFO L226 Difference]: Without dead ends: 1270 [2022-04-28 08:52:23,163 INFO L412 NwaCegarLoop]: 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-28 08:52:23,163 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 127 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:52:23,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 678 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 08:52:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-04-28 08:52:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 913. [2022-04-28 08:52:23,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:52:23,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1270 states. Second operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:23,238 INFO L74 IsIncluded]: Start isIncluded. First operand 1270 states. Second operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:23,238 INFO L87 Difference]: Start difference. First operand 1270 states. Second operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:23,276 INFO L93 Difference]: Finished difference Result 1270 states and 1966 transitions. [2022-04-28 08:52:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1966 transitions. [2022-04-28 08:52:23,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:23,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:23,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1270 states. [2022-04-28 08:52:23,278 INFO L87 Difference]: Start difference. First operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1270 states. [2022-04-28 08:52:23,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:23,316 INFO L93 Difference]: Finished difference Result 1270 states and 1966 transitions. [2022-04-28 08:52:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1966 transitions. [2022-04-28 08:52:23,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:23,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:23,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:52:23,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:52:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 908 states have (on average 1.5748898678414096) internal successors, (1430), 908 states have internal predecessors, (1430), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1434 transitions. [2022-04-28 08:52:23,348 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1434 transitions. Word has length 119 [2022-04-28 08:52:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:52:23,348 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1434 transitions. [2022-04-28 08:52:23,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:23,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 913 states and 1434 transitions. [2022-04-28 08:52:27,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1434 edges. 1433 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1434 transitions. [2022-04-28 08:52:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 08:52:27,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:52:27,013 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:52:27,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:52:27,013 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:52:27,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:52:27,014 INFO L85 PathProgramCache]: Analyzing trace with hash -72062084, now seen corresponding path program 1 times [2022-04-28 08:52:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:27,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245254988] [2022-04-28 08:52:27,113 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:52:27,113 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:52:27,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:52:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash -72062084, now seen corresponding path program 2 times [2022-04-28 08:52:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:52:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488530053] [2022-04-28 08:52:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:52:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:52:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:52:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:27,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {96343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96336#true} is VALID [2022-04-28 08:52:27,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {96336#true} assume true; {96336#true} is VALID [2022-04-28 08:52:27,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {96336#true} {96336#true} #708#return; {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {96336#true} call ULTIMATE.init(); {96343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {96343#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {96336#true} assume true; {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96336#true} {96336#true} #708#return; {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {96336#true} call #t~ret161 := main(); {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {96336#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; {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {96336#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L272 TraceCheckUtils]: 7: Hoare triple {96336#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {96336#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); {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {96336#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; {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {96336#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; {96336#true} is VALID [2022-04-28 08:52:27,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {96336#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {96336#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {96336#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {96336#true} assume !false; {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {96336#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); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {96336#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {96336#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {96336#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {96336#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {96336#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {96336#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {96336#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {96336#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {96336#true} assume 8464 == #t~mem55;havoc #t~mem55; {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {96336#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; {96336#true} is VALID [2022-04-28 08:52:27,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {96336#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {96336#true} is VALID [2022-04-28 08:52:27,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {96336#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); {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:27,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {96341#(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); {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:27,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {96341#(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; {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:27,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:27,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {96341#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:27,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {96341#(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); {96342#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {96342#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {96337#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {96337#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {96337#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 37: Hoare triple {96337#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {96337#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); {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {96337#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {96337#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); {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {96337#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); {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {96337#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {96337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {96337#false} ~skip~0 := 0; {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-28 08:52:27,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {96337#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {96337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 48: Hoare triple {96337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 49: Hoare triple {96337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {96337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {96337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {96337#false} assume 8480 == #t~mem52;havoc #t~mem52; {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {96337#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; {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 54: Hoare triple {96337#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); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 55: Hoare triple {96337#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {96337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 57: Hoare triple {96337#false} ~skip~0 := 0; {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {96337#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {96337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {96337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {96337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 63: Hoare triple {96337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {96337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 65: Hoare triple {96337#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 66: Hoare triple {96337#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 67: Hoare triple {96337#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 68: Hoare triple {96337#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 69: Hoare triple {96337#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 70: Hoare triple {96337#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {96337#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 72: Hoare triple {96337#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {96337#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {96337#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {96337#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,304 INFO L290 TraceCheckUtils]: 76: Hoare triple {96337#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 77: Hoare triple {96337#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 78: Hoare triple {96337#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 79: Hoare triple {96337#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 80: Hoare triple {96337#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 81: Hoare triple {96337#false} assume 8448 == #t~mem68;havoc #t~mem68; {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 82: Hoare triple {96337#false} assume !(~num1~0 > 0); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 83: Hoare triple {96337#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; {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 84: Hoare triple {96337#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 85: Hoare triple {96337#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 86: Hoare triple {96337#false} ~skip~0 := 0; {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 87: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 88: Hoare triple {96337#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 89: Hoare triple {96337#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,305 INFO L290 TraceCheckUtils]: 90: Hoare triple {96337#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 91: Hoare triple {96337#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 92: Hoare triple {96337#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 93: Hoare triple {96337#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 94: Hoare triple {96337#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 95: Hoare triple {96337#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 96: Hoare triple {96337#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {96337#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 98: Hoare triple {96337#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {96337#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {96337#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 101: Hoare triple {96337#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 102: Hoare triple {96337#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 103: Hoare triple {96337#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 104: Hoare triple {96337#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,306 INFO L290 TraceCheckUtils]: 105: Hoare triple {96337#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 106: Hoare triple {96337#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 107: Hoare triple {96337#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 108: Hoare triple {96337#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 109: Hoare triple {96337#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 110: Hoare triple {96337#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 111: Hoare triple {96337#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 112: Hoare triple {96337#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 113: Hoare triple {96337#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 114: Hoare triple {96337#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 115: Hoare triple {96337#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 116: Hoare triple {96337#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 117: Hoare triple {96337#false} assume 8640 == #t~mem75;havoc #t~mem75; {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 118: Hoare triple {96337#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 119: Hoare triple {96337#false} assume !(4 == ~blastFlag~0); {96337#false} is VALID [2022-04-28 08:52:27,307 INFO L290 TraceCheckUtils]: 120: Hoare triple {96337#false} assume !(7 == ~blastFlag~0); {96337#false} is VALID [2022-04-28 08:52:27,308 INFO L290 TraceCheckUtils]: 121: Hoare triple {96337#false} assume !(10 == ~blastFlag~0); {96337#false} is VALID [2022-04-28 08:52:27,308 INFO L290 TraceCheckUtils]: 122: Hoare triple {96337#false} assume 13 == ~blastFlag~0; {96337#false} is VALID [2022-04-28 08:52:27,308 INFO L290 TraceCheckUtils]: 123: Hoare triple {96337#false} assume !false; {96337#false} is VALID [2022-04-28 08:52:27,308 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-28 08:52:27,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:52:27,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488530053] [2022-04-28 08:52:27,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488530053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:27,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:27,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:27,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:52:27,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245254988] [2022-04-28 08:52:27,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245254988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:27,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:27,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585530891] [2022-04-28 08:52:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:52:27,309 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 124 [2022-04-28 08:52:27,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:52:27,309 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-28 08:52:27,369 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-28 08:52:27,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:52:27,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:27,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:52:27,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:52:27,370 INFO L87 Difference]: Start difference. First operand 913 states and 1434 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-28 08:52:29,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:31,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:41,745 INFO L93 Difference]: Finished difference Result 1738 states and 2689 transitions. [2022-04-28 08:52:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:41,745 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 124 [2022-04-28 08:52:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:41,746 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-28 08:52:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-28 08:52:41,748 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-28 08:52:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2022-04-28 08:52:41,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 596 transitions. [2022-04-28 08:52:42,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:42,206 INFO L225 Difference]: With dead ends: 1738 [2022-04-28 08:52:42,206 INFO L226 Difference]: Without dead ends: 1112 [2022-04-28 08:52:42,207 INFO L412 NwaCegarLoop]: 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-28 08:52:42,207 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 143 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:52:42,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 402 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 478 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 08:52:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2022-04-28 08:52:42,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 913. [2022-04-28 08:52:42,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:52:42,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1112 states. Second operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:42,257 INFO L74 IsIncluded]: Start isIncluded. First operand 1112 states. Second operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:42,258 INFO L87 Difference]: Start difference. First operand 1112 states. Second operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:42,288 INFO L93 Difference]: Finished difference Result 1112 states and 1690 transitions. [2022-04-28 08:52:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1690 transitions. [2022-04-28 08:52:42,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:42,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:42,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-28 08:52:42,290 INFO L87 Difference]: Start difference. First operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1112 states. [2022-04-28 08:52:42,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:42,320 INFO L93 Difference]: Finished difference Result 1112 states and 1690 transitions. [2022-04-28 08:52:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1690 transitions. [2022-04-28 08:52:42,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:52:42,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:52:42,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:52:42,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:52:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 908 states have (on average 1.5583700440528634) internal successors, (1415), 908 states have internal predecessors, (1415), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1419 transitions. [2022-04-28 08:52:42,352 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1419 transitions. Word has length 124 [2022-04-28 08:52:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:52:42,352 INFO L495 AbstractCegarLoop]: Abstraction has 913 states and 1419 transitions. [2022-04-28 08:52:42,352 INFO L496 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-28 08:52:42,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 913 states and 1419 transitions. [2022-04-28 08:52:46,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1419 edges. 1418 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1419 transitions. [2022-04-28 08:52:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-28 08:52:46,148 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:52:46,148 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:52:46,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 08:52:46,148 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:52:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:52:46,148 INFO L85 PathProgramCache]: Analyzing trace with hash -933759754, now seen corresponding path program 1 times [2022-04-28 08:52:46,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:46,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1440226488] [2022-04-28 08:52:46,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:52:46,218 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:52:46,218 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:52:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -933759754, now seen corresponding path program 2 times [2022-04-28 08:52:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:52:46,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701913771] [2022-04-28 08:52:46,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:52:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:52:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:52:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:52:46,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {103881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {103874#true} is VALID [2022-04-28 08:52:46,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {103874#true} assume true; {103874#true} is VALID [2022-04-28 08:52:46,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103874#true} {103874#true} #708#return; {103874#true} is VALID [2022-04-28 08:52:46,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {103874#true} call ULTIMATE.init(); {103881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:52:46,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {103881#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {103874#true} is VALID [2022-04-28 08:52:46,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {103874#true} assume true; {103874#true} is VALID [2022-04-28 08:52:46,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103874#true} {103874#true} #708#return; {103874#true} is VALID [2022-04-28 08:52:46,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {103874#true} call #t~ret161 := main(); {103874#true} is VALID [2022-04-28 08:52:46,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {103874#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; {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {103874#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L272 TraceCheckUtils]: 7: Hoare triple {103874#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {103874#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); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {103874#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; {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {103874#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; {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {103874#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {103874#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {103874#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {103874#true} assume !false; {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {103874#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); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {103874#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {103874#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {103874#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {103874#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {103874#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {103874#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {103874#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {103874#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {103874#true} assume 8464 == #t~mem55;havoc #t~mem55; {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {103874#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; {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {103874#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {103874#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); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 28: Hoare triple {103874#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); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {103874#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {103874#true} ~skip~0 := 0; {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {103874#true} assume !false; {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {103874#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); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {103874#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {103874#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {103874#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {103874#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {103874#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {103874#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {103874#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 40: Hoare triple {103874#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {103874#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {103874#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {103874#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {103874#true} assume 8496 == #t~mem58;havoc #t~mem58; {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {103874#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {103874#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {103874#true} is VALID [2022-04-28 08:52:46,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {103874#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {103874#true} is VALID [2022-04-28 08:52:46,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {103874#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {103879#(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; {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,446 INFO L290 TraceCheckUtils]: 63: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,446 INFO L290 TraceCheckUtils]: 64: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,446 INFO L290 TraceCheckUtils]: 65: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,447 INFO L290 TraceCheckUtils]: 66: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,447 INFO L290 TraceCheckUtils]: 67: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,448 INFO L290 TraceCheckUtils]: 69: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,448 INFO L290 TraceCheckUtils]: 70: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,449 INFO L290 TraceCheckUtils]: 71: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,449 INFO L290 TraceCheckUtils]: 72: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,449 INFO L290 TraceCheckUtils]: 73: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,450 INFO L290 TraceCheckUtils]: 74: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,450 INFO L290 TraceCheckUtils]: 75: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,450 INFO L290 TraceCheckUtils]: 76: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,451 INFO L290 TraceCheckUtils]: 79: Hoare triple {103879#(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); {103879#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:52:46,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {103879#(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); {103880#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-28 08:52:46,452 INFO L290 TraceCheckUtils]: 81: Hoare triple {103880#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {103875#false} is VALID [2022-04-28 08:52:46,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {103875#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {103875#false} is VALID [2022-04-28 08:52:46,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {103875#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); {103875#false} is VALID [2022-04-28 08:52:46,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {103875#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {103875#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 86: Hoare triple {103875#false} ~skip~0 := 0; {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 87: Hoare triple {103875#false} assume !false; {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 88: Hoare triple {103875#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 89: Hoare triple {103875#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 90: Hoare triple {103875#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 91: Hoare triple {103875#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 92: Hoare triple {103875#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 93: Hoare triple {103875#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 94: Hoare triple {103875#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 95: Hoare triple {103875#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 96: Hoare triple {103875#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 97: Hoare triple {103875#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 98: Hoare triple {103875#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 99: Hoare triple {103875#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,453 INFO L290 TraceCheckUtils]: 100: Hoare triple {103875#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 101: Hoare triple {103875#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 102: Hoare triple {103875#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 103: Hoare triple {103875#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 104: Hoare triple {103875#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 105: Hoare triple {103875#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 106: Hoare triple {103875#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 107: Hoare triple {103875#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 108: Hoare triple {103875#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 109: Hoare triple {103875#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 110: Hoare triple {103875#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 111: Hoare triple {103875#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 112: Hoare triple {103875#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 113: Hoare triple {103875#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 114: Hoare triple {103875#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,454 INFO L290 TraceCheckUtils]: 115: Hoare triple {103875#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {103875#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 117: Hoare triple {103875#false} assume 8640 == #t~mem75;havoc #t~mem75; {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 118: Hoare triple {103875#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 119: Hoare triple {103875#false} assume !(4 == ~blastFlag~0); {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 120: Hoare triple {103875#false} assume !(7 == ~blastFlag~0); {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 121: Hoare triple {103875#false} assume !(10 == ~blastFlag~0); {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 122: Hoare triple {103875#false} assume 13 == ~blastFlag~0; {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L290 TraceCheckUtils]: 123: Hoare triple {103875#false} assume !false; {103875#false} is VALID [2022-04-28 08:52:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:52:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:52:46,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701913771] [2022-04-28 08:52:46,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701913771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:46,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:46,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:46,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:52:46,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1440226488] [2022-04-28 08:52:46,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1440226488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:52:46,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:52:46,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:52:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161992717] [2022-04-28 08:52:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:52:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-28 08:52:46,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:52:46,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:46,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:46,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:52:46,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:52:46,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:52:46,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:52:46,535 INFO L87 Difference]: Start difference. First operand 913 states and 1419 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:50,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:54,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:52:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:52:59,552 INFO L93 Difference]: Finished difference Result 2119 states and 3275 transitions. [2022-04-28 08:52:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:52:59,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 124 [2022-04-28 08:52:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:52:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:52:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:52:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:52:59,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-28 08:52:59,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:52:59,980 INFO L225 Difference]: With dead ends: 2119 [2022-04-28 08:52:59,980 INFO L226 Difference]: Without dead ends: 1232 [2022-04-28 08:52:59,981 INFO L412 NwaCegarLoop]: 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-28 08:52:59,981 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 116 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:52:59,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 402 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-04-28 08:52:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-04-28 08:53:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1024. [2022-04-28 08:53:00,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:53:00,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1232 states. Second operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:00,041 INFO L74 IsIncluded]: Start isIncluded. First operand 1232 states. Second operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:00,042 INFO L87 Difference]: Start difference. First operand 1232 states. Second operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:00,078 INFO L93 Difference]: Finished difference Result 1232 states and 1882 transitions. [2022-04-28 08:53:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1882 transitions. [2022-04-28 08:53:00,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:00,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:00,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1232 states. [2022-04-28 08:53:00,080 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1232 states. [2022-04-28 08:53:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:00,116 INFO L93 Difference]: Finished difference Result 1232 states and 1882 transitions. [2022-04-28 08:53:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1882 transitions. [2022-04-28 08:53:00,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:00,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:00,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:53:00,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:53:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5652600588812562) internal successors, (1595), 1019 states have internal predecessors, (1595), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1599 transitions. [2022-04-28 08:53:00,165 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1599 transitions. Word has length 124 [2022-04-28 08:53:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:53:00,165 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1599 transitions. [2022-04-28 08:53:00,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:00,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1599 transitions. [2022-04-28 08:53:04,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1599 edges. 1598 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:04,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1599 transitions. [2022-04-28 08:53:04,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-28 08:53:04,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:53:04,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:53:04,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 08:53:04,147 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:53:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:53:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -315199378, now seen corresponding path program 1 times [2022-04-28 08:53:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:04,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [142039967] [2022-04-28 08:53:04,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:53:04,231 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:53:04,231 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:53:04,231 INFO L85 PathProgramCache]: Analyzing trace with hash -315199378, now seen corresponding path program 2 times [2022-04-28 08:53:04,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:53:04,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475558225] [2022-04-28 08:53:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:53:04,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:53:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:53:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:04,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {112643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {112636#true} is VALID [2022-04-28 08:53:04,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {112636#true} assume true; {112636#true} is VALID [2022-04-28 08:53:04,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112636#true} {112636#true} #708#return; {112636#true} is VALID [2022-04-28 08:53:04,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {112636#true} call ULTIMATE.init(); {112643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:53:04,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {112643#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {112636#true} is VALID [2022-04-28 08:53:04,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {112636#true} assume true; {112636#true} is VALID [2022-04-28 08:53:04,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112636#true} {112636#true} #708#return; {112636#true} is VALID [2022-04-28 08:53:04,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {112636#true} call #t~ret161 := main(); {112636#true} is VALID [2022-04-28 08:53:04,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {112636#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; {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {112636#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L272 TraceCheckUtils]: 7: Hoare triple {112636#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {112636#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); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {112636#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; {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {112636#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; {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {112636#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {112636#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {112636#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {112636#true} assume !false; {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {112636#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); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {112636#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {112636#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {112636#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {112636#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,501 INFO L290 TraceCheckUtils]: 20: Hoare triple {112636#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {112636#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {112636#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {112636#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {112636#true} assume 8464 == #t~mem55;havoc #t~mem55; {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {112636#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; {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {112636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {112636#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); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {112636#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); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {112636#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {112636#true} ~skip~0 := 0; {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {112636#true} assume !false; {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {112636#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); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {112636#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 34: Hoare triple {112636#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,502 INFO L290 TraceCheckUtils]: 35: Hoare triple {112636#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 36: Hoare triple {112636#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 37: Hoare triple {112636#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {112636#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {112636#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {112636#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 41: Hoare triple {112636#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {112636#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {112636#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 44: Hoare triple {112636#true} assume 8496 == #t~mem58;havoc #t~mem58; {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 45: Hoare triple {112636#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 46: Hoare triple {112636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {112636#true} is VALID [2022-04-28 08:53:04,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {112636#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {112636#true} is VALID [2022-04-28 08:53:04,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {112636#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,505 INFO L290 TraceCheckUtils]: 49: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,505 INFO L290 TraceCheckUtils]: 50: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {112641#(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; {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,507 INFO L290 TraceCheckUtils]: 54: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,507 INFO L290 TraceCheckUtils]: 55: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,507 INFO L290 TraceCheckUtils]: 56: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,510 INFO L290 TraceCheckUtils]: 58: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,511 INFO L290 TraceCheckUtils]: 59: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,512 INFO L290 TraceCheckUtils]: 62: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,512 INFO L290 TraceCheckUtils]: 63: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,514 INFO L290 TraceCheckUtils]: 65: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,515 INFO L290 TraceCheckUtils]: 66: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,515 INFO L290 TraceCheckUtils]: 67: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,515 INFO L290 TraceCheckUtils]: 68: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,516 INFO L290 TraceCheckUtils]: 69: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,516 INFO L290 TraceCheckUtils]: 70: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,516 INFO L290 TraceCheckUtils]: 71: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,517 INFO L290 TraceCheckUtils]: 73: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,517 INFO L290 TraceCheckUtils]: 74: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,518 INFO L290 TraceCheckUtils]: 75: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,518 INFO L290 TraceCheckUtils]: 76: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,518 INFO L290 TraceCheckUtils]: 77: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,519 INFO L290 TraceCheckUtils]: 78: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,519 INFO L290 TraceCheckUtils]: 79: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,519 INFO L290 TraceCheckUtils]: 80: Hoare triple {112641#(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); {112641#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-28 08:53:04,520 INFO L290 TraceCheckUtils]: 81: Hoare triple {112641#(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); {112642#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-28 08:53:04,520 INFO L290 TraceCheckUtils]: 82: Hoare triple {112642#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {112637#false} is VALID [2022-04-28 08:53:04,520 INFO L290 TraceCheckUtils]: 83: Hoare triple {112637#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {112637#false} is VALID [2022-04-28 08:53:04,520 INFO L290 TraceCheckUtils]: 84: Hoare triple {112637#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); {112637#false} is VALID [2022-04-28 08:53:04,520 INFO L290 TraceCheckUtils]: 85: Hoare triple {112637#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 86: Hoare triple {112637#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 87: Hoare triple {112637#false} ~skip~0 := 0; {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 88: Hoare triple {112637#false} assume !false; {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 89: Hoare triple {112637#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 90: Hoare triple {112637#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 91: Hoare triple {112637#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 92: Hoare triple {112637#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 93: Hoare triple {112637#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 94: Hoare triple {112637#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,521 INFO L290 TraceCheckUtils]: 95: Hoare triple {112637#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,522 INFO L290 TraceCheckUtils]: 96: Hoare triple {112637#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,522 INFO L290 TraceCheckUtils]: 97: Hoare triple {112637#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,522 INFO L290 TraceCheckUtils]: 98: Hoare triple {112637#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 99: Hoare triple {112637#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {112637#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 101: Hoare triple {112637#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 102: Hoare triple {112637#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 103: Hoare triple {112637#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {112637#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 105: Hoare triple {112637#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 106: Hoare triple {112637#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 107: Hoare triple {112637#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 108: Hoare triple {112637#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 109: Hoare triple {112637#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 110: Hoare triple {112637#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 111: Hoare triple {112637#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 112: Hoare triple {112637#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,523 INFO L290 TraceCheckUtils]: 113: Hoare triple {112637#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 114: Hoare triple {112637#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 115: Hoare triple {112637#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 116: Hoare triple {112637#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 117: Hoare triple {112637#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 118: Hoare triple {112637#false} assume 8640 == #t~mem75;havoc #t~mem75; {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 119: Hoare triple {112637#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 120: Hoare triple {112637#false} assume !(4 == ~blastFlag~0); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 121: Hoare triple {112637#false} assume !(7 == ~blastFlag~0); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 122: Hoare triple {112637#false} assume !(10 == ~blastFlag~0); {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 123: Hoare triple {112637#false} assume 13 == ~blastFlag~0; {112637#false} is VALID [2022-04-28 08:53:04,524 INFO L290 TraceCheckUtils]: 124: Hoare triple {112637#false} assume !false; {112637#false} is VALID [2022-04-28 08:53:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:53:04,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:53:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475558225] [2022-04-28 08:53:04,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475558225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:04,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:04,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:04,525 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:53:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [142039967] [2022-04-28 08:53:04,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [142039967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:04,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:04,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965474368] [2022-04-28 08:53:04,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:53:04,528 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 125 [2022-04-28 08:53:04,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:53:04,528 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-28 08:53:04,604 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-28 08:53:04,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:53:04,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:04,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:53:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:53:04,608 INFO L87 Difference]: Start difference. First operand 1024 states and 1599 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-28 08:53:06,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:53:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:11,808 INFO L93 Difference]: Finished difference Result 2221 states and 3437 transitions. [2022-04-28 08:53:11,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:53:11,808 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 125 [2022-04-28 08:53:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:53:11,808 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-28 08:53:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:53:11,810 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-28 08:53:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2022-04-28 08:53:11,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 595 transitions. [2022-04-28 08:53:12,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:12,242 INFO L225 Difference]: With dead ends: 2221 [2022-04-28 08:53:12,242 INFO L226 Difference]: Without dead ends: 1223 [2022-04-28 08:53:12,243 INFO L412 NwaCegarLoop]: 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-28 08:53:12,243 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 115 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:53:12,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 418 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 483 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 08:53:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2022-04-28 08:53:12,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1024. [2022-04-28 08:53:12,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:53:12,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1223 states. Second operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:12,307 INFO L74 IsIncluded]: Start isIncluded. First operand 1223 states. Second operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:12,308 INFO L87 Difference]: Start difference. First operand 1223 states. Second operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:12,343 INFO L93 Difference]: Finished difference Result 1223 states and 1864 transitions. [2022-04-28 08:53:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1864 transitions. [2022-04-28 08:53:12,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:12,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:12,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1223 states. [2022-04-28 08:53:12,345 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1223 states. [2022-04-28 08:53:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:12,381 INFO L93 Difference]: Finished difference Result 1223 states and 1864 transitions. [2022-04-28 08:53:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1864 transitions. [2022-04-28 08:53:12,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:12,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:12,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:53:12,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:53:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5593719332679097) internal successors, (1589), 1019 states have internal predecessors, (1589), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1593 transitions. [2022-04-28 08:53:12,420 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1593 transitions. Word has length 125 [2022-04-28 08:53:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:53:12,420 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1593 transitions. [2022-04-28 08:53:12,420 INFO L496 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-28 08:53:12,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1593 transitions. [2022-04-28 08:53:16,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1593 edges. 1592 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1593 transitions. [2022-04-28 08:53:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 08:53:16,435 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:53:16,435 INFO L195 NwaCegarLoop]: 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] [2022-04-28 08:53:16,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 08:53:16,435 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:53:16,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:53:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1505319124, now seen corresponding path program 1 times [2022-04-28 08:53:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:16,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1297388522] [2022-04-28 08:53:16,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:53:16,492 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:53:16,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:53:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1505319124, now seen corresponding path program 2 times [2022-04-28 08:53:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:53:16,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213148166] [2022-04-28 08:53:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:53:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:53:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:53:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:16,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {121591#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {121584#true} is VALID [2022-04-28 08:53:16,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {121584#true} assume true; {121584#true} is VALID [2022-04-28 08:53:16,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121584#true} {121584#true} #708#return; {121584#true} is VALID [2022-04-28 08:53:16,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {121584#true} call ULTIMATE.init(); {121591#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:53:16,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {121591#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {121584#true} is VALID [2022-04-28 08:53:16,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {121584#true} assume true; {121584#true} is VALID [2022-04-28 08:53:16,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121584#true} {121584#true} #708#return; {121584#true} is VALID [2022-04-28 08:53:16,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {121584#true} call #t~ret161 := main(); {121584#true} is VALID [2022-04-28 08:53:16,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {121584#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; {121584#true} is VALID [2022-04-28 08:53:16,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {121584#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L272 TraceCheckUtils]: 7: Hoare triple {121584#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {121584#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); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {121584#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; {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {121584#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; {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {121584#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {121584#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {121584#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {121584#true} assume !false; {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {121584#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); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {121584#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {121584#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {121584#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {121584#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {121584#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {121584#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 22: Hoare triple {121584#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {121584#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {121584#true} assume 8464 == #t~mem55;havoc #t~mem55; {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {121584#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; {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {121584#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {121584#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); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {121584#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); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {121584#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {121584#true} ~skip~0 := 0; {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {121584#true} assume !false; {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {121584#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); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {121584#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,709 INFO L290 TraceCheckUtils]: 34: Hoare triple {121584#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {121584#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {121584#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 37: Hoare triple {121584#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {121584#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {121584#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {121584#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 41: Hoare triple {121584#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 42: Hoare triple {121584#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 43: Hoare triple {121584#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {121584#true} assume 8496 == #t~mem58;havoc #t~mem58; {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {121584#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 46: Hoare triple {121584#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {121584#true} is VALID [2022-04-28 08:53:16,710 INFO L290 TraceCheckUtils]: 47: Hoare triple {121584#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {121584#true} is VALID [2022-04-28 08:53:16,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {121584#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {121589#(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; {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,714 INFO L290 TraceCheckUtils]: 55: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,715 INFO L290 TraceCheckUtils]: 57: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {121589#(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); {121589#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {121589#(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); {121590#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 61: Hoare triple {121590#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {121585#false} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 62: Hoare triple {121585#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; {121585#false} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 63: Hoare triple {121585#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); {121585#false} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 64: Hoare triple {121585#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {121585#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121585#false} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {121585#false} ~skip~0 := 0; {121585#false} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 67: Hoare triple {121585#false} assume !false; {121585#false} is VALID [2022-04-28 08:53:16,716 INFO L290 TraceCheckUtils]: 68: Hoare triple {121585#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 69: Hoare triple {121585#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 70: Hoare triple {121585#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 71: Hoare triple {121585#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 72: Hoare triple {121585#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 73: Hoare triple {121585#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 74: Hoare triple {121585#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 75: Hoare triple {121585#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 76: Hoare triple {121585#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 77: Hoare triple {121585#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 78: Hoare triple {121585#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 79: Hoare triple {121585#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 80: Hoare triple {121585#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 81: Hoare triple {121585#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {121585#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,717 INFO L290 TraceCheckUtils]: 83: Hoare triple {121585#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 84: Hoare triple {121585#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 85: Hoare triple {121585#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 86: Hoare triple {121585#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 87: Hoare triple {121585#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 88: Hoare triple {121585#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 89: Hoare triple {121585#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 90: Hoare triple {121585#false} assume 8448 == #t~mem68;havoc #t~mem68; {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 91: Hoare triple {121585#false} assume !(~num1~0 > 0); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 92: Hoare triple {121585#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; {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 93: Hoare triple {121585#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 94: Hoare triple {121585#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 95: Hoare triple {121585#false} ~skip~0 := 0; {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 96: Hoare triple {121585#false} assume !false; {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 97: Hoare triple {121585#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,718 INFO L290 TraceCheckUtils]: 98: Hoare triple {121585#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 99: Hoare triple {121585#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 100: Hoare triple {121585#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 101: Hoare triple {121585#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 102: Hoare triple {121585#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 103: Hoare triple {121585#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 104: Hoare triple {121585#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 105: Hoare triple {121585#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 106: Hoare triple {121585#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 107: Hoare triple {121585#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 108: Hoare triple {121585#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 109: Hoare triple {121585#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 110: Hoare triple {121585#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 111: Hoare triple {121585#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 112: Hoare triple {121585#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,719 INFO L290 TraceCheckUtils]: 113: Hoare triple {121585#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 114: Hoare triple {121585#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 115: Hoare triple {121585#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 116: Hoare triple {121585#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 117: Hoare triple {121585#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 118: Hoare triple {121585#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 119: Hoare triple {121585#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 120: Hoare triple {121585#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 121: Hoare triple {121585#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 122: Hoare triple {121585#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 123: Hoare triple {121585#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 124: Hoare triple {121585#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 125: Hoare triple {121585#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 126: Hoare triple {121585#false} assume 8640 == #t~mem75;havoc #t~mem75; {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 127: Hoare triple {121585#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {121585#false} is VALID [2022-04-28 08:53:16,720 INFO L290 TraceCheckUtils]: 128: Hoare triple {121585#false} assume !(4 == ~blastFlag~0); {121585#false} is VALID [2022-04-28 08:53:16,721 INFO L290 TraceCheckUtils]: 129: Hoare triple {121585#false} assume !(7 == ~blastFlag~0); {121585#false} is VALID [2022-04-28 08:53:16,721 INFO L290 TraceCheckUtils]: 130: Hoare triple {121585#false} assume !(10 == ~blastFlag~0); {121585#false} is VALID [2022-04-28 08:53:16,721 INFO L290 TraceCheckUtils]: 131: Hoare triple {121585#false} assume 13 == ~blastFlag~0; {121585#false} is VALID [2022-04-28 08:53:16,721 INFO L290 TraceCheckUtils]: 132: Hoare triple {121585#false} assume !false; {121585#false} is VALID [2022-04-28 08:53:16,721 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-28 08:53:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:53:16,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213148166] [2022-04-28 08:53:16,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213148166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:16,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:16,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:16,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:53:16,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1297388522] [2022-04-28 08:53:16,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1297388522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:16,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:16,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:16,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899178309] [2022-04-28 08:53:16,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:53:16,722 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-28 08:53:16,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:53:16,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:16,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:16,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:53:16,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:16,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:53:16,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:53:16,788 INFO L87 Difference]: Start difference. First operand 1024 states and 1593 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:18,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:53:23,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:23,975 INFO L93 Difference]: Finished difference Result 2219 states and 3423 transitions. [2022-04-28 08:53:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:53:23,976 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-28 08:53:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:53:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:23,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 08:53:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2022-04-28 08:53:23,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 594 transitions. [2022-04-28 08:53:24,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 594 edges. 594 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:24,435 INFO L225 Difference]: With dead ends: 2219 [2022-04-28 08:53:24,435 INFO L226 Difference]: Without dead ends: 1221 [2022-04-28 08:53:24,436 INFO L412 NwaCegarLoop]: 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-28 08:53:24,437 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:53:24,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 388 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 468 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 08:53:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2022-04-28 08:53:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1024. [2022-04-28 08:53:24,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:53:24,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1221 states. Second operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:24,518 INFO L74 IsIncluded]: Start isIncluded. First operand 1221 states. Second operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:24,519 INFO L87 Difference]: Start difference. First operand 1221 states. Second operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:24,554 INFO L93 Difference]: Finished difference Result 1221 states and 1846 transitions. [2022-04-28 08:53:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1846 transitions. [2022-04-28 08:53:24,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:24,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:24,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1221 states. [2022-04-28 08:53:24,556 INFO L87 Difference]: Start difference. First operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1221 states. [2022-04-28 08:53:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:24,591 INFO L93 Difference]: Finished difference Result 1221 states and 1846 transitions. [2022-04-28 08:53:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1846 transitions. [2022-04-28 08:53:24,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:24,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:24,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:53:24,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:53:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1019 states have (on average 1.5436702649656526) internal successors, (1573), 1019 states have internal predecessors, (1573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1577 transitions. [2022-04-28 08:53:24,630 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1577 transitions. Word has length 133 [2022-04-28 08:53:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:53:24,630 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1577 transitions. [2022-04-28 08:53:24,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:24,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1024 states and 1577 transitions. [2022-04-28 08:53:28,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1577 edges. 1576 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1577 transitions. [2022-04-28 08:53:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 08:53:28,648 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:53:28,648 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:53:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 08:53:28,648 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:53:28,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:53:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1537626722, now seen corresponding path program 1 times [2022-04-28 08:53:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:28,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857763173] [2022-04-28 08:53:28,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:53:28,717 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:53:28,717 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:53:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1537626722, now seen corresponding path program 2 times [2022-04-28 08:53:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:53:28,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115761242] [2022-04-28 08:53:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:53:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:53:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:53:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:28,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {130531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {130524#true} is VALID [2022-04-28 08:53:28,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {130524#true} assume true; {130524#true} is VALID [2022-04-28 08:53:28,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {130524#true} {130524#true} #708#return; {130524#true} is VALID [2022-04-28 08:53:28,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {130524#true} call ULTIMATE.init(); {130531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {130531#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {130524#true} assume true; {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {130524#true} {130524#true} #708#return; {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {130524#true} call #t~ret161 := main(); {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {130524#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; {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {130524#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L272 TraceCheckUtils]: 7: Hoare triple {130524#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {130524#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); {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {130524#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; {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {130524#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; {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {130524#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {130524#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {130524#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {130524#true} is VALID [2022-04-28 08:53:28,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {130524#true} assume !false; {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {130524#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); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {130524#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {130524#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {130524#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {130524#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {130524#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {130524#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {130524#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {130524#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {130524#true} assume 8464 == #t~mem55;havoc #t~mem55; {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {130524#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; {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {130524#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {130524#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); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {130524#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); {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {130524#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130524#true} is VALID [2022-04-28 08:53:28,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {130524#true} ~skip~0 := 0; {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {130524#true} assume !false; {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {130524#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); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {130524#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {130524#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {130524#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {130524#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {130524#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {130524#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {130524#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {130524#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {130524#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {130524#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {130524#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {130524#true} assume 8496 == #t~mem58;havoc #t~mem58; {130524#true} is VALID [2022-04-28 08:53:28,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {130524#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {130524#true} is VALID [2022-04-28 08:53:28,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {130524#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {130524#true} is VALID [2022-04-28 08:53:28,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {130524#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {130524#true} is VALID [2022-04-28 08:53:28,911 INFO L290 TraceCheckUtils]: 48: Hoare triple {130524#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,912 INFO L290 TraceCheckUtils]: 49: Hoare triple {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,912 INFO L290 TraceCheckUtils]: 50: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {130529#(= 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; {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,913 INFO L290 TraceCheckUtils]: 52: Hoare triple {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,913 INFO L290 TraceCheckUtils]: 53: Hoare triple {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,914 INFO L290 TraceCheckUtils]: 54: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,914 INFO L290 TraceCheckUtils]: 55: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,914 INFO L290 TraceCheckUtils]: 56: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,915 INFO L290 TraceCheckUtils]: 57: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,915 INFO L290 TraceCheckUtils]: 58: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,916 INFO L290 TraceCheckUtils]: 59: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,916 INFO L290 TraceCheckUtils]: 60: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,916 INFO L290 TraceCheckUtils]: 61: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,917 INFO L290 TraceCheckUtils]: 62: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,917 INFO L290 TraceCheckUtils]: 63: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,917 INFO L290 TraceCheckUtils]: 64: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,918 INFO L290 TraceCheckUtils]: 65: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,920 INFO L290 TraceCheckUtils]: 71: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,920 INFO L290 TraceCheckUtils]: 72: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,920 INFO L290 TraceCheckUtils]: 73: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,921 INFO L290 TraceCheckUtils]: 74: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,921 INFO L290 TraceCheckUtils]: 75: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,921 INFO L290 TraceCheckUtils]: 76: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,922 INFO L290 TraceCheckUtils]: 77: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,922 INFO L290 TraceCheckUtils]: 78: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,922 INFO L290 TraceCheckUtils]: 79: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,923 INFO L290 TraceCheckUtils]: 80: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,924 INFO L290 TraceCheckUtils]: 83: Hoare triple {130529#(= 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); {130529#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:53:28,924 INFO L290 TraceCheckUtils]: 84: Hoare triple {130529#(= 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); {130530#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-28 08:53:28,924 INFO L290 TraceCheckUtils]: 85: Hoare triple {130530#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 86: Hoare triple {130525#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 87: Hoare triple {130525#false} assume 8672 == #t~mem79;havoc #t~mem79; {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {130525#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 89: Hoare triple {130525#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {130525#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); {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 91: Hoare triple {130525#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; {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 92: Hoare triple {130525#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 93: Hoare triple {130525#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 94: Hoare triple {130525#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 95: Hoare triple {130525#false} ~skip~0 := 0; {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 96: Hoare triple {130525#false} assume !false; {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 97: Hoare triple {130525#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 98: Hoare triple {130525#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,925 INFO L290 TraceCheckUtils]: 99: Hoare triple {130525#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 100: Hoare triple {130525#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 101: Hoare triple {130525#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 102: Hoare triple {130525#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 103: Hoare triple {130525#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 104: Hoare triple {130525#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 105: Hoare triple {130525#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 106: Hoare triple {130525#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 107: Hoare triple {130525#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 108: Hoare triple {130525#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 109: Hoare triple {130525#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 110: Hoare triple {130525#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 111: Hoare triple {130525#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 112: Hoare triple {130525#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 113: Hoare triple {130525#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 114: Hoare triple {130525#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,926 INFO L290 TraceCheckUtils]: 115: Hoare triple {130525#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 116: Hoare triple {130525#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 117: Hoare triple {130525#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 118: Hoare triple {130525#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 119: Hoare triple {130525#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 120: Hoare triple {130525#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 121: Hoare triple {130525#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 122: Hoare triple {130525#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 123: Hoare triple {130525#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 124: Hoare triple {130525#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 125: Hoare triple {130525#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 126: Hoare triple {130525#false} assume 8640 == #t~mem75;havoc #t~mem75; {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 127: Hoare triple {130525#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 128: Hoare triple {130525#false} assume !(4 == ~blastFlag~0); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 129: Hoare triple {130525#false} assume !(7 == ~blastFlag~0); {130525#false} is VALID [2022-04-28 08:53:28,927 INFO L290 TraceCheckUtils]: 130: Hoare triple {130525#false} assume !(10 == ~blastFlag~0); {130525#false} is VALID [2022-04-28 08:53:28,928 INFO L290 TraceCheckUtils]: 131: Hoare triple {130525#false} assume 13 == ~blastFlag~0; {130525#false} is VALID [2022-04-28 08:53:28,928 INFO L290 TraceCheckUtils]: 132: Hoare triple {130525#false} assume !false; {130525#false} is VALID [2022-04-28 08:53:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 08:53:28,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:53:28,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115761242] [2022-04-28 08:53:28,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115761242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:28,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:28,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:28,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:53:28,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857763173] [2022-04-28 08:53:28,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857763173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:28,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:28,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:28,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419974216] [2022-04-28 08:53:28,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:53:28,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 08:53:28,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:53:28,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:29,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:29,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:53:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:53:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:53:29,011 INFO L87 Difference]: Start difference. First operand 1024 states and 1577 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:35,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:53:38,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:53:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:44,883 INFO L93 Difference]: Finished difference Result 2240 states and 3442 transitions. [2022-04-28 08:53:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:53:44,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 08:53:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:53:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-28 08:53:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-04-28 08:53:44,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 536 transitions. [2022-04-28 08:53:45,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 536 edges. 536 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:45,293 INFO L225 Difference]: With dead ends: 2240 [2022-04-28 08:53:45,293 INFO L226 Difference]: Without dead ends: 1242 [2022-04-28 08:53:45,294 INFO L412 NwaCegarLoop]: 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-28 08:53:45,294 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 53 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:53:45,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 649 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 572 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 08:53:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-04-28 08:53:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1153. [2022-04-28 08:53:45,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:53:45,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1242 states. Second operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:45,393 INFO L74 IsIncluded]: Start isIncluded. First operand 1242 states. Second operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:45,393 INFO L87 Difference]: Start difference. First operand 1242 states. Second operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:45,430 INFO L93 Difference]: Finished difference Result 1242 states and 1893 transitions. [2022-04-28 08:53:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1893 transitions. [2022-04-28 08:53:45,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:45,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:45,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1242 states. [2022-04-28 08:53:45,432 INFO L87 Difference]: Start difference. First operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1242 states. [2022-04-28 08:53:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:53:45,468 INFO L93 Difference]: Finished difference Result 1242 states and 1893 transitions. [2022-04-28 08:53:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1893 transitions. [2022-04-28 08:53:45,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:53:45,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:53:45,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:53:45,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:53:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1148 states have (on average 1.5426829268292683) internal successors, (1771), 1148 states have internal predecessors, (1771), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1775 transitions. [2022-04-28 08:53:45,516 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1775 transitions. Word has length 133 [2022-04-28 08:53:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:53:45,516 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 1775 transitions. [2022-04-28 08:53:45,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:45,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1153 states and 1775 transitions. [2022-04-28 08:53:49,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1775 edges. 1774 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1775 transitions. [2022-04-28 08:53:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-28 08:53:49,709 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:53:49,709 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:53:49,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 08:53:49,709 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:53:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:53:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash -880857756, now seen corresponding path program 1 times [2022-04-28 08:53:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:49,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696346291] [2022-04-28 08:53:49,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:53:49,809 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:53:49,809 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:53:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -880857756, now seen corresponding path program 2 times [2022-04-28 08:53:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:53:49,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152481691] [2022-04-28 08:53:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:53:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:53:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:53:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:53:50,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {139813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {139806#true} is VALID [2022-04-28 08:53:50,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {139806#true} assume true; {139806#true} is VALID [2022-04-28 08:53:50,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139806#true} {139806#true} #708#return; {139806#true} is VALID [2022-04-28 08:53:50,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {139806#true} call ULTIMATE.init(); {139813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:53:50,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {139813#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {139806#true} is VALID [2022-04-28 08:53:50,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {139806#true} assume true; {139806#true} is VALID [2022-04-28 08:53:50,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139806#true} {139806#true} #708#return; {139806#true} is VALID [2022-04-28 08:53:50,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {139806#true} call #t~ret161 := main(); {139806#true} is VALID [2022-04-28 08:53:50,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {139806#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; {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {139806#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L272 TraceCheckUtils]: 7: Hoare triple {139806#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {139806#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); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {139806#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; {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {139806#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; {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {139806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {139806#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {139806#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {139806#true} assume !false; {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {139806#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); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {139806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {139806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {139806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {139806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {139806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {139806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {139806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {139806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {139806#true} assume 8464 == #t~mem55;havoc #t~mem55; {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {139806#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; {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {139806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {139806#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); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {139806#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); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {139806#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {139806#true} ~skip~0 := 0; {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {139806#true} assume !false; {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {139806#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); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {139806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {139806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {139806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 36: Hoare triple {139806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 37: Hoare triple {139806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 38: Hoare triple {139806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {139806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {139806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {139806#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {139806#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {139806#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {139806#true} assume 8496 == #t~mem58;havoc #t~mem58; {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {139806#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 46: Hoare triple {139806#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {139806#true} is VALID [2022-04-28 08:53:50,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {139806#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {139806#true} is VALID [2022-04-28 08:53:50,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {139806#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {139811#(= (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; {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {139811#(= (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); {139811#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:53:50,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {139811#(= (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); {139812#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-28 08:53:50,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {139812#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {139807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {139807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,097 INFO L290 TraceCheckUtils]: 71: Hoare triple {139807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,097 INFO L290 TraceCheckUtils]: 72: Hoare triple {139807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 73: Hoare triple {139807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 74: Hoare triple {139807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {139807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {139807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {139807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 78: Hoare triple {139807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 79: Hoare triple {139807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 80: Hoare triple {139807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {139807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {139807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 83: Hoare triple {139807#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 84: Hoare triple {139807#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 85: Hoare triple {139807#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 86: Hoare triple {139807#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,098 INFO L290 TraceCheckUtils]: 87: Hoare triple {139807#false} assume 8672 == #t~mem79;havoc #t~mem79; {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 88: Hoare triple {139807#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 89: Hoare triple {139807#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 90: Hoare triple {139807#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); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 91: Hoare triple {139807#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; {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 92: Hoare triple {139807#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 93: Hoare triple {139807#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 94: Hoare triple {139807#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 95: Hoare triple {139807#false} ~skip~0 := 0; {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 96: Hoare triple {139807#false} assume !false; {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 97: Hoare triple {139807#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 98: Hoare triple {139807#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 99: Hoare triple {139807#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 100: Hoare triple {139807#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 101: Hoare triple {139807#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,099 INFO L290 TraceCheckUtils]: 102: Hoare triple {139807#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,100 INFO L290 TraceCheckUtils]: 103: Hoare triple {139807#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {139807#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,100 INFO L290 TraceCheckUtils]: 105: Hoare triple {139807#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,100 INFO L290 TraceCheckUtils]: 106: Hoare triple {139807#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,100 INFO L290 TraceCheckUtils]: 107: Hoare triple {139807#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,100 INFO L290 TraceCheckUtils]: 108: Hoare triple {139807#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 109: Hoare triple {139807#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 110: Hoare triple {139807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 111: Hoare triple {139807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 112: Hoare triple {139807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 113: Hoare triple {139807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 114: Hoare triple {139807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 115: Hoare triple {139807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 116: Hoare triple {139807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,115 INFO L290 TraceCheckUtils]: 117: Hoare triple {139807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 118: Hoare triple {139807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 119: Hoare triple {139807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 120: Hoare triple {139807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 121: Hoare triple {139807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 122: Hoare triple {139807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 123: Hoare triple {139807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 124: Hoare triple {139807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 125: Hoare triple {139807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 126: Hoare triple {139807#false} assume 8640 == #t~mem75;havoc #t~mem75; {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 127: Hoare triple {139807#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 128: Hoare triple {139807#false} assume !(4 == ~blastFlag~0); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 129: Hoare triple {139807#false} assume !(7 == ~blastFlag~0); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 130: Hoare triple {139807#false} assume !(10 == ~blastFlag~0); {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 131: Hoare triple {139807#false} assume 13 == ~blastFlag~0; {139807#false} is VALID [2022-04-28 08:53:50,116 INFO L290 TraceCheckUtils]: 132: Hoare triple {139807#false} assume !false; {139807#false} is VALID [2022-04-28 08:53:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-28 08:53:50,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:53:50,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152481691] [2022-04-28 08:53:50,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152481691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:50,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:50,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:50,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:53:50,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696346291] [2022-04-28 08:53:50,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696346291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:53:50,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:53:50,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:53:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904746359] [2022-04-28 08:53:50,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:53:50,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 08:53:50,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:53:50,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:50,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:53:50,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:53:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:53:50,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:53:50,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:53:50,191 INFO L87 Difference]: Start difference. First operand 1153 states and 1775 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:53:55,476 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:53:57,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:54:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:02,347 INFO L93 Difference]: Finished difference Result 2384 states and 3667 transitions. [2022-04-28 08:54:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:54:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 133 [2022-04-28 08:54:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:54:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:54:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-28 08:54:02,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-28 08:54:02,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 480 edges. 480 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:54:02,741 INFO L225 Difference]: With dead ends: 2384 [2022-04-28 08:54:02,741 INFO L226 Difference]: Without dead ends: 1257 [2022-04-28 08:54:02,742 INFO L412 NwaCegarLoop]: 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-28 08:54:02,742 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 26 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:54:02,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 609 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 437 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 08:54:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-04-28 08:54:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1225. [2022-04-28 08:54:02,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:54:02,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1257 states. Second operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:02,825 INFO L74 IsIncluded]: Start isIncluded. First operand 1257 states. Second operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:02,826 INFO L87 Difference]: Start difference. First operand 1257 states. Second operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:02,862 INFO L93 Difference]: Finished difference Result 1257 states and 1920 transitions. [2022-04-28 08:54:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1920 transitions. [2022-04-28 08:54:02,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:54:02,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:54:02,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1257 states. [2022-04-28 08:54:02,865 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1257 states. [2022-04-28 08:54:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:02,902 INFO L93 Difference]: Finished difference Result 1257 states and 1920 transitions. [2022-04-28 08:54:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1920 transitions. [2022-04-28 08:54:02,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:54:02,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:54:02,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:54:02,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:54:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5377049180327869) internal successors, (1876), 1220 states have internal predecessors, (1876), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1880 transitions. [2022-04-28 08:54:02,957 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1880 transitions. Word has length 133 [2022-04-28 08:54:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:54:02,957 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1880 transitions. [2022-04-28 08:54:02,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:02,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1880 transitions. [2022-04-28 08:54:07,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1880 edges. 1879 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:54:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1880 transitions. [2022-04-28 08:54:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-28 08:54:07,356 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:54:07,356 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:54:07,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 08:54:07,357 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:54:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:54:07,357 INFO L85 PathProgramCache]: Analyzing trace with hash 403795998, now seen corresponding path program 1 times [2022-04-28 08:54:07,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:54:07,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502973276] [2022-04-28 08:54:07,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:54:07,432 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:54:07,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:54:07,432 INFO L85 PathProgramCache]: Analyzing trace with hash 403795998, now seen corresponding path program 2 times [2022-04-28 08:54:07,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:54:07,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356584065] [2022-04-28 08:54:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:54:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:54:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:54:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:54:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:54:07,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {149557#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {149550#true} is VALID [2022-04-28 08:54:07,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {149550#true} assume true; {149550#true} is VALID [2022-04-28 08:54:07,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {149550#true} {149550#true} #708#return; {149550#true} is VALID [2022-04-28 08:54:07,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {149550#true} call ULTIMATE.init(); {149557#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:54:07,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {149557#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {149550#true} is VALID [2022-04-28 08:54:07,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {149550#true} assume true; {149550#true} is VALID [2022-04-28 08:54:07,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {149550#true} {149550#true} #708#return; {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {149550#true} call #t~ret161 := main(); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {149550#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; {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {149550#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L272 TraceCheckUtils]: 7: Hoare triple {149550#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {149550#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); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {149550#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; {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {149550#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; {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {149550#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {149550#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {149550#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {149550#true} assume !false; {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {149550#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); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {149550#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {149550#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {149550#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {149550#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {149550#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {149550#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {149550#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {149550#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {149550#true} assume 8464 == #t~mem55;havoc #t~mem55; {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {149550#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; {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {149550#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {149550#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); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {149550#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); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {149550#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {149550#true} ~skip~0 := 0; {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {149550#true} assume !false; {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {149550#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); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {149550#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {149550#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {149550#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {149550#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {149550#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {149550#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {149550#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {149550#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {149550#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {149550#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {149550#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {149550#true} assume 8496 == #t~mem58;havoc #t~mem58; {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {149550#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {149550#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {149550#true} is VALID [2022-04-28 08:54:07,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {149550#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {149550#true} is VALID [2022-04-28 08:54:07,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {149550#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,638 INFO L290 TraceCheckUtils]: 51: Hoare triple {149555#(= 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; {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,639 INFO L290 TraceCheckUtils]: 55: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,639 INFO L290 TraceCheckUtils]: 56: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,640 INFO L290 TraceCheckUtils]: 57: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,640 INFO L290 TraceCheckUtils]: 58: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,640 INFO L290 TraceCheckUtils]: 59: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,641 INFO L290 TraceCheckUtils]: 60: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,641 INFO L290 TraceCheckUtils]: 61: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,641 INFO L290 TraceCheckUtils]: 62: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,642 INFO L290 TraceCheckUtils]: 63: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,642 INFO L290 TraceCheckUtils]: 64: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,642 INFO L290 TraceCheckUtils]: 65: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,643 INFO L290 TraceCheckUtils]: 66: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,644 INFO L290 TraceCheckUtils]: 69: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,644 INFO L290 TraceCheckUtils]: 70: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,644 INFO L290 TraceCheckUtils]: 71: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {149555#(= 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); {149555#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:07,645 INFO L290 TraceCheckUtils]: 73: Hoare triple {149555#(= 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); {149556#(= |ssl3_accept_#t~mem66| 8656)} is VALID [2022-04-28 08:54:07,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {149556#(= |ssl3_accept_#t~mem66| 8656)} assume 8560 == #t~mem66;havoc #t~mem66; {149551#false} is VALID [2022-04-28 08:54:07,645 INFO L290 TraceCheckUtils]: 75: Hoare triple {149551#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {149551#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); {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 77: Hoare triple {149551#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 78: Hoare triple {149551#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 79: Hoare triple {149551#false} ~skip~0 := 0; {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 80: Hoare triple {149551#false} assume !false; {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 81: Hoare triple {149551#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 82: Hoare triple {149551#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 83: Hoare triple {149551#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 84: Hoare triple {149551#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,646 INFO L290 TraceCheckUtils]: 85: Hoare triple {149551#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 86: Hoare triple {149551#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 87: Hoare triple {149551#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 88: Hoare triple {149551#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 89: Hoare triple {149551#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 90: Hoare triple {149551#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 91: Hoare triple {149551#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 92: Hoare triple {149551#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 93: Hoare triple {149551#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 94: Hoare triple {149551#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 95: Hoare triple {149551#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 96: Hoare triple {149551#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 97: Hoare triple {149551#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 98: Hoare triple {149551#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 99: Hoare triple {149551#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,647 INFO L290 TraceCheckUtils]: 100: Hoare triple {149551#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 101: Hoare triple {149551#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 102: Hoare triple {149551#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 103: Hoare triple {149551#false} assume 8448 == #t~mem68;havoc #t~mem68; {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 104: Hoare triple {149551#false} assume !(~num1~0 > 0); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 105: Hoare triple {149551#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; {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 106: Hoare triple {149551#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 107: Hoare triple {149551#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 108: Hoare triple {149551#false} ~skip~0 := 0; {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 109: Hoare triple {149551#false} assume !false; {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 110: Hoare triple {149551#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 111: Hoare triple {149551#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 112: Hoare triple {149551#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 113: Hoare triple {149551#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 114: Hoare triple {149551#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,648 INFO L290 TraceCheckUtils]: 115: Hoare triple {149551#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 116: Hoare triple {149551#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 117: Hoare triple {149551#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 118: Hoare triple {149551#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 119: Hoare triple {149551#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 120: Hoare triple {149551#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 121: Hoare triple {149551#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 122: Hoare triple {149551#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 123: Hoare triple {149551#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 124: Hoare triple {149551#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 125: Hoare triple {149551#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 126: Hoare triple {149551#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 127: Hoare triple {149551#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 128: Hoare triple {149551#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 129: Hoare triple {149551#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 130: Hoare triple {149551#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,649 INFO L290 TraceCheckUtils]: 131: Hoare triple {149551#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 132: Hoare triple {149551#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 133: Hoare triple {149551#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 134: Hoare triple {149551#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 135: Hoare triple {149551#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 136: Hoare triple {149551#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 137: Hoare triple {149551#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 138: Hoare triple {149551#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 139: Hoare triple {149551#false} assume 8640 == #t~mem75;havoc #t~mem75; {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 140: Hoare triple {149551#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 141: Hoare triple {149551#false} assume !(4 == ~blastFlag~0); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 142: Hoare triple {149551#false} assume !(7 == ~blastFlag~0); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 143: Hoare triple {149551#false} assume !(10 == ~blastFlag~0); {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 144: Hoare triple {149551#false} assume 13 == ~blastFlag~0; {149551#false} is VALID [2022-04-28 08:54:07,650 INFO L290 TraceCheckUtils]: 145: Hoare triple {149551#false} assume !false; {149551#false} is VALID [2022-04-28 08:54:07,651 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-28 08:54:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:54:07,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356584065] [2022-04-28 08:54:07,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356584065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:54:07,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:54:07,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:54:07,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:54:07,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502973276] [2022-04-28 08:54:07,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502973276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:54:07,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:54:07,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:54:07,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066152216] [2022-04-28 08:54:07,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:54:07,652 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 146 [2022-04-28 08:54:07,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:54:07,652 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-28 08:54:07,725 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-28 08:54:07,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:54:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:54:07,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:54:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:54:07,725 INFO L87 Difference]: Start difference. First operand 1225 states and 1880 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-28 08:54:10,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:54:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:22,906 INFO L93 Difference]: Finished difference Result 2513 states and 3847 transitions. [2022-04-28 08:54:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:54:22,906 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 146 [2022-04-28 08:54:22,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:54:22,906 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-28 08:54:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-28 08:54:22,908 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-28 08:54:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-04-28 08:54:22,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 535 transitions. [2022-04-28 08:54:23,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:54:23,289 INFO L225 Difference]: With dead ends: 2513 [2022-04-28 08:54:23,289 INFO L226 Difference]: Without dead ends: 1314 [2022-04-28 08:54:23,290 INFO L412 NwaCegarLoop]: 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-28 08:54:23,290 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 63 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 08:54:23,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 649 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 08:54:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-04-28 08:54:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1225. [2022-04-28 08:54:23,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:54:23,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1314 states. Second operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:23,383 INFO L74 IsIncluded]: Start isIncluded. First operand 1314 states. Second operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:23,383 INFO L87 Difference]: Start difference. First operand 1314 states. Second operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:23,423 INFO L93 Difference]: Finished difference Result 1314 states and 1995 transitions. [2022-04-28 08:54:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1995 transitions. [2022-04-28 08:54:23,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:54:23,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:54:23,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1314 states. [2022-04-28 08:54:23,426 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1314 states. [2022-04-28 08:54:23,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:23,465 INFO L93 Difference]: Finished difference Result 1314 states and 1995 transitions. [2022-04-28 08:54:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1995 transitions. [2022-04-28 08:54:23,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:54:23,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:54:23,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:54:23,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:54:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5352459016393443) internal successors, (1873), 1220 states have internal predecessors, (1873), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1877 transitions. [2022-04-28 08:54:23,520 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1877 transitions. Word has length 146 [2022-04-28 08:54:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:54:23,520 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1877 transitions. [2022-04-28 08:54:23,520 INFO L496 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-28 08:54:23,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1877 transitions. [2022-04-28 08:54:27,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1877 edges. 1876 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:54:27,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1877 transitions. [2022-04-28 08:54:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 08:54:27,842 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:54:27,842 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-28 08:54:27,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 08:54:27,843 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:54:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:54:27,843 INFO L85 PathProgramCache]: Analyzing trace with hash -147368869, now seen corresponding path program 1 times [2022-04-28 08:54:27,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:54:27,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028975272] [2022-04-28 08:54:27,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:54:27,933 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:54:27,933 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:54:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash -147368869, now seen corresponding path program 2 times [2022-04-28 08:54:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:54:27,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259624759] [2022-04-28 08:54:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:54:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:54:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:54:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:54:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:54:28,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {159673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {159666#true} is VALID [2022-04-28 08:54:28,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {159666#true} assume true; {159666#true} is VALID [2022-04-28 08:54:28,241 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159666#true} {159666#true} #708#return; {159666#true} is VALID [2022-04-28 08:54:28,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {159666#true} call ULTIMATE.init(); {159673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:54:28,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {159673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {159666#true} is VALID [2022-04-28 08:54:28,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {159666#true} assume true; {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159666#true} {159666#true} #708#return; {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {159666#true} call #t~ret161 := main(); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {159666#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; {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {159666#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L272 TraceCheckUtils]: 7: Hoare triple {159666#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {159666#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); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {159666#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; {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {159666#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; {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {159666#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {159666#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {159666#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {159666#true} assume !false; {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {159666#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); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {159666#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {159666#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {159666#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {159666#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {159666#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {159666#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {159666#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {159666#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {159666#true} assume 8464 == #t~mem55;havoc #t~mem55; {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {159666#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; {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {159666#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {159666#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); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {159666#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); {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {159666#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {159666#true} ~skip~0 := 0; {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {159666#true} assume !false; {159666#true} is VALID [2022-04-28 08:54:28,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {159666#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); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {159666#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {159666#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {159666#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {159666#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {159666#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {159666#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {159666#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {159666#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {159666#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {159666#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {159666#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {159666#true} assume 8496 == #t~mem58;havoc #t~mem58; {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {159666#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {159666#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {159666#true} is VALID [2022-04-28 08:54:28,244 INFO L290 TraceCheckUtils]: 47: Hoare triple {159666#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {159666#true} is VALID [2022-04-28 08:54:28,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {159666#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,246 INFO L290 TraceCheckUtils]: 49: Hoare triple {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,246 INFO L290 TraceCheckUtils]: 50: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,247 INFO L290 TraceCheckUtils]: 51: Hoare triple {159671#(= 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; {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,248 INFO L290 TraceCheckUtils]: 54: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,248 INFO L290 TraceCheckUtils]: 55: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,249 INFO L290 TraceCheckUtils]: 57: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,249 INFO L290 TraceCheckUtils]: 58: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,249 INFO L290 TraceCheckUtils]: 59: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {159671#(= 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); {159671#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:54:28,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {159671#(= 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); {159672#(= |ssl3_accept_#t~mem54| 8656)} is VALID [2022-04-28 08:54:28,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {159672#(= |ssl3_accept_#t~mem54| 8656)} assume 8482 == #t~mem54;havoc #t~mem54; {159667#false} is VALID [2022-04-28 08:54:28,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {159667#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {159667#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {159667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 66: Hoare triple {159667#false} ~skip~0 := 0; {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 67: Hoare triple {159667#false} assume !false; {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 68: Hoare triple {159667#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 69: Hoare triple {159667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 70: Hoare triple {159667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 71: Hoare triple {159667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 72: Hoare triple {159667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 73: Hoare triple {159667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 74: Hoare triple {159667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 75: Hoare triple {159667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 76: Hoare triple {159667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 77: Hoare triple {159667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 78: Hoare triple {159667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 79: Hoare triple {159667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 80: Hoare triple {159667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,251 INFO L290 TraceCheckUtils]: 81: Hoare triple {159667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,252 INFO L290 TraceCheckUtils]: 82: Hoare triple {159667#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,252 INFO L290 TraceCheckUtils]: 83: Hoare triple {159667#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,252 INFO L290 TraceCheckUtils]: 84: Hoare triple {159667#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 85: Hoare triple {159667#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 86: Hoare triple {159667#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {159667#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 88: Hoare triple {159667#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {159667#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {159667#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 91: Hoare triple {159667#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 92: Hoare triple {159667#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 93: Hoare triple {159667#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 94: Hoare triple {159667#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,264 INFO L290 TraceCheckUtils]: 95: Hoare triple {159667#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 96: Hoare triple {159667#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 97: Hoare triple {159667#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 98: Hoare triple {159667#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 99: Hoare triple {159667#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {159667#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {159667#false} assume 8672 == #t~mem79;havoc #t~mem79; {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 102: Hoare triple {159667#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 103: Hoare triple {159667#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {159667#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); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {159667#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; {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 106: Hoare triple {159667#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 107: Hoare triple {159667#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 108: Hoare triple {159667#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 109: Hoare triple {159667#false} ~skip~0 := 0; {159667#false} is VALID [2022-04-28 08:54:28,265 INFO L290 TraceCheckUtils]: 110: Hoare triple {159667#false} assume !false; {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 111: Hoare triple {159667#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 112: Hoare triple {159667#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 113: Hoare triple {159667#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 114: Hoare triple {159667#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 115: Hoare triple {159667#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 116: Hoare triple {159667#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 117: Hoare triple {159667#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 118: Hoare triple {159667#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 119: Hoare triple {159667#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {159667#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 121: Hoare triple {159667#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 122: Hoare triple {159667#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 123: Hoare triple {159667#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 124: Hoare triple {159667#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,266 INFO L290 TraceCheckUtils]: 125: Hoare triple {159667#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 126: Hoare triple {159667#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 127: Hoare triple {159667#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 128: Hoare triple {159667#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 129: Hoare triple {159667#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 130: Hoare triple {159667#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 131: Hoare triple {159667#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 132: Hoare triple {159667#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 133: Hoare triple {159667#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 134: Hoare triple {159667#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 135: Hoare triple {159667#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 136: Hoare triple {159667#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 137: Hoare triple {159667#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 138: Hoare triple {159667#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 139: Hoare triple {159667#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {159667#false} is VALID [2022-04-28 08:54:28,267 INFO L290 TraceCheckUtils]: 140: Hoare triple {159667#false} assume 8640 == #t~mem75;havoc #t~mem75; {159667#false} is VALID [2022-04-28 08:54:28,268 INFO L290 TraceCheckUtils]: 141: Hoare triple {159667#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {159667#false} is VALID [2022-04-28 08:54:28,268 INFO L290 TraceCheckUtils]: 142: Hoare triple {159667#false} assume !(4 == ~blastFlag~0); {159667#false} is VALID [2022-04-28 08:54:28,268 INFO L290 TraceCheckUtils]: 143: Hoare triple {159667#false} assume !(7 == ~blastFlag~0); {159667#false} is VALID [2022-04-28 08:54:28,268 INFO L290 TraceCheckUtils]: 144: Hoare triple {159667#false} assume !(10 == ~blastFlag~0); {159667#false} is VALID [2022-04-28 08:54:28,268 INFO L290 TraceCheckUtils]: 145: Hoare triple {159667#false} assume 13 == ~blastFlag~0; {159667#false} is VALID [2022-04-28 08:54:28,268 INFO L290 TraceCheckUtils]: 146: Hoare triple {159667#false} assume !false; {159667#false} is VALID [2022-04-28 08:54:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 08:54:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:54:28,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259624759] [2022-04-28 08:54:28,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259624759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:54:28,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:54:28,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:54:28,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:54:28,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028975272] [2022-04-28 08:54:28,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028975272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:54:28,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:54:28,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:54:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959572518] [2022-04-28 08:54:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:54:28,269 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 147 [2022-04-28 08:54:28,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:54:28,270 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-28 08:54:28,339 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-28 08:54:28,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:54:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:54:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:54:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:54:28,339 INFO L87 Difference]: Start difference. First operand 1225 states and 1877 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-28 08:54:30,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:54:34,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:54:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:43,587 INFO L93 Difference]: Finished difference Result 2510 states and 3838 transitions. [2022-04-28 08:54:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:54:43,587 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 147 [2022-04-28 08:54:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:54:43,588 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-28 08:54:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-28 08:54:43,589 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-28 08:54:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-04-28 08:54:43,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 533 transitions. [2022-04-28 08:54:43,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 533 edges. 533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:54:43,999 INFO L225 Difference]: With dead ends: 2510 [2022-04-28 08:54:43,999 INFO L226 Difference]: Without dead ends: 1311 [2022-04-28 08:54:44,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:54:44,000 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 74 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:54:44,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 647 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 564 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2022-04-28 08:54:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2022-04-28 08:54:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1225. [2022-04-28 08:54:44,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:54:44,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1311 states. Second operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:44,100 INFO L74 IsIncluded]: Start isIncluded. First operand 1311 states. Second operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:44,101 INFO L87 Difference]: Start difference. First operand 1311 states. Second operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:44,140 INFO L93 Difference]: Finished difference Result 1311 states and 1989 transitions. [2022-04-28 08:54:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1989 transitions. [2022-04-28 08:54:44,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:54:44,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:54:44,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states 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-28 08:54:44,143 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states 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-28 08:54:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:54:44,182 INFO L93 Difference]: Finished difference Result 1311 states and 1989 transitions. [2022-04-28 08:54:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1989 transitions. [2022-04-28 08:54:44,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:54:44,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:54:44,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:54:44,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:54:44,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5327868852459017) internal successors, (1870), 1220 states have internal predecessors, (1870), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1874 transitions. [2022-04-28 08:54:44,236 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1874 transitions. Word has length 147 [2022-04-28 08:54:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:54:44,237 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1874 transitions. [2022-04-28 08:54:44,237 INFO L496 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-28 08:54:44,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1874 transitions. [2022-04-28 08:54:48,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1874 edges. 1873 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:54:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1874 transitions. [2022-04-28 08:54:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 08:54:48,518 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:54:48,518 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:54:48,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 08:54:48,518 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:54:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:54:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1964705935, now seen corresponding path program 1 times [2022-04-28 08:54:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:54:48,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1760258302] [2022-04-28 08:54:48,613 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:54:48,613 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:54:48,613 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:54:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1964705935, now seen corresponding path program 2 times [2022-04-28 08:54:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:54:48,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239336379] [2022-04-28 08:54:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:54:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:54:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:54:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:54:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:54:48,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {169777#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {169770#true} is VALID [2022-04-28 08:54:48,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {169770#true} assume true; {169770#true} is VALID [2022-04-28 08:54:48,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {169770#true} {169770#true} #708#return; {169770#true} is VALID [2022-04-28 08:54:48,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {169770#true} call ULTIMATE.init(); {169777#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {169777#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {169770#true} assume true; {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {169770#true} {169770#true} #708#return; {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {169770#true} call #t~ret161 := main(); {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {169770#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; {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {169770#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L272 TraceCheckUtils]: 7: Hoare triple {169770#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {169770#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); {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {169770#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; {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {169770#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; {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {169770#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {169770#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {169770#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {169770#true} assume !false; {169770#true} is VALID [2022-04-28 08:54:48,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {169770#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); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {169770#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {169770#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {169770#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {169770#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {169770#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {169770#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {169770#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {169770#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {169770#true} assume 8464 == #t~mem55;havoc #t~mem55; {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {169770#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; {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {169770#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {169770#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); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {169770#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); {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 29: Hoare triple {169770#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169770#true} is VALID [2022-04-28 08:54:48,815 INFO L290 TraceCheckUtils]: 30: Hoare triple {169770#true} ~skip~0 := 0; {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 31: Hoare triple {169770#true} assume !false; {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 32: Hoare triple {169770#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); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 33: Hoare triple {169770#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {169770#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {169770#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {169770#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {169770#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {169770#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 39: Hoare triple {169770#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {169770#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {169770#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {169770#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {169770#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {169770#true} assume 8496 == #t~mem58;havoc #t~mem58; {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {169770#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {169770#true} is VALID [2022-04-28 08:54:48,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {169770#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {169770#true} is VALID [2022-04-28 08:54:48,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {169770#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {169770#true} is VALID [2022-04-28 08:54:48,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {169770#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {169775#(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; {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,823 INFO L290 TraceCheckUtils]: 63: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {169775#(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); {169775#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-28 08:54:48,826 INFO L290 TraceCheckUtils]: 74: Hoare triple {169775#(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); {169776#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-28 08:54:48,826 INFO L290 TraceCheckUtils]: 75: Hoare triple {169776#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {169771#false} is VALID [2022-04-28 08:54:48,826 INFO L290 TraceCheckUtils]: 76: Hoare triple {169771#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 77: Hoare triple {169771#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); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 78: Hoare triple {169771#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 79: Hoare triple {169771#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 80: Hoare triple {169771#false} ~skip~0 := 0; {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 81: Hoare triple {169771#false} assume !false; {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 82: Hoare triple {169771#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 83: Hoare triple {169771#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 84: Hoare triple {169771#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 85: Hoare triple {169771#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 86: Hoare triple {169771#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 87: Hoare triple {169771#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 88: Hoare triple {169771#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 89: Hoare triple {169771#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 90: Hoare triple {169771#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,827 INFO L290 TraceCheckUtils]: 91: Hoare triple {169771#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {169771#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {169771#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 94: Hoare triple {169771#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 95: Hoare triple {169771#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {169771#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {169771#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 98: Hoare triple {169771#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 99: Hoare triple {169771#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 100: Hoare triple {169771#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 101: Hoare triple {169771#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 102: Hoare triple {169771#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 103: Hoare triple {169771#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 104: Hoare triple {169771#false} assume 8448 == #t~mem68;havoc #t~mem68; {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 105: Hoare triple {169771#false} assume !(~num1~0 > 0); {169771#false} is VALID [2022-04-28 08:54:48,828 INFO L290 TraceCheckUtils]: 106: Hoare triple {169771#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; {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 107: Hoare triple {169771#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 108: Hoare triple {169771#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 109: Hoare triple {169771#false} ~skip~0 := 0; {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 110: Hoare triple {169771#false} assume !false; {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 111: Hoare triple {169771#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 112: Hoare triple {169771#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 113: Hoare triple {169771#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 114: Hoare triple {169771#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 115: Hoare triple {169771#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 116: Hoare triple {169771#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 117: Hoare triple {169771#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 118: Hoare triple {169771#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 119: Hoare triple {169771#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 120: Hoare triple {169771#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 121: Hoare triple {169771#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,829 INFO L290 TraceCheckUtils]: 122: Hoare triple {169771#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 123: Hoare triple {169771#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 124: Hoare triple {169771#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 125: Hoare triple {169771#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 126: Hoare triple {169771#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 127: Hoare triple {169771#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 128: Hoare triple {169771#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 129: Hoare triple {169771#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 130: Hoare triple {169771#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 131: Hoare triple {169771#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 132: Hoare triple {169771#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 133: Hoare triple {169771#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 134: Hoare triple {169771#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 135: Hoare triple {169771#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 136: Hoare triple {169771#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 137: Hoare triple {169771#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,830 INFO L290 TraceCheckUtils]: 138: Hoare triple {169771#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 139: Hoare triple {169771#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 140: Hoare triple {169771#false} assume 8640 == #t~mem75;havoc #t~mem75; {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 141: Hoare triple {169771#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 142: Hoare triple {169771#false} assume !(4 == ~blastFlag~0); {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 143: Hoare triple {169771#false} assume !(7 == ~blastFlag~0); {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 144: Hoare triple {169771#false} assume !(10 == ~blastFlag~0); {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 145: Hoare triple {169771#false} assume 13 == ~blastFlag~0; {169771#false} is VALID [2022-04-28 08:54:48,831 INFO L290 TraceCheckUtils]: 146: Hoare triple {169771#false} assume !false; {169771#false} is VALID [2022-04-28 08:54:48,831 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-28 08:54:48,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:54:48,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239336379] [2022-04-28 08:54:48,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239336379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:54:48,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:54:48,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:54:48,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:54:48,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1760258302] [2022-04-28 08:54:48,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1760258302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:54:48,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:54:48,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:54:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972288279] [2022-04-28 08:54:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:54:48,832 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-28 08:54:48,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:54:48,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:48,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:54:48,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:54:48,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:54:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:54:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:54:48,900 INFO L87 Difference]: Start difference. First operand 1225 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:54:55,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:54:57,247 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:55:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:02,439 INFO L93 Difference]: Finished difference Result 2621 states and 3986 transitions. [2022-04-28 08:55:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:55:02,439 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-28 08:55:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:55:02,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:02,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:55:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:55:02,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 08:55:02,838 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-28 08:55:02,910 INFO L225 Difference]: With dead ends: 2621 [2022-04-28 08:55:02,910 INFO L226 Difference]: Without dead ends: 1422 [2022-04-28 08:55:02,911 INFO L412 NwaCegarLoop]: 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-28 08:55:02,912 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 120 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 55 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:55:02,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 388 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 470 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 08:55:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-04-28 08:55:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1225. [2022-04-28 08:55:03,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:55:03,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:03,011 INFO L74 IsIncluded]: Start isIncluded. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:03,012 INFO L87 Difference]: Start difference. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:03,058 INFO L93 Difference]: Finished difference Result 1422 states and 2125 transitions. [2022-04-28 08:55:03,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2125 transitions. [2022-04-28 08:55:03,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:55:03,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:55:03,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1422 states. [2022-04-28 08:55:03,061 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1422 states. [2022-04-28 08:55:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:03,107 INFO L93 Difference]: Finished difference Result 1422 states and 2125 transitions. [2022-04-28 08:55:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2125 transitions. [2022-04-28 08:55:03,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:55:03,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:55:03,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:55:03,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:55:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.518032786885246) internal successors, (1852), 1220 states have internal predecessors, (1852), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1856 transitions. [2022-04-28 08:55:03,160 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1856 transitions. Word has length 147 [2022-04-28 08:55:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:55:03,160 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1856 transitions. [2022-04-28 08:55:03,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:03,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1856 transitions. [2022-04-28 08:55:07,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1856 edges. 1855 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:55:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1856 transitions. [2022-04-28 08:55:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-28 08:55:07,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:55:07,548 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-28 08:55:07,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 08:55:07,548 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:55:07,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:55:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash 883672029, now seen corresponding path program 1 times [2022-04-28 08:55:07,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:55:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366783007] [2022-04-28 08:55:07,644 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:55:07,644 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:55:07,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:55:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash 883672029, now seen corresponding path program 2 times [2022-04-28 08:55:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:55:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635192726] [2022-04-28 08:55:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:55:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:55:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:55:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:55:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:55:07,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {180325#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {180318#true} is VALID [2022-04-28 08:55:07,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {180318#true} assume true; {180318#true} is VALID [2022-04-28 08:55:07,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {180318#true} {180318#true} #708#return; {180318#true} is VALID [2022-04-28 08:55:07,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {180318#true} call ULTIMATE.init(); {180325#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:55:07,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {180325#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {180318#true} is VALID [2022-04-28 08:55:07,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {180318#true} assume true; {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {180318#true} {180318#true} #708#return; {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {180318#true} call #t~ret161 := main(); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {180318#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; {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {180318#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L272 TraceCheckUtils]: 7: Hoare triple {180318#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {180318#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); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {180318#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; {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {180318#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; {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {180318#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {180318#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {180318#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {180318#true} assume !false; {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {180318#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); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {180318#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {180318#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {180318#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {180318#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {180318#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {180318#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {180318#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {180318#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {180318#true} assume 8464 == #t~mem55;havoc #t~mem55; {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {180318#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; {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {180318#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {180318#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); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {180318#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); {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {180318#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {180318#true} ~skip~0 := 0; {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {180318#true} assume !false; {180318#true} is VALID [2022-04-28 08:55:07,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {180318#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); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {180318#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {180318#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 35: Hoare triple {180318#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {180318#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {180318#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {180318#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {180318#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {180318#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {180318#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {180318#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {180318#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {180318#true} assume 8496 == #t~mem58;havoc #t~mem58; {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {180318#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {180318#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {180318#true} is VALID [2022-04-28 08:55:07,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {180318#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {180318#true} is VALID [2022-04-28 08:55:07,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {180318#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,866 INFO L290 TraceCheckUtils]: 50: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,867 INFO L290 TraceCheckUtils]: 51: Hoare triple {180323#(= (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; {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,867 INFO L290 TraceCheckUtils]: 52: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,867 INFO L290 TraceCheckUtils]: 53: Hoare triple {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,868 INFO L290 TraceCheckUtils]: 54: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,868 INFO L290 TraceCheckUtils]: 55: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,868 INFO L290 TraceCheckUtils]: 56: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,869 INFO L290 TraceCheckUtils]: 59: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {180323#(= (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); {180323#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-28 08:55:07,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {180323#(= (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); {180324#(= |ssl3_accept_#t~mem54| 8512)} is VALID [2022-04-28 08:55:07,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {180324#(= |ssl3_accept_#t~mem54| 8512)} assume 8482 == #t~mem54;havoc #t~mem54; {180319#false} is VALID [2022-04-28 08:55:07,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {180319#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 64: Hoare triple {180319#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 65: Hoare triple {180319#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 66: Hoare triple {180319#false} ~skip~0 := 0; {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 67: Hoare triple {180319#false} assume !false; {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 68: Hoare triple {180319#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 69: Hoare triple {180319#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 70: Hoare triple {180319#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 71: Hoare triple {180319#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 72: Hoare triple {180319#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 73: Hoare triple {180319#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 74: Hoare triple {180319#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {180319#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 76: Hoare triple {180319#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 77: Hoare triple {180319#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {180319#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 79: Hoare triple {180319#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 80: Hoare triple {180319#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 81: Hoare triple {180319#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 82: Hoare triple {180319#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 83: Hoare triple {180319#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 84: Hoare triple {180319#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 85: Hoare triple {180319#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 86: Hoare triple {180319#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 87: Hoare triple {180319#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 88: Hoare triple {180319#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {180319#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {180319#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {180319#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {180319#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {180319#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,872 INFO L290 TraceCheckUtils]: 94: Hoare triple {180319#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 95: Hoare triple {180319#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 96: Hoare triple {180319#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 97: Hoare triple {180319#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 98: Hoare triple {180319#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 99: Hoare triple {180319#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 100: Hoare triple {180319#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 101: Hoare triple {180319#false} assume 8672 == #t~mem79;havoc #t~mem79; {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 102: Hoare triple {180319#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 103: Hoare triple {180319#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 104: Hoare triple {180319#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); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 105: Hoare triple {180319#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; {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 106: Hoare triple {180319#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 107: Hoare triple {180319#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 108: Hoare triple {180319#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {180319#false} is VALID [2022-04-28 08:55:07,873 INFO L290 TraceCheckUtils]: 109: Hoare triple {180319#false} ~skip~0 := 0; {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 110: Hoare triple {180319#false} assume !false; {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 111: Hoare triple {180319#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 112: Hoare triple {180319#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 113: Hoare triple {180319#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 114: Hoare triple {180319#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 115: Hoare triple {180319#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 116: Hoare triple {180319#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 117: Hoare triple {180319#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 118: Hoare triple {180319#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {180319#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {180319#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 121: Hoare triple {180319#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 122: Hoare triple {180319#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 123: Hoare triple {180319#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,874 INFO L290 TraceCheckUtils]: 124: Hoare triple {180319#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 125: Hoare triple {180319#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 126: Hoare triple {180319#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 127: Hoare triple {180319#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 128: Hoare triple {180319#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 129: Hoare triple {180319#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 130: Hoare triple {180319#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 131: Hoare triple {180319#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 132: Hoare triple {180319#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 133: Hoare triple {180319#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 134: Hoare triple {180319#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 135: Hoare triple {180319#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 136: Hoare triple {180319#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 137: Hoare triple {180319#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 138: Hoare triple {180319#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 139: Hoare triple {180319#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {180319#false} is VALID [2022-04-28 08:55:07,875 INFO L290 TraceCheckUtils]: 140: Hoare triple {180319#false} assume 8640 == #t~mem75;havoc #t~mem75; {180319#false} is VALID [2022-04-28 08:55:07,876 INFO L290 TraceCheckUtils]: 141: Hoare triple {180319#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {180319#false} is VALID [2022-04-28 08:55:07,876 INFO L290 TraceCheckUtils]: 142: Hoare triple {180319#false} assume !(4 == ~blastFlag~0); {180319#false} is VALID [2022-04-28 08:55:07,876 INFO L290 TraceCheckUtils]: 143: Hoare triple {180319#false} assume !(7 == ~blastFlag~0); {180319#false} is VALID [2022-04-28 08:55:07,876 INFO L290 TraceCheckUtils]: 144: Hoare triple {180319#false} assume !(10 == ~blastFlag~0); {180319#false} is VALID [2022-04-28 08:55:07,876 INFO L290 TraceCheckUtils]: 145: Hoare triple {180319#false} assume 13 == ~blastFlag~0; {180319#false} is VALID [2022-04-28 08:55:07,876 INFO L290 TraceCheckUtils]: 146: Hoare triple {180319#false} assume !false; {180319#false} is VALID [2022-04-28 08:55:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 08:55:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:55:07,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635192726] [2022-04-28 08:55:07,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635192726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:55:07,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:55:07,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:55:07,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:55:07,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366783007] [2022-04-28 08:55:07,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366783007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:55:07,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:55:07,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:55:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745050603] [2022-04-28 08:55:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:55:07,878 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 147 [2022-04-28 08:55:07,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:55:07,879 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-28 08:55:07,968 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-28 08:55:07,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:55:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:55:07,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:55:07,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:55:07,969 INFO L87 Difference]: Start difference. First operand 1225 states and 1856 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-28 08:55:12,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:55:14,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:55:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:22,692 INFO L93 Difference]: Finished difference Result 2453 states and 3718 transitions. [2022-04-28 08:55:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:55:22,692 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 147 [2022-04-28 08:55:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:55:22,692 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-28 08:55:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 08:55:22,694 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-28 08:55:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-28 08:55:22,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-28 08:55:23,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:55:23,068 INFO L225 Difference]: With dead ends: 2453 [2022-04-28 08:55:23,068 INFO L226 Difference]: Without dead ends: 1254 [2022-04-28 08:55:23,072 INFO L412 NwaCegarLoop]: 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-28 08:55:23,072 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 31 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:55:23,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 609 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 430 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-04-28 08:55:23,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2022-04-28 08:55:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1225. [2022-04-28 08:55:23,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:55:23,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1254 states. Second operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:23,162 INFO L74 IsIncluded]: Start isIncluded. First operand 1254 states. Second operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:23,163 INFO L87 Difference]: Start difference. First operand 1254 states. Second operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:23,199 INFO L93 Difference]: Finished difference Result 1254 states and 1890 transitions. [2022-04-28 08:55:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1890 transitions. [2022-04-28 08:55:23,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:55:23,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:55:23,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1254 states. [2022-04-28 08:55:23,201 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1254 states. [2022-04-28 08:55:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:23,238 INFO L93 Difference]: Finished difference Result 1254 states and 1890 transitions. [2022-04-28 08:55:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1890 transitions. [2022-04-28 08:55:23,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:55:23,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:55:23,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:55:23,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:55:23,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5155737704918033) internal successors, (1849), 1220 states have internal predecessors, (1849), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1853 transitions. [2022-04-28 08:55:23,302 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1853 transitions. Word has length 147 [2022-04-28 08:55:23,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:55:23,302 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1853 transitions. [2022-04-28 08:55:23,302 INFO L496 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-28 08:55:23,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1853 transitions. [2022-04-28 08:55:27,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1852 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:55:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1853 transitions. [2022-04-28 08:55:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 08:55:27,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:55:27,616 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:55:27,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 08:55:27,616 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:55:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:55:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -979936917, now seen corresponding path program 1 times [2022-04-28 08:55:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:55:27,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106128743] [2022-04-28 08:55:27,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:55:27,725 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:55:27,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:55:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -979936917, now seen corresponding path program 2 times [2022-04-28 08:55:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:55:27,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851864174] [2022-04-28 08:55:27,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:55:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:55:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:55:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:55:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:55:27,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {190201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {190194#true} is VALID [2022-04-28 08:55:27,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {190194#true} assume true; {190194#true} is VALID [2022-04-28 08:55:27,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190194#true} {190194#true} #708#return; {190194#true} is VALID [2022-04-28 08:55:27,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {190194#true} call ULTIMATE.init(); {190201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {190201#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {190194#true} assume true; {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190194#true} {190194#true} #708#return; {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {190194#true} call #t~ret161 := main(); {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {190194#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; {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {190194#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L272 TraceCheckUtils]: 7: Hoare triple {190194#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {190194#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); {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {190194#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; {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {190194#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; {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {190194#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {190194#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {190194#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {190194#true} assume !false; {190194#true} is VALID [2022-04-28 08:55:27,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {190194#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); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {190194#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {190194#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {190194#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {190194#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {190194#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {190194#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {190194#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {190194#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {190194#true} assume 8464 == #t~mem55;havoc #t~mem55; {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {190194#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; {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {190194#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {190194#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); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {190194#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); {190194#true} is VALID [2022-04-28 08:55:27,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {190194#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {190194#true} ~skip~0 := 0; {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {190194#true} assume !false; {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {190194#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); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {190194#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {190194#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {190194#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {190194#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {190194#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {190194#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {190194#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {190194#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 41: Hoare triple {190194#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {190194#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {190194#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {190194#true} assume 8496 == #t~mem58;havoc #t~mem58; {190194#true} is VALID [2022-04-28 08:55:27,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {190194#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {190194#true} is VALID [2022-04-28 08:55:27,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {190194#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {190194#true} is VALID [2022-04-28 08:55:27,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {190194#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {190194#true} is VALID [2022-04-28 08:55:27,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {190194#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {190199#(= 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; {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,926 INFO L290 TraceCheckUtils]: 65: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,926 INFO L290 TraceCheckUtils]: 66: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,927 INFO L290 TraceCheckUtils]: 68: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,927 INFO L290 TraceCheckUtils]: 69: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,927 INFO L290 TraceCheckUtils]: 70: Hoare triple {190199#(= 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); {190199#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:27,928 INFO L290 TraceCheckUtils]: 71: Hoare triple {190199#(= 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); {190200#(= |ssl3_accept_#t~mem64| 8656)} is VALID [2022-04-28 08:55:27,928 INFO L290 TraceCheckUtils]: 72: Hoare triple {190200#(= |ssl3_accept_#t~mem64| 8656)} assume 8544 == #t~mem64;havoc #t~mem64; {190195#false} is VALID [2022-04-28 08:55:27,928 INFO L290 TraceCheckUtils]: 73: Hoare triple {190195#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,928 INFO L290 TraceCheckUtils]: 74: Hoare triple {190195#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); {190195#false} is VALID [2022-04-28 08:55:27,928 INFO L290 TraceCheckUtils]: 75: Hoare triple {190195#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 76: Hoare triple {190195#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); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {190195#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; {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {190195#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; {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {190195#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); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 80: Hoare triple {190195#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {190195#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {190195#false} ~skip~0 := 0; {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {190195#false} assume !false; {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {190195#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {190195#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 86: Hoare triple {190195#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 87: Hoare triple {190195#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 88: Hoare triple {190195#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {190195#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,929 INFO L290 TraceCheckUtils]: 90: Hoare triple {190195#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 91: Hoare triple {190195#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 92: Hoare triple {190195#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 93: Hoare triple {190195#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 94: Hoare triple {190195#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 95: Hoare triple {190195#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {190195#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {190195#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 98: Hoare triple {190195#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 99: Hoare triple {190195#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 100: Hoare triple {190195#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 101: Hoare triple {190195#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 102: Hoare triple {190195#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 103: Hoare triple {190195#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 104: Hoare triple {190195#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,930 INFO L290 TraceCheckUtils]: 105: Hoare triple {190195#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 106: Hoare triple {190195#false} assume 8448 == #t~mem68;havoc #t~mem68; {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 107: Hoare triple {190195#false} assume !(~num1~0 > 0); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 108: Hoare triple {190195#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; {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 109: Hoare triple {190195#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 110: Hoare triple {190195#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 111: Hoare triple {190195#false} ~skip~0 := 0; {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 112: Hoare triple {190195#false} assume !false; {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 113: Hoare triple {190195#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 114: Hoare triple {190195#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 115: Hoare triple {190195#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 116: Hoare triple {190195#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 117: Hoare triple {190195#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 118: Hoare triple {190195#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 119: Hoare triple {190195#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 120: Hoare triple {190195#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,931 INFO L290 TraceCheckUtils]: 121: Hoare triple {190195#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 122: Hoare triple {190195#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 123: Hoare triple {190195#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 124: Hoare triple {190195#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 125: Hoare triple {190195#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 126: Hoare triple {190195#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 127: Hoare triple {190195#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 128: Hoare triple {190195#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 129: Hoare triple {190195#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 130: Hoare triple {190195#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 131: Hoare triple {190195#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 132: Hoare triple {190195#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 133: Hoare triple {190195#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 134: Hoare triple {190195#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 135: Hoare triple {190195#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 136: Hoare triple {190195#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,932 INFO L290 TraceCheckUtils]: 137: Hoare triple {190195#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 138: Hoare triple {190195#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 139: Hoare triple {190195#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 140: Hoare triple {190195#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 141: Hoare triple {190195#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 142: Hoare triple {190195#false} assume 8640 == #t~mem75;havoc #t~mem75; {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 143: Hoare triple {190195#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 144: Hoare triple {190195#false} assume !(4 == ~blastFlag~0); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 145: Hoare triple {190195#false} assume !(7 == ~blastFlag~0); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 146: Hoare triple {190195#false} assume !(10 == ~blastFlag~0); {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 147: Hoare triple {190195#false} assume 13 == ~blastFlag~0; {190195#false} is VALID [2022-04-28 08:55:27,933 INFO L290 TraceCheckUtils]: 148: Hoare triple {190195#false} assume !false; {190195#false} is VALID [2022-04-28 08:55:27,934 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-28 08:55:27,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:55:27,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851864174] [2022-04-28 08:55:27,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851864174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:55:27,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:55:27,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:55:27,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:55:27,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106128743] [2022-04-28 08:55:27,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106128743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:55:27,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:55:27,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:55:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658535201] [2022-04-28 08:55:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:55:27,935 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 149 [2022-04-28 08:55:27,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:55:27,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:28,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:55:28,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:55:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:55:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:55:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:55:28,011 INFO L87 Difference]: Start difference. First operand 1225 states and 1853 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:30,023 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-28 08:55:32,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:55:37,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:55:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:43,494 INFO L93 Difference]: Finished difference Result 2504 states and 3784 transitions. [2022-04-28 08:55:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:55:43,494 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 149 [2022-04-28 08:55:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:55:43,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-28 08:55:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-04-28 08:55:43,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 529 transitions. [2022-04-28 08:55:43,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 529 edges. 529 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:55:43,934 INFO L225 Difference]: With dead ends: 2504 [2022-04-28 08:55:43,934 INFO L226 Difference]: Without dead ends: 1305 [2022-04-28 08:55:43,936 INFO L412 NwaCegarLoop]: 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-28 08:55:43,936 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 61 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:55:43,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 641 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 557 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-04-28 08:55:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2022-04-28 08:55:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1225. [2022-04-28 08:55:44,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:55:44,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1305 states. Second operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:44,025 INFO L74 IsIncluded]: Start isIncluded. First operand 1305 states. Second operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:44,026 INFO L87 Difference]: Start difference. First operand 1305 states. Second operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:44,065 INFO L93 Difference]: Finished difference Result 1305 states and 1959 transitions. [2022-04-28 08:55:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1959 transitions. [2022-04-28 08:55:44,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:55:44,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:55:44,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1305 states. [2022-04-28 08:55:44,067 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1305 states. [2022-04-28 08:55:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:55:44,106 INFO L93 Difference]: Finished difference Result 1305 states and 1959 transitions. [2022-04-28 08:55:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1959 transitions. [2022-04-28 08:55:44,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:55:44,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:55:44,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:55:44,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:55:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5131147540983607) internal successors, (1846), 1220 states have internal predecessors, (1846), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1850 transitions. [2022-04-28 08:55:44,183 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1850 transitions. Word has length 149 [2022-04-28 08:55:44,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:55:44,183 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1850 transitions. [2022-04-28 08:55:44,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:44,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1850 transitions. [2022-04-28 08:55:48,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1850 edges. 1849 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:55:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1850 transitions. [2022-04-28 08:55:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-28 08:55:48,534 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:55:48,534 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:55:48,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 08:55:48,535 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:55:48,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:55:48,535 INFO L85 PathProgramCache]: Analyzing trace with hash -292719464, now seen corresponding path program 1 times [2022-04-28 08:55:48,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:55:48,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [281762645] [2022-04-28 08:55:48,642 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:55:48,642 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:55:48,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:55:48,642 INFO L85 PathProgramCache]: Analyzing trace with hash -292719464, now seen corresponding path program 2 times [2022-04-28 08:55:48,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:55:48,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316846858] [2022-04-28 08:55:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:55:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:55:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:55:48,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:55:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:55:48,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {200274#true} is VALID [2022-04-28 08:55:48,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {200274#true} assume true; {200274#true} is VALID [2022-04-28 08:55:48,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {200274#true} {200274#true} #708#return; {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {200274#true} call ULTIMATE.init(); {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {200281#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {200274#true} assume true; {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {200274#true} {200274#true} #708#return; {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {200274#true} call #t~ret161 := main(); {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {200274#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; {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {200274#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L272 TraceCheckUtils]: 7: Hoare triple {200274#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {200274#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); {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {200274#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; {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {200274#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; {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {200274#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {200274#true} is VALID [2022-04-28 08:55:48,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {200274#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {200274#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {200274#true} assume !false; {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {200274#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); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {200274#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {200274#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {200274#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {200274#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {200274#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {200274#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {200274#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {200274#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {200274#true} assume 8464 == #t~mem55;havoc #t~mem55; {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {200274#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; {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {200274#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {200274#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); {200274#true} is VALID [2022-04-28 08:55:48,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {200274#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); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {200274#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {200274#true} ~skip~0 := 0; {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {200274#true} assume !false; {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {200274#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); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {200274#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {200274#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {200274#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {200274#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {200274#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {200274#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {200274#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {200274#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {200274#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {200274#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {200274#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {200274#true} assume 8496 == #t~mem58;havoc #t~mem58; {200274#true} is VALID [2022-04-28 08:55:48,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {200274#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {200274#true} is VALID [2022-04-28 08:55:48,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {200274#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {200274#true} is VALID [2022-04-28 08:55:48,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {200274#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {200274#true} is VALID [2022-04-28 08:55:48,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {200274#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {200279#(= 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; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,907 INFO L290 TraceCheckUtils]: 58: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,909 INFO L290 TraceCheckUtils]: 62: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,909 INFO L290 TraceCheckUtils]: 63: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,910 INFO L290 TraceCheckUtils]: 65: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,910 INFO L290 TraceCheckUtils]: 66: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,910 INFO L290 TraceCheckUtils]: 67: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,911 INFO L290 TraceCheckUtils]: 68: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,911 INFO L290 TraceCheckUtils]: 69: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,912 INFO L290 TraceCheckUtils]: 71: Hoare triple {200279#(= 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); {200279#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:55:48,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {200279#(= 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); {200280#(= |ssl3_accept_#t~mem65| 8656)} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 73: Hoare triple {200280#(= |ssl3_accept_#t~mem65| 8656)} assume 8545 == #t~mem65;havoc #t~mem65; {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 74: Hoare triple {200275#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 75: Hoare triple {200275#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); {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {200275#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {200275#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); {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {200275#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; {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {200275#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; {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {200275#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); {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {200275#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {200275#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 83: Hoare triple {200275#false} ~skip~0 := 0; {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 84: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 85: Hoare triple {200275#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,913 INFO L290 TraceCheckUtils]: 86: Hoare triple {200275#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {200275#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {200275#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {200275#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 90: Hoare triple {200275#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 91: Hoare triple {200275#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 92: Hoare triple {200275#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 93: Hoare triple {200275#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 94: Hoare triple {200275#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {200275#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 96: Hoare triple {200275#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 97: Hoare triple {200275#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 98: Hoare triple {200275#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 99: Hoare triple {200275#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 100: Hoare triple {200275#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 101: Hoare triple {200275#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,914 INFO L290 TraceCheckUtils]: 102: Hoare triple {200275#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 103: Hoare triple {200275#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 104: Hoare triple {200275#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 105: Hoare triple {200275#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 106: Hoare triple {200275#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 107: Hoare triple {200275#false} assume 8448 == #t~mem68;havoc #t~mem68; {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 108: Hoare triple {200275#false} assume !(~num1~0 > 0); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 109: Hoare triple {200275#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; {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 110: Hoare triple {200275#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 111: Hoare triple {200275#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 112: Hoare triple {200275#false} ~skip~0 := 0; {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 113: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 114: Hoare triple {200275#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 115: Hoare triple {200275#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 116: Hoare triple {200275#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,915 INFO L290 TraceCheckUtils]: 117: Hoare triple {200275#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 118: Hoare triple {200275#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 119: Hoare triple {200275#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 120: Hoare triple {200275#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 121: Hoare triple {200275#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 122: Hoare triple {200275#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 123: Hoare triple {200275#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 124: Hoare triple {200275#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 125: Hoare triple {200275#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 126: Hoare triple {200275#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 127: Hoare triple {200275#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 128: Hoare triple {200275#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 129: Hoare triple {200275#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 130: Hoare triple {200275#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 131: Hoare triple {200275#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,916 INFO L290 TraceCheckUtils]: 132: Hoare triple {200275#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 133: Hoare triple {200275#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 134: Hoare triple {200275#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 135: Hoare triple {200275#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 136: Hoare triple {200275#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 137: Hoare triple {200275#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 138: Hoare triple {200275#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 139: Hoare triple {200275#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 140: Hoare triple {200275#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 141: Hoare triple {200275#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 142: Hoare triple {200275#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 143: Hoare triple {200275#false} assume 8640 == #t~mem75;havoc #t~mem75; {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 144: Hoare triple {200275#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 145: Hoare triple {200275#false} assume !(4 == ~blastFlag~0); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 146: Hoare triple {200275#false} assume !(7 == ~blastFlag~0); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 147: Hoare triple {200275#false} assume !(10 == ~blastFlag~0); {200275#false} is VALID [2022-04-28 08:55:48,917 INFO L290 TraceCheckUtils]: 148: Hoare triple {200275#false} assume 13 == ~blastFlag~0; {200275#false} is VALID [2022-04-28 08:55:48,918 INFO L290 TraceCheckUtils]: 149: Hoare triple {200275#false} assume !false; {200275#false} is VALID [2022-04-28 08:55:48,918 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-28 08:55:48,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:55:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316846858] [2022-04-28 08:55:48,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316846858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:55:48,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:55:48,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:55:48,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:55:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [281762645] [2022-04-28 08:55:48,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [281762645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:55:48,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:55:48,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:55:48,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051336830] [2022-04-28 08:55:48,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:55:48,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-28 08:55:48,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:55:48,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:48,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:55:48,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:55:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:55:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:55:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:55:48,997 INFO L87 Difference]: Start difference. First operand 1225 states and 1850 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:55:54,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:55:57,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:56:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:02,976 INFO L93 Difference]: Finished difference Result 2480 states and 3739 transitions. [2022-04-28 08:56:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:56:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2022-04-28 08:56:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:56:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2022-04-28 08:56:02,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 515 transitions. [2022-04-28 08:56:02,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 515 transitions. [2022-04-28 08:56:03,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 515 edges. 515 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:03,361 INFO L225 Difference]: With dead ends: 2480 [2022-04-28 08:56:03,361 INFO L226 Difference]: Without dead ends: 1281 [2022-04-28 08:56:03,362 INFO L412 NwaCegarLoop]: 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-28 08:56:03,363 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 50 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-28 08:56:03,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 631 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-28 08:56:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2022-04-28 08:56:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1225. [2022-04-28 08:56:03,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:56:03,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1281 states. Second operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:03,453 INFO L74 IsIncluded]: Start isIncluded. First operand 1281 states. Second operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:03,453 INFO L87 Difference]: Start difference. First operand 1281 states. Second operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:03,491 INFO L93 Difference]: Finished difference Result 1281 states and 1917 transitions. [2022-04-28 08:56:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1917 transitions. [2022-04-28 08:56:03,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:03,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:03,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1281 states. [2022-04-28 08:56:03,493 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1281 states. [2022-04-28 08:56:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:03,531 INFO L93 Difference]: Finished difference Result 1281 states and 1917 transitions. [2022-04-28 08:56:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1917 transitions. [2022-04-28 08:56:03,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:03,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:03,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:56:03,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:56:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.5106557377049181) internal successors, (1843), 1220 states have internal predecessors, (1843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1847 transitions. [2022-04-28 08:56:03,595 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1847 transitions. Word has length 150 [2022-04-28 08:56:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:56:03,595 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1847 transitions. [2022-04-28 08:56:03,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:03,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1847 transitions. [2022-04-28 08:56:07,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1847 edges. 1846 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1847 transitions. [2022-04-28 08:56:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 08:56:07,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:56:07,939 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-28 08:56:07,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-28 08:56:07,939 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:56:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:56:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 83155422, now seen corresponding path program 1 times [2022-04-28 08:56:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:07,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [739494394] [2022-04-28 08:56:08,048 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:56:08,049 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:56:08,049 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:56:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 83155422, now seen corresponding path program 2 times [2022-04-28 08:56:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:56:08,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039089359] [2022-04-28 08:56:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:56:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:56:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:08,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:56:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:08,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {210265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {210258#true} is VALID [2022-04-28 08:56:08,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {210258#true} assume true; {210258#true} is VALID [2022-04-28 08:56:08,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210258#true} {210258#true} #708#return; {210258#true} is VALID [2022-04-28 08:56:08,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {210258#true} call ULTIMATE.init(); {210265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:56:08,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {210265#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {210258#true} is VALID [2022-04-28 08:56:08,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {210258#true} assume true; {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210258#true} {210258#true} #708#return; {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L272 TraceCheckUtils]: 4: Hoare triple {210258#true} call #t~ret161 := main(); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {210258#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; {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {210258#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L272 TraceCheckUtils]: 7: Hoare triple {210258#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {210258#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); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {210258#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; {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {210258#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; {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {210258#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {210258#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {210258#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {210258#true} assume !false; {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {210258#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); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {210258#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {210258#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {210258#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {210258#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {210258#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {210258#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {210258#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {210258#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {210258#true} assume 8464 == #t~mem55;havoc #t~mem55; {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {210258#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; {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {210258#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {210258#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); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {210258#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); {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {210258#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {210258#true} ~skip~0 := 0; {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 31: Hoare triple {210258#true} assume !false; {210258#true} is VALID [2022-04-28 08:56:08,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {210258#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); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 33: Hoare triple {210258#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 34: Hoare triple {210258#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 35: Hoare triple {210258#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {210258#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {210258#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {210258#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {210258#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 40: Hoare triple {210258#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {210258#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {210258#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {210258#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {210258#true} assume 8496 == #t~mem58;havoc #t~mem58; {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {210258#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 46: Hoare triple {210258#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {210258#true} is VALID [2022-04-28 08:56:08,280 INFO L290 TraceCheckUtils]: 47: Hoare triple {210258#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {210258#true} is VALID [2022-04-28 08:56:08,281 INFO L290 TraceCheckUtils]: 48: Hoare triple {210258#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,282 INFO L290 TraceCheckUtils]: 51: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} ~skip~0 := 0; {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !false; {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,283 INFO L290 TraceCheckUtils]: 55: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,284 INFO L290 TraceCheckUtils]: 56: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,284 INFO L290 TraceCheckUtils]: 57: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,284 INFO L290 TraceCheckUtils]: 58: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,285 INFO L290 TraceCheckUtils]: 59: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,285 INFO L290 TraceCheckUtils]: 60: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,285 INFO L290 TraceCheckUtils]: 61: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,286 INFO L290 TraceCheckUtils]: 62: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,286 INFO L290 TraceCheckUtils]: 63: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,286 INFO L290 TraceCheckUtils]: 64: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,286 INFO L290 TraceCheckUtils]: 65: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,287 INFO L290 TraceCheckUtils]: 66: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} is VALID [2022-04-28 08:56:08,287 INFO L290 TraceCheckUtils]: 67: Hoare triple {210263#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210264#(not (= |ssl3_accept_#t~mem60| 8512))} is VALID [2022-04-28 08:56:08,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {210264#(not (= |ssl3_accept_#t~mem60| 8512))} assume 8512 == #t~mem60;havoc #t~mem60; {210259#false} is VALID [2022-04-28 08:56:08,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {210259#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); {210259#false} is VALID [2022-04-28 08:56:08,287 INFO L290 TraceCheckUtils]: 70: Hoare triple {210259#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {210259#false} is VALID [2022-04-28 08:56:08,288 INFO L290 TraceCheckUtils]: 71: Hoare triple {210259#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,288 INFO L290 TraceCheckUtils]: 72: Hoare triple {210259#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,288 INFO L290 TraceCheckUtils]: 73: Hoare triple {210259#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210259#false} is VALID [2022-04-28 08:56:08,288 INFO L290 TraceCheckUtils]: 74: Hoare triple {210259#false} ~skip~0 := 0; {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 75: Hoare triple {210259#false} assume !false; {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 76: Hoare triple {210259#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 77: Hoare triple {210259#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 78: Hoare triple {210259#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 79: Hoare triple {210259#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 80: Hoare triple {210259#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 81: Hoare triple {210259#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 82: Hoare triple {210259#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 83: Hoare triple {210259#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 84: Hoare triple {210259#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 85: Hoare triple {210259#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 86: Hoare triple {210259#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 87: Hoare triple {210259#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 88: Hoare triple {210259#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,289 INFO L290 TraceCheckUtils]: 89: Hoare triple {210259#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 90: Hoare triple {210259#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 91: Hoare triple {210259#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {210259#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {210259#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 94: Hoare triple {210259#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 95: Hoare triple {210259#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 96: Hoare triple {210259#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 97: Hoare triple {210259#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 98: Hoare triple {210259#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 99: Hoare triple {210259#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 100: Hoare triple {210259#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 101: Hoare triple {210259#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 102: Hoare triple {210259#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 103: Hoare triple {210259#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 104: Hoare triple {210259#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,290 INFO L290 TraceCheckUtils]: 105: Hoare triple {210259#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 106: Hoare triple {210259#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 107: Hoare triple {210259#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 108: Hoare triple {210259#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 109: Hoare triple {210259#false} assume 8672 == #t~mem79;havoc #t~mem79; {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 110: Hoare triple {210259#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 111: Hoare triple {210259#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 112: Hoare triple {210259#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); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 113: Hoare triple {210259#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; {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 114: Hoare triple {210259#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 115: Hoare triple {210259#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 116: Hoare triple {210259#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 117: Hoare triple {210259#false} ~skip~0 := 0; {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 118: Hoare triple {210259#false} assume !false; {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 119: Hoare triple {210259#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,291 INFO L290 TraceCheckUtils]: 120: Hoare triple {210259#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 121: Hoare triple {210259#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 122: Hoare triple {210259#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 123: Hoare triple {210259#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 124: Hoare triple {210259#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 125: Hoare triple {210259#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 126: Hoare triple {210259#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 127: Hoare triple {210259#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 128: Hoare triple {210259#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 129: Hoare triple {210259#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 130: Hoare triple {210259#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 131: Hoare triple {210259#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 132: Hoare triple {210259#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 133: Hoare triple {210259#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 134: Hoare triple {210259#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 135: Hoare triple {210259#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,292 INFO L290 TraceCheckUtils]: 136: Hoare triple {210259#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 137: Hoare triple {210259#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 138: Hoare triple {210259#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 139: Hoare triple {210259#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 140: Hoare triple {210259#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 141: Hoare triple {210259#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 142: Hoare triple {210259#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 143: Hoare triple {210259#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 144: Hoare triple {210259#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 145: Hoare triple {210259#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 146: Hoare triple {210259#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 147: Hoare triple {210259#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 148: Hoare triple {210259#false} assume 8640 == #t~mem75;havoc #t~mem75; {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 149: Hoare triple {210259#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 150: Hoare triple {210259#false} assume !(4 == ~blastFlag~0); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 151: Hoare triple {210259#false} assume !(7 == ~blastFlag~0); {210259#false} is VALID [2022-04-28 08:56:08,293 INFO L290 TraceCheckUtils]: 152: Hoare triple {210259#false} assume !(10 == ~blastFlag~0); {210259#false} is VALID [2022-04-28 08:56:08,294 INFO L290 TraceCheckUtils]: 153: Hoare triple {210259#false} assume 13 == ~blastFlag~0; {210259#false} is VALID [2022-04-28 08:56:08,294 INFO L290 TraceCheckUtils]: 154: Hoare triple {210259#false} assume !false; {210259#false} is VALID [2022-04-28 08:56:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 08:56:08,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:56:08,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039089359] [2022-04-28 08:56:08,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039089359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:08,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:08,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:56:08,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:56:08,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [739494394] [2022-04-28 08:56:08,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [739494394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:08,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:08,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:56:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354174225] [2022-04-28 08:56:08,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:56:08,295 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 155 [2022-04-28 08:56:08,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:56:08,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:08,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:08,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:56:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:56:08,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:56:08,357 INFO L87 Difference]: Start difference. First operand 1225 states and 1847 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:17,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:56:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:22,292 INFO L93 Difference]: Finished difference Result 2621 states and 3932 transitions. [2022-04-28 08:56:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:56:22,292 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 155 [2022-04-28 08:56:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:56:22,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:56:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-04-28 08:56:22,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 593 transitions. [2022-04-28 08:56:22,636 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-28 08:56:22,705 INFO L225 Difference]: With dead ends: 2621 [2022-04-28 08:56:22,705 INFO L226 Difference]: Without dead ends: 1422 [2022-04-28 08:56:22,706 INFO L412 NwaCegarLoop]: 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-28 08:56:22,706 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 126 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-28 08:56:22,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 388 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-04-28 08:56:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2022-04-28 08:56:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1225. [2022-04-28 08:56:22,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:56:22,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:22,820 INFO L74 IsIncluded]: Start isIncluded. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:22,820 INFO L87 Difference]: Start difference. First operand 1422 states. Second operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:22,866 INFO L93 Difference]: Finished difference Result 1422 states and 2098 transitions. [2022-04-28 08:56:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2098 transitions. [2022-04-28 08:56:22,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:22,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:22,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1422 states. [2022-04-28 08:56:22,868 INFO L87 Difference]: Start difference. First operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1422 states. [2022-04-28 08:56:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:22,914 INFO L93 Difference]: Finished difference Result 1422 states and 2098 transitions. [2022-04-28 08:56:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2098 transitions. [2022-04-28 08:56:22,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:22,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:22,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:56:22,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:56:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1220 states have (on average 1.4959016393442623) internal successors, (1825), 1220 states have internal predecessors, (1825), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:22,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1829 transitions. [2022-04-28 08:56:22,966 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1829 transitions. Word has length 155 [2022-04-28 08:56:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:56:22,966 INFO L495 AbstractCegarLoop]: Abstraction has 1225 states and 1829 transitions. [2022-04-28 08:56:22,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:22,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1225 states and 1829 transitions. [2022-04-28 08:56:27,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1829 edges. 1828 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1829 transitions. [2022-04-28 08:56:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 08:56:27,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:56:27,372 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-28 08:56:27,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 08:56:27,372 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:56:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:56:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2058705056, now seen corresponding path program 1 times [2022-04-28 08:56:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:27,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [705217714] [2022-04-28 08:56:27,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:56:27,482 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:56:27,482 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:56:27,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2058705056, now seen corresponding path program 2 times [2022-04-28 08:56:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:56:27,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147012422] [2022-04-28 08:56:27,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:56:27,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:56:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:56:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:27,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {220812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {220806#true} is VALID [2022-04-28 08:56:27,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {220806#true} assume true; {220806#true} is VALID [2022-04-28 08:56:27,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220806#true} {220806#true} #708#return; {220806#true} is VALID [2022-04-28 08:56:27,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {220806#true} call ULTIMATE.init(); {220812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:56:27,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {220812#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {220806#true} is VALID [2022-04-28 08:56:27,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {220806#true} assume true; {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220806#true} {220806#true} #708#return; {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {220806#true} call #t~ret161 := main(); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {220806#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; {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {220806#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L272 TraceCheckUtils]: 7: Hoare triple {220806#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {220806#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); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {220806#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; {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {220806#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; {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {220806#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {220806#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {220806#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {220806#true} assume !false; {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {220806#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); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {220806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {220806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {220806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {220806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {220806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {220806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {220806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {220806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {220806#true} assume 8464 == #t~mem55;havoc #t~mem55; {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {220806#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; {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {220806#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {220806#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); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {220806#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); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {220806#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {220806#true} ~skip~0 := 0; {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {220806#true} assume !false; {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {220806#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); {220806#true} is VALID [2022-04-28 08:56:27,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {220806#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {220806#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 35: Hoare triple {220806#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 36: Hoare triple {220806#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {220806#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {220806#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {220806#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {220806#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {220806#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {220806#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {220806#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {220806#true} assume 8496 == #t~mem58;havoc #t~mem58; {220806#true} is VALID [2022-04-28 08:56:27,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {220806#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {220806#true} is VALID [2022-04-28 08:56:27,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {220806#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,651 INFO L290 TraceCheckUtils]: 47: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {220811#(= 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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,652 INFO L290 TraceCheckUtils]: 53: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {220811#(= 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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,653 INFO L290 TraceCheckUtils]: 57: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,654 INFO L290 TraceCheckUtils]: 59: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,654 INFO L290 TraceCheckUtils]: 60: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,655 INFO L290 TraceCheckUtils]: 62: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,655 INFO L290 TraceCheckUtils]: 63: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,655 INFO L290 TraceCheckUtils]: 64: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,656 INFO L290 TraceCheckUtils]: 65: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,656 INFO L290 TraceCheckUtils]: 66: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,656 INFO L290 TraceCheckUtils]: 67: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,656 INFO L290 TraceCheckUtils]: 68: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,657 INFO L290 TraceCheckUtils]: 70: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,657 INFO L290 TraceCheckUtils]: 71: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,658 INFO L290 TraceCheckUtils]: 72: Hoare triple {220811#(= 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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,658 INFO L290 TraceCheckUtils]: 73: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,658 INFO L290 TraceCheckUtils]: 74: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,658 INFO L290 TraceCheckUtils]: 75: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {220811#(= 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); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,659 INFO L290 TraceCheckUtils]: 79: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,660 INFO L290 TraceCheckUtils]: 80: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,660 INFO L290 TraceCheckUtils]: 81: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,660 INFO L290 TraceCheckUtils]: 82: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,660 INFO L290 TraceCheckUtils]: 83: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,661 INFO L290 TraceCheckUtils]: 85: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,661 INFO L290 TraceCheckUtils]: 86: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,662 INFO L290 TraceCheckUtils]: 90: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,663 INFO L290 TraceCheckUtils]: 91: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,664 INFO L290 TraceCheckUtils]: 95: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,664 INFO L290 TraceCheckUtils]: 96: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,664 INFO L290 TraceCheckUtils]: 97: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,664 INFO L290 TraceCheckUtils]: 98: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,665 INFO L290 TraceCheckUtils]: 99: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,665 INFO L290 TraceCheckUtils]: 100: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,665 INFO L290 TraceCheckUtils]: 101: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,666 INFO L290 TraceCheckUtils]: 102: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,666 INFO L290 TraceCheckUtils]: 103: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,666 INFO L290 TraceCheckUtils]: 104: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,666 INFO L290 TraceCheckUtils]: 105: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,667 INFO L290 TraceCheckUtils]: 106: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,667 INFO L290 TraceCheckUtils]: 107: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,667 INFO L290 TraceCheckUtils]: 108: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,667 INFO L290 TraceCheckUtils]: 109: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem79;havoc #t~mem79; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 110: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {220811#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 111: Hoare triple {220811#(= 2 ssl3_accept_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {220807#false} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 112: Hoare triple {220807#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); {220807#false} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 113: Hoare triple {220807#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; {220807#false} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 114: Hoare triple {220807#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 115: Hoare triple {220807#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 116: Hoare triple {220807#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220807#false} is VALID [2022-04-28 08:56:27,668 INFO L290 TraceCheckUtils]: 117: Hoare triple {220807#false} ~skip~0 := 0; {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 118: Hoare triple {220807#false} assume !false; {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 119: Hoare triple {220807#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 120: Hoare triple {220807#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 121: Hoare triple {220807#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 122: Hoare triple {220807#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 123: Hoare triple {220807#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 124: Hoare triple {220807#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 125: Hoare triple {220807#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 126: Hoare triple {220807#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 127: Hoare triple {220807#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 128: Hoare triple {220807#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 129: Hoare triple {220807#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 130: Hoare triple {220807#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 131: Hoare triple {220807#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 132: Hoare triple {220807#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,669 INFO L290 TraceCheckUtils]: 133: Hoare triple {220807#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 134: Hoare triple {220807#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 135: Hoare triple {220807#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 136: Hoare triple {220807#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 137: Hoare triple {220807#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 138: Hoare triple {220807#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 139: Hoare triple {220807#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 140: Hoare triple {220807#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 141: Hoare triple {220807#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 142: Hoare triple {220807#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 143: Hoare triple {220807#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 144: Hoare triple {220807#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 145: Hoare triple {220807#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 146: Hoare triple {220807#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 147: Hoare triple {220807#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220807#false} is VALID [2022-04-28 08:56:27,670 INFO L290 TraceCheckUtils]: 148: Hoare triple {220807#false} assume 8640 == #t~mem75;havoc #t~mem75; {220807#false} is VALID [2022-04-28 08:56:27,671 INFO L290 TraceCheckUtils]: 149: Hoare triple {220807#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {220807#false} is VALID [2022-04-28 08:56:27,671 INFO L290 TraceCheckUtils]: 150: Hoare triple {220807#false} assume !(4 == ~blastFlag~0); {220807#false} is VALID [2022-04-28 08:56:27,671 INFO L290 TraceCheckUtils]: 151: Hoare triple {220807#false} assume !(7 == ~blastFlag~0); {220807#false} is VALID [2022-04-28 08:56:27,671 INFO L290 TraceCheckUtils]: 152: Hoare triple {220807#false} assume !(10 == ~blastFlag~0); {220807#false} is VALID [2022-04-28 08:56:27,671 INFO L290 TraceCheckUtils]: 153: Hoare triple {220807#false} assume 13 == ~blastFlag~0; {220807#false} is VALID [2022-04-28 08:56:27,671 INFO L290 TraceCheckUtils]: 154: Hoare triple {220807#false} assume !false; {220807#false} is VALID [2022-04-28 08:56:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 08:56:27,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:56:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147012422] [2022-04-28 08:56:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147012422] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:27,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:27,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:56:27,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:56:27,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [705217714] [2022-04-28 08:56:27,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [705217714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:27,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:27,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:56:27,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868849530] [2022-04-28 08:56:27,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:56:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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 155 [2022-04-28 08:56:27,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:56:27,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-28 08:56:27,746 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-28 08:56:27,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:56:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:56:27,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:56:27,747 INFO L87 Difference]: Start difference. First operand 1225 states and 1829 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-28 08:56:34,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:56:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:40,203 INFO L93 Difference]: Finished difference Result 2070 states and 3104 transitions. [2022-04-28 08:56:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:56:40,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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 155 [2022-04-28 08:56:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:56:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-28 08:56:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2022-04-28 08:56:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-28 08:56:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2022-04-28 08:56:40,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 622 transitions. [2022-04-28 08:56:40,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:40,742 INFO L225 Difference]: With dead ends: 2070 [2022-04-28 08:56:40,742 INFO L226 Difference]: Without dead ends: 1644 [2022-04-28 08:56:40,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:56:40,743 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:56:40,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 586 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 08:56:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2022-04-28 08:56:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1644. [2022-04-28 08:56:40,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:56:40,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1644 states. Second operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:40,892 INFO L74 IsIncluded]: Start isIncluded. First operand 1644 states. Second operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:40,893 INFO L87 Difference]: Start difference. First operand 1644 states. Second operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:40,960 INFO L93 Difference]: Finished difference Result 1644 states and 2451 transitions. [2022-04-28 08:56:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2451 transitions. [2022-04-28 08:56:40,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:40,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:40,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1644 states. [2022-04-28 08:56:40,963 INFO L87 Difference]: Start difference. First operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1644 states. [2022-04-28 08:56:41,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:41,030 INFO L93 Difference]: Finished difference Result 1644 states and 2451 transitions. [2022-04-28 08:56:41,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2451 transitions. [2022-04-28 08:56:41,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:41,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:41,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:56:41,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:56:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1639 states have (on average 1.4929835265405735) internal successors, (2447), 1639 states have internal predecessors, (2447), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2451 transitions. [2022-04-28 08:56:41,137 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2451 transitions. Word has length 155 [2022-04-28 08:56:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:56:41,137 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 2451 transitions. [2022-04-28 08:56:41,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 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-28 08:56:41,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1644 states and 2451 transitions. [2022-04-28 08:56:46,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2451 edges. 2450 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2451 transitions. [2022-04-28 08:56:46,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 08:56:46,352 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:56:46,352 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-28 08:56:46,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-28 08:56:46,353 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:56:46,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:56:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1197677666, now seen corresponding path program 1 times [2022-04-28 08:56:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:46,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118472328] [2022-04-28 08:56:46,464 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:56:46,464 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:56:46,464 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:56:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1197677666, now seen corresponding path program 2 times [2022-04-28 08:56:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:56:46,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654696386] [2022-04-28 08:56:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:56:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:56:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:56:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:46,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {231537#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {231531#true} is VALID [2022-04-28 08:56:46,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {231531#true} assume true; {231531#true} is VALID [2022-04-28 08:56:46,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231531#true} {231531#true} #708#return; {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {231531#true} call ULTIMATE.init(); {231537#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:56:46,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {231537#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {231531#true} assume true; {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231531#true} {231531#true} #708#return; {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {231531#true} call #t~ret161 := main(); {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {231531#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; {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {231531#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L272 TraceCheckUtils]: 7: Hoare triple {231531#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {231531#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); {231531#true} is VALID [2022-04-28 08:56:46,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {231531#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; {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {231531#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; {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {231531#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {231531#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {231531#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {231531#true} assume !false; {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {231531#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); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {231531#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {231531#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {231531#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {231531#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {231531#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {231531#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {231531#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {231531#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {231531#true} assume 8464 == #t~mem55;havoc #t~mem55; {231531#true} is VALID [2022-04-28 08:56:46,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {231531#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; {231531#true} is VALID [2022-04-28 08:56:46,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {231531#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {231536#(= 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); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {231536#(= 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); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,639 INFO L290 TraceCheckUtils]: 29: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !false; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {231536#(= 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); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {231536#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {231536#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {231532#false} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 47: Hoare triple {231532#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {231532#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {231532#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 50: Hoare triple {231532#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 51: Hoare triple {231532#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231532#false} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 52: Hoare triple {231532#false} ~skip~0 := 0; {231532#false} is VALID [2022-04-28 08:56:46,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 54: Hoare triple {231532#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 55: Hoare triple {231532#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {231532#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {231532#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {231532#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 59: Hoare triple {231532#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 60: Hoare triple {231532#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 61: Hoare triple {231532#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 62: Hoare triple {231532#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {231532#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 64: Hoare triple {231532#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 65: Hoare triple {231532#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 66: Hoare triple {231532#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 67: Hoare triple {231532#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,644 INFO L290 TraceCheckUtils]: 68: Hoare triple {231532#false} assume 8512 == #t~mem60;havoc #t~mem60; {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 69: Hoare triple {231532#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); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 70: Hoare triple {231532#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 71: Hoare triple {231532#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 72: Hoare triple {231532#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 73: Hoare triple {231532#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 74: Hoare triple {231532#false} ~skip~0 := 0; {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 75: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 76: Hoare triple {231532#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 77: Hoare triple {231532#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 78: Hoare triple {231532#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 79: Hoare triple {231532#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 80: Hoare triple {231532#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 81: Hoare triple {231532#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 82: Hoare triple {231532#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,645 INFO L290 TraceCheckUtils]: 83: Hoare triple {231532#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 84: Hoare triple {231532#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 85: Hoare triple {231532#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 86: Hoare triple {231532#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 87: Hoare triple {231532#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 88: Hoare triple {231532#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 89: Hoare triple {231532#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 90: Hoare triple {231532#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 91: Hoare triple {231532#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 92: Hoare triple {231532#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 93: Hoare triple {231532#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 94: Hoare triple {231532#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 95: Hoare triple {231532#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 96: Hoare triple {231532#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 97: Hoare triple {231532#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 98: Hoare triple {231532#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,646 INFO L290 TraceCheckUtils]: 99: Hoare triple {231532#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 100: Hoare triple {231532#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 101: Hoare triple {231532#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 102: Hoare triple {231532#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 103: Hoare triple {231532#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 104: Hoare triple {231532#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 105: Hoare triple {231532#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 106: Hoare triple {231532#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 107: Hoare triple {231532#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 108: Hoare triple {231532#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 109: Hoare triple {231532#false} assume 8672 == #t~mem79;havoc #t~mem79; {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 110: Hoare triple {231532#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 111: Hoare triple {231532#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 112: Hoare triple {231532#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); {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 113: Hoare triple {231532#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; {231532#false} is VALID [2022-04-28 08:56:46,647 INFO L290 TraceCheckUtils]: 114: Hoare triple {231532#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 115: Hoare triple {231532#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 116: Hoare triple {231532#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 117: Hoare triple {231532#false} ~skip~0 := 0; {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 118: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 119: Hoare triple {231532#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 120: Hoare triple {231532#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 121: Hoare triple {231532#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 122: Hoare triple {231532#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 123: Hoare triple {231532#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 124: Hoare triple {231532#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 125: Hoare triple {231532#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 126: Hoare triple {231532#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 127: Hoare triple {231532#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,648 INFO L290 TraceCheckUtils]: 128: Hoare triple {231532#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 129: Hoare triple {231532#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 130: Hoare triple {231532#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 131: Hoare triple {231532#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 132: Hoare triple {231532#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 133: Hoare triple {231532#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 134: Hoare triple {231532#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 135: Hoare triple {231532#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 136: Hoare triple {231532#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 137: Hoare triple {231532#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 138: Hoare triple {231532#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 139: Hoare triple {231532#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 140: Hoare triple {231532#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 141: Hoare triple {231532#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 142: Hoare triple {231532#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,649 INFO L290 TraceCheckUtils]: 143: Hoare triple {231532#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 144: Hoare triple {231532#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 145: Hoare triple {231532#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 146: Hoare triple {231532#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 147: Hoare triple {231532#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 148: Hoare triple {231532#false} assume 8640 == #t~mem75;havoc #t~mem75; {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 149: Hoare triple {231532#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 150: Hoare triple {231532#false} assume !(4 == ~blastFlag~0); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 151: Hoare triple {231532#false} assume !(7 == ~blastFlag~0); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 152: Hoare triple {231532#false} assume !(10 == ~blastFlag~0); {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 153: Hoare triple {231532#false} assume 13 == ~blastFlag~0; {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L290 TraceCheckUtils]: 154: Hoare triple {231532#false} assume !false; {231532#false} is VALID [2022-04-28 08:56:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-28 08:56:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:56:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654696386] [2022-04-28 08:56:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654696386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:46,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:46,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:56:46,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:56:46,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118472328] [2022-04-28 08:56:46,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118472328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:46,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:46,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:56:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552250260] [2022-04-28 08:56:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:56:46,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 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 155 [2022-04-28 08:56:46,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:56:46,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 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-28 08:56:46,720 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-28 08:56:46,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:56:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:56:46,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:56:46,721 INFO L87 Difference]: Start difference. First operand 1644 states and 2451 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 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-28 08:56:48,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:56:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:52,547 INFO L93 Difference]: Finished difference Result 2516 states and 3752 transitions. [2022-04-28 08:56:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:56:52,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 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 155 [2022-04-28 08:56:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:56:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 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-28 08:56:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-28 08:56:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 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-28 08:56:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-04-28 08:56:52,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 464 transitions. [2022-04-28 08:56:52,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:52,933 INFO L225 Difference]: With dead ends: 2516 [2022-04-28 08:56:52,934 INFO L226 Difference]: Without dead ends: 1671 [2022-04-28 08:56:52,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:56:52,935 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 08:56:52,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 444 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 08:56:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-04-28 08:56:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2022-04-28 08:56:53,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:56:53,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1671 states. Second operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:53,053 INFO L74 IsIncluded]: Start isIncluded. First operand 1671 states. Second operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:53,054 INFO L87 Difference]: Start difference. First operand 1671 states. Second operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:53,121 INFO L93 Difference]: Finished difference Result 1671 states and 2486 transitions. [2022-04-28 08:56:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2486 transitions. [2022-04-28 08:56:53,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:53,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:53,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1671 states. [2022-04-28 08:56:53,125 INFO L87 Difference]: Start difference. First operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1671 states. [2022-04-28 08:56:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:56:53,218 INFO L93 Difference]: Finished difference Result 1671 states and 2486 transitions. [2022-04-28 08:56:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2486 transitions. [2022-04-28 08:56:53,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:56:53,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:56:53,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:56:53,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:56:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1666 states have (on average 1.489795918367347) internal successors, (2482), 1666 states have internal predecessors, (2482), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2486 transitions. [2022-04-28 08:56:53,326 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2486 transitions. Word has length 155 [2022-04-28 08:56:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:56:53,326 INFO L495 AbstractCegarLoop]: Abstraction has 1671 states and 2486 transitions. [2022-04-28 08:56:53,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 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-28 08:56:53,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1671 states and 2486 transitions. [2022-04-28 08:56:58,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2486 edges. 2485 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2486 transitions. [2022-04-28 08:56:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-04-28 08:56:58,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:56:58,337 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:56:58,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-28 08:56:58,337 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:56:58,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:56:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1776405232, now seen corresponding path program 1 times [2022-04-28 08:56:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:58,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2033802237] [2022-04-28 08:56:58,432 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:56:58,432 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:56:58,432 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:56:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1776405232, now seen corresponding path program 2 times [2022-04-28 08:56:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:56:58,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629134556] [2022-04-28 08:56:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:56:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:56:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:56:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:56:58,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {243262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {243256#true} is VALID [2022-04-28 08:56:58,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {243256#true} assume true; {243256#true} is VALID [2022-04-28 08:56:58,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243256#true} {243256#true} #708#return; {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {243256#true} call ULTIMATE.init(); {243262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:56:58,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {243262#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {243256#true} assume true; {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243256#true} {243256#true} #708#return; {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {243256#true} call #t~ret161 := main(); {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {243256#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; {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {243256#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L272 TraceCheckUtils]: 7: Hoare triple {243256#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {243256#true} is VALID [2022-04-28 08:56:58,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {243256#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; {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {243256#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; {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {243256#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {243256#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {243256#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {243256#true} assume 8464 == #t~mem55;havoc #t~mem55; {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {243256#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; {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {243256#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {243256#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {243256#true} ~skip~0 := 0; {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {243256#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {243256#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {243256#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {243256#true} assume 8496 == #t~mem58;havoc #t~mem58; {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 45: Hoare triple {243256#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {243256#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {243256#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {243256#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {243256#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {243256#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {243256#true} ~skip~0 := 0; {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-28 08:56:58,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 55: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 56: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 61: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 62: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 63: Hoare triple {243256#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 64: Hoare triple {243256#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 65: Hoare triple {243256#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 66: Hoare triple {243256#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 67: Hoare triple {243256#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 68: Hoare triple {243256#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 69: Hoare triple {243256#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {243256#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 71: Hoare triple {243256#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 72: Hoare triple {243256#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 73: Hoare triple {243256#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 74: Hoare triple {243256#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 75: Hoare triple {243256#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 76: Hoare triple {243256#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 77: Hoare triple {243256#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 78: Hoare triple {243256#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 79: Hoare triple {243256#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 80: Hoare triple {243256#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 81: Hoare triple {243256#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 82: Hoare triple {243256#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 83: Hoare triple {243256#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 84: Hoare triple {243256#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,699 INFO L290 TraceCheckUtils]: 85: Hoare triple {243256#true} assume 8656 == #t~mem77;havoc #t~mem77; {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 86: Hoare triple {243256#true} 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; {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 87: Hoare triple {243256#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 88: Hoare triple {243256#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 89: Hoare triple {243256#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 90: Hoare triple {243256#true} assume !(0 == ~tmp___10~0); {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 91: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 92: Hoare triple {243256#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 93: Hoare triple {243256#true} ~skip~0 := 0; {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 94: Hoare triple {243256#true} assume !false; {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 95: Hoare triple {243256#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); {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 96: Hoare triple {243256#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 97: Hoare triple {243256#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 98: Hoare triple {243256#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,700 INFO L290 TraceCheckUtils]: 99: Hoare triple {243256#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 100: Hoare triple {243256#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 101: Hoare triple {243256#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 102: Hoare triple {243256#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 103: Hoare triple {243256#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 104: Hoare triple {243256#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 105: Hoare triple {243256#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 106: Hoare triple {243256#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 107: Hoare triple {243256#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 108: Hoare triple {243256#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 109: Hoare triple {243256#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 110: Hoare triple {243256#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 111: Hoare triple {243256#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 112: Hoare triple {243256#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 113: Hoare triple {243256#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,701 INFO L290 TraceCheckUtils]: 114: Hoare triple {243256#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 115: Hoare triple {243256#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 116: Hoare triple {243256#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 117: Hoare triple {243256#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 118: Hoare triple {243256#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 119: Hoare triple {243256#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 120: Hoare triple {243256#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 121: Hoare triple {243256#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 122: Hoare triple {243256#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 123: Hoare triple {243256#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 124: Hoare triple {243256#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 125: Hoare triple {243256#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 126: Hoare triple {243256#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 127: Hoare triple {243256#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {243256#true} is VALID [2022-04-28 08:56:58,702 INFO L290 TraceCheckUtils]: 128: Hoare triple {243256#true} assume 8672 == #t~mem79;havoc #t~mem79; {243256#true} is VALID [2022-04-28 08:56:58,703 INFO L290 TraceCheckUtils]: 129: Hoare triple {243256#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {243256#true} is VALID [2022-04-28 08:56:58,703 INFO L290 TraceCheckUtils]: 130: Hoare triple {243256#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,703 INFO L290 TraceCheckUtils]: 131: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} 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); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,704 INFO L290 TraceCheckUtils]: 132: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} 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; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,704 INFO L290 TraceCheckUtils]: 133: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,704 INFO L290 TraceCheckUtils]: 134: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,705 INFO L290 TraceCheckUtils]: 135: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,705 INFO L290 TraceCheckUtils]: 136: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} ~skip~0 := 0; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,705 INFO L290 TraceCheckUtils]: 137: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !false; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,705 INFO L290 TraceCheckUtils]: 138: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,706 INFO L290 TraceCheckUtils]: 139: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,706 INFO L290 TraceCheckUtils]: 140: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,706 INFO L290 TraceCheckUtils]: 141: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,707 INFO L290 TraceCheckUtils]: 142: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,707 INFO L290 TraceCheckUtils]: 143: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,707 INFO L290 TraceCheckUtils]: 144: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,708 INFO L290 TraceCheckUtils]: 145: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,708 INFO L290 TraceCheckUtils]: 146: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,708 INFO L290 TraceCheckUtils]: 147: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,708 INFO L290 TraceCheckUtils]: 148: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,709 INFO L290 TraceCheckUtils]: 149: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,709 INFO L290 TraceCheckUtils]: 150: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,709 INFO L290 TraceCheckUtils]: 151: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,710 INFO L290 TraceCheckUtils]: 152: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,710 INFO L290 TraceCheckUtils]: 153: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,710 INFO L290 TraceCheckUtils]: 154: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,711 INFO L290 TraceCheckUtils]: 155: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,711 INFO L290 TraceCheckUtils]: 156: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,711 INFO L290 TraceCheckUtils]: 157: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,711 INFO L290 TraceCheckUtils]: 158: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,712 INFO L290 TraceCheckUtils]: 159: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,712 INFO L290 TraceCheckUtils]: 160: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,712 INFO L290 TraceCheckUtils]: 161: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,713 INFO L290 TraceCheckUtils]: 162: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,713 INFO L290 TraceCheckUtils]: 163: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,713 INFO L290 TraceCheckUtils]: 164: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,713 INFO L290 TraceCheckUtils]: 165: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,714 INFO L290 TraceCheckUtils]: 166: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,714 INFO L290 TraceCheckUtils]: 167: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume 8640 == #t~mem75;havoc #t~mem75; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,714 INFO L290 TraceCheckUtils]: 168: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {243261#(= ssl3_accept_~blastFlag~0 4)} is VALID [2022-04-28 08:56:58,715 INFO L290 TraceCheckUtils]: 169: Hoare triple {243261#(= ssl3_accept_~blastFlag~0 4)} assume !(4 == ~blastFlag~0); {243257#false} is VALID [2022-04-28 08:56:58,715 INFO L290 TraceCheckUtils]: 170: Hoare triple {243257#false} assume !(7 == ~blastFlag~0); {243257#false} is VALID [2022-04-28 08:56:58,715 INFO L290 TraceCheckUtils]: 171: Hoare triple {243257#false} assume !(10 == ~blastFlag~0); {243257#false} is VALID [2022-04-28 08:56:58,715 INFO L290 TraceCheckUtils]: 172: Hoare triple {243257#false} assume 13 == ~blastFlag~0; {243257#false} is VALID [2022-04-28 08:56:58,715 INFO L290 TraceCheckUtils]: 173: Hoare triple {243257#false} assume !false; {243257#false} is VALID [2022-04-28 08:56:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-28 08:56:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:56:58,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629134556] [2022-04-28 08:56:58,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629134556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:58,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:58,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:56:58,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:56:58,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2033802237] [2022-04-28 08:56:58,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2033802237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:56:58,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:56:58,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:56:58,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340301698] [2022-04-28 08:56:58,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:56:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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 174 [2022-04-28 08:56:58,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:56:58,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:56:58,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:56:58,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:56:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:56:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:56:58,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:56:58,791 INFO L87 Difference]: Start difference. First operand 1671 states and 2486 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:03,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:57:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:57:10,667 INFO L93 Difference]: Finished difference Result 2960 states and 4415 transitions. [2022-04-28 08:57:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:57:10,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 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 174 [2022-04-28 08:57:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:57:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-28 08:57:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-28 08:57:10,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 620 transitions. [2022-04-28 08:57:11,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:57:11,252 INFO L225 Difference]: With dead ends: 2960 [2022-04-28 08:57:11,252 INFO L226 Difference]: Without dead ends: 2088 [2022-04-28 08:57:11,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:57:11,254 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 143 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:57:11,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 584 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-28 08:57:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2022-04-28 08:57:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2022-04-28 08:57:11,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:57:11,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2088 states. Second operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:11,403 INFO L74 IsIncluded]: Start isIncluded. First operand 2088 states. Second operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:11,404 INFO L87 Difference]: Start difference. First operand 2088 states. Second operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:57:11,508 INFO L93 Difference]: Finished difference Result 2088 states and 3105 transitions. [2022-04-28 08:57:11,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3105 transitions. [2022-04-28 08:57:11,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:57:11,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:57:11,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2088 states. [2022-04-28 08:57:11,512 INFO L87 Difference]: Start difference. First operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2088 states. [2022-04-28 08:57:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:57:11,614 INFO L93 Difference]: Finished difference Result 2088 states and 3105 transitions. [2022-04-28 08:57:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3105 transitions. [2022-04-28 08:57:11,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:57:11,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:57:11,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:57:11,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:57:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2083 states have (on average 1.4887181949111858) internal successors, (3101), 2083 states have internal predecessors, (3101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3105 transitions. [2022-04-28 08:57:11,778 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3105 transitions. Word has length 174 [2022-04-28 08:57:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:57:11,778 INFO L495 AbstractCegarLoop]: Abstraction has 2088 states and 3105 transitions. [2022-04-28 08:57:11,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:11,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2088 states and 3105 transitions. [2022-04-28 08:57:17,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3105 edges. 3104 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:57:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3105 transitions. [2022-04-28 08:57:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 08:57:17,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:57:17,419 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:57:17,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-28 08:57:17,419 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:57:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:57:17,419 INFO L85 PathProgramCache]: Analyzing trace with hash -309724723, now seen corresponding path program 1 times [2022-04-28 08:57:17,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:57:17,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466315942] [2022-04-28 08:57:17,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:57:17,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 08:57:17,538 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:57:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash -309724723, now seen corresponding path program 2 times [2022-04-28 08:57:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:57:17,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460485544] [2022-04-28 08:57:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:57:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:57:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:57:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:57:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:57:17,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {257543#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {257537#true} is VALID [2022-04-28 08:57:17,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {257537#true} assume true; {257537#true} is VALID [2022-04-28 08:57:17,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257537#true} {257537#true} #708#return; {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {257537#true} call ULTIMATE.init(); {257543#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {257543#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {257537#true} assume true; {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257537#true} {257537#true} #708#return; {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {257537#true} call #t~ret161 := main(); {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {257537#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; {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {257537#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L272 TraceCheckUtils]: 7: Hoare triple {257537#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {257537#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); {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {257537#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; {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {257537#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; {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {257537#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {257537#true} is VALID [2022-04-28 08:57:17,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {257537#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {257537#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {257537#true} assume !false; {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {257537#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); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {257537#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {257537#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {257537#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {257537#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {257537#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {257537#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {257537#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {257537#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {257537#true} assume 8464 == #t~mem55;havoc #t~mem55; {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {257537#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; {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {257537#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {257537#true} is VALID [2022-04-28 08:57:17,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {257537#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); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {257537#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); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {257537#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {257537#true} ~skip~0 := 0; {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {257537#true} assume !false; {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {257537#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); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {257537#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {257537#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {257537#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {257537#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 37: Hoare triple {257537#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 38: Hoare triple {257537#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {257537#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 40: Hoare triple {257537#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 41: Hoare triple {257537#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,703 INFO L290 TraceCheckUtils]: 42: Hoare triple {257537#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {257537#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {257537#true} assume 8496 == #t~mem58;havoc #t~mem58; {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 45: Hoare triple {257537#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {257537#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 47: Hoare triple {257537#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {257537#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {257537#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {257537#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); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 51: Hoare triple {257537#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 52: Hoare triple {257537#true} ~skip~0 := 0; {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 53: Hoare triple {257537#true} assume !false; {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {257537#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); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 55: Hoare triple {257537#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 56: Hoare triple {257537#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {257537#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {257537#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 59: Hoare triple {257537#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {257537#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {257537#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {257537#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 63: Hoare triple {257537#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 64: Hoare triple {257537#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {257537#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {257537#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {257537#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {257537#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {257537#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 70: Hoare triple {257537#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {257537#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {257537#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {257537#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 74: Hoare triple {257537#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 75: Hoare triple {257537#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 76: Hoare triple {257537#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 77: Hoare triple {257537#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {257537#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 79: Hoare triple {257537#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {257537#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 81: Hoare triple {257537#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 82: Hoare triple {257537#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 83: Hoare triple {257537#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 84: Hoare triple {257537#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 85: Hoare triple {257537#true} assume 8656 == #t~mem77;havoc #t~mem77; {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 86: Hoare triple {257537#true} 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; {257537#true} is VALID [2022-04-28 08:57:17,706 INFO L290 TraceCheckUtils]: 87: Hoare triple {257537#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {257537#true} is VALID [2022-04-28 08:57:17,707 INFO L290 TraceCheckUtils]: 88: Hoare triple {257537#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,707 INFO L290 TraceCheckUtils]: 89: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,707 INFO L290 TraceCheckUtils]: 90: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___10~0); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {257542#(= 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); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,708 INFO L290 TraceCheckUtils]: 92: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,708 INFO L290 TraceCheckUtils]: 93: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,708 INFO L290 TraceCheckUtils]: 94: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,708 INFO L290 TraceCheckUtils]: 95: Hoare triple {257542#(= 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); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,709 INFO L290 TraceCheckUtils]: 96: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,709 INFO L290 TraceCheckUtils]: 97: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,709 INFO L290 TraceCheckUtils]: 98: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,710 INFO L290 TraceCheckUtils]: 99: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,710 INFO L290 TraceCheckUtils]: 100: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,710 INFO L290 TraceCheckUtils]: 101: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,710 INFO L290 TraceCheckUtils]: 102: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,711 INFO L290 TraceCheckUtils]: 103: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,711 INFO L290 TraceCheckUtils]: 104: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,711 INFO L290 TraceCheckUtils]: 105: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,711 INFO L290 TraceCheckUtils]: 106: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,712 INFO L290 TraceCheckUtils]: 107: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,712 INFO L290 TraceCheckUtils]: 108: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,712 INFO L290 TraceCheckUtils]: 109: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,712 INFO L290 TraceCheckUtils]: 110: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,713 INFO L290 TraceCheckUtils]: 111: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,713 INFO L290 TraceCheckUtils]: 112: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,713 INFO L290 TraceCheckUtils]: 113: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,713 INFO L290 TraceCheckUtils]: 114: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,714 INFO L290 TraceCheckUtils]: 115: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,714 INFO L290 TraceCheckUtils]: 116: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,714 INFO L290 TraceCheckUtils]: 117: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,715 INFO L290 TraceCheckUtils]: 118: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,715 INFO L290 TraceCheckUtils]: 119: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,715 INFO L290 TraceCheckUtils]: 120: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,715 INFO L290 TraceCheckUtils]: 121: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,716 INFO L290 TraceCheckUtils]: 122: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,716 INFO L290 TraceCheckUtils]: 123: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,716 INFO L290 TraceCheckUtils]: 124: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,716 INFO L290 TraceCheckUtils]: 125: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,717 INFO L290 TraceCheckUtils]: 126: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,717 INFO L290 TraceCheckUtils]: 127: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,717 INFO L290 TraceCheckUtils]: 128: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume 8672 == #t~mem79;havoc #t~mem79; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,717 INFO L290 TraceCheckUtils]: 129: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {257542#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 130: Hoare triple {257542#(= 3 ssl3_accept_~blastFlag~0)} assume !(3 == ~blastFlag~0); {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 131: Hoare triple {257538#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 132: Hoare triple {257538#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); {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 133: Hoare triple {257538#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; {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 134: Hoare triple {257538#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 135: Hoare triple {257538#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 136: Hoare triple {257538#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 137: Hoare triple {257538#false} ~skip~0 := 0; {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 138: Hoare triple {257538#false} assume !false; {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 139: Hoare triple {257538#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 140: Hoare triple {257538#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,718 INFO L290 TraceCheckUtils]: 141: Hoare triple {257538#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 142: Hoare triple {257538#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 143: Hoare triple {257538#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 144: Hoare triple {257538#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 145: Hoare triple {257538#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 146: Hoare triple {257538#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 147: Hoare triple {257538#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 148: Hoare triple {257538#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 149: Hoare triple {257538#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 150: Hoare triple {257538#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 151: Hoare triple {257538#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 152: Hoare triple {257538#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 153: Hoare triple {257538#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 154: Hoare triple {257538#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 155: Hoare triple {257538#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,719 INFO L290 TraceCheckUtils]: 156: Hoare triple {257538#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 157: Hoare triple {257538#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 158: Hoare triple {257538#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 159: Hoare triple {257538#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 160: Hoare triple {257538#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 161: Hoare triple {257538#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 162: Hoare triple {257538#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 163: Hoare triple {257538#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 164: Hoare triple {257538#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 165: Hoare triple {257538#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 166: Hoare triple {257538#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 167: Hoare triple {257538#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 168: Hoare triple {257538#false} assume 8640 == #t~mem75;havoc #t~mem75; {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 169: Hoare triple {257538#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 170: Hoare triple {257538#false} assume !(4 == ~blastFlag~0); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 171: Hoare triple {257538#false} assume !(7 == ~blastFlag~0); {257538#false} is VALID [2022-04-28 08:57:17,720 INFO L290 TraceCheckUtils]: 172: Hoare triple {257538#false} assume !(10 == ~blastFlag~0); {257538#false} is VALID [2022-04-28 08:57:17,721 INFO L290 TraceCheckUtils]: 173: Hoare triple {257538#false} assume 13 == ~blastFlag~0; {257538#false} is VALID [2022-04-28 08:57:17,721 INFO L290 TraceCheckUtils]: 174: Hoare triple {257538#false} assume !false; {257538#false} is VALID [2022-04-28 08:57:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 08:57:17,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:57:17,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460485544] [2022-04-28 08:57:17,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460485544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:57:17,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:57:17,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:57:17,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:57:17,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466315942] [2022-04-28 08:57:17,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466315942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:57:17,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:57:17,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:57:17,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087194899] [2022-04-28 08:57:17,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:57:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 08:57:17,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:57:17,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:17,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:57:17,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:57:17,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:57:17,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:57:17,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:57:17,818 INFO L87 Difference]: Start difference. First operand 2088 states and 3105 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:19,875 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:57:25,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:57:25,703 INFO L93 Difference]: Finished difference Result 3762 states and 5603 transitions. [2022-04-28 08:57:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:57:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 175 [2022-04-28 08:57:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:57:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-28 08:57:25,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:25,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2022-04-28 08:57:25,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 620 transitions. [2022-04-28 08:57:26,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 620 edges. 620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:57:26,306 INFO L225 Difference]: With dead ends: 3762 [2022-04-28 08:57:26,306 INFO L226 Difference]: Without dead ends: 2473 [2022-04-28 08:57:26,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:57:26,308 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 140 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:57:26,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 584 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 440 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 08:57:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2022-04-28 08:57:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2473. [2022-04-28 08:57:26,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:57:26,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2473 states. Second operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:26,484 INFO L74 IsIncluded]: Start isIncluded. First operand 2473 states. Second operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:26,487 INFO L87 Difference]: Start difference. First operand 2473 states. Second operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:57:26,629 INFO L93 Difference]: Finished difference Result 2473 states and 3674 transitions. [2022-04-28 08:57:26,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3674 transitions. [2022-04-28 08:57:26,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:57:26,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:57:26,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2473 states. [2022-04-28 08:57:26,634 INFO L87 Difference]: Start difference. First operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2473 states. [2022-04-28 08:57:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:57:26,777 INFO L93 Difference]: Finished difference Result 2473 states and 3674 transitions. [2022-04-28 08:57:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3674 transitions. [2022-04-28 08:57:26,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:57:26,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:57:26,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:57:26,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:57:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2468 states have (on average 1.487034035656402) internal successors, (3670), 2468 states have internal predecessors, (3670), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3674 transitions. [2022-04-28 08:57:27,035 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3674 transitions. Word has length 175 [2022-04-28 08:57:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:57:27,035 INFO L495 AbstractCegarLoop]: Abstraction has 2473 states and 3674 transitions. [2022-04-28 08:57:27,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:57:27,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2473 states and 3674 transitions. [2022-04-28 08:57:33,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3674 edges. 3673 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:57:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3674 transitions. [2022-04-28 08:57:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-04-28 08:57:33,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:57:33,309 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:57:33,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 08:57:33,309 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:57:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:57:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1233357362, now seen corresponding path program 1 times [2022-04-28 08:57:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:57:33,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1482544436] [2022-04-28 08:58:05,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:58:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1233357362, now seen corresponding path program 2 times [2022-04-28 08:58:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:58:05,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321645782] [2022-04-28 08:58:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:58:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:58:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:58:05,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:58:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:58:05,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {274968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {274962#true} is VALID [2022-04-28 08:58:05,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {274962#true} assume true; {274962#true} is VALID [2022-04-28 08:58:05,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274962#true} {274962#true} #708#return; {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {274962#true} call ULTIMATE.init(); {274968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:58:05,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {274968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {274962#true} assume true; {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274962#true} {274962#true} #708#return; {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {274962#true} call #t~ret161 := main(); {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {274962#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; {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {274962#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L272 TraceCheckUtils]: 7: Hoare triple {274962#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {274962#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; {274962#true} is VALID [2022-04-28 08:58:05,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {274962#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; {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {274962#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {274962#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {274962#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {274962#true} assume 8464 == #t~mem55;havoc #t~mem55; {274962#true} is VALID [2022-04-28 08:58:05,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {274962#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; {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {274962#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 37: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 38: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 39: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,868 INFO L290 TraceCheckUtils]: 40: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {274962#true} assume 8496 == #t~mem58;havoc #t~mem58; {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {274962#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 46: Hoare triple {274962#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {274962#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {274962#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {274962#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 50: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 55: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,869 INFO L290 TraceCheckUtils]: 56: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 58: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 59: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 60: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 61: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 62: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 65: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 66: Hoare triple {274962#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 67: Hoare triple {274962#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 68: Hoare triple {274962#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 69: Hoare triple {274962#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 70: Hoare triple {274962#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,870 INFO L290 TraceCheckUtils]: 71: Hoare triple {274962#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 72: Hoare triple {274962#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 73: Hoare triple {274962#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 74: Hoare triple {274962#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {274962#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 76: Hoare triple {274962#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 77: Hoare triple {274962#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 78: Hoare triple {274962#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 79: Hoare triple {274962#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 80: Hoare triple {274962#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 81: Hoare triple {274962#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 82: Hoare triple {274962#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 83: Hoare triple {274962#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 84: Hoare triple {274962#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 85: Hoare triple {274962#true} assume 8656 == #t~mem77;havoc #t~mem77; {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 86: Hoare triple {274962#true} 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; {274962#true} is VALID [2022-04-28 08:58:05,871 INFO L290 TraceCheckUtils]: 87: Hoare triple {274962#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 88: Hoare triple {274962#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {274962#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {274962#true} assume !(0 == ~tmp___10~0); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 91: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 92: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 93: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 94: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 95: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 96: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 97: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 98: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 99: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 100: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 101: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,872 INFO L290 TraceCheckUtils]: 102: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 103: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 104: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 105: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 106: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 107: Hoare triple {274962#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 108: Hoare triple {274962#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 109: Hoare triple {274962#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 110: Hoare triple {274962#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 111: Hoare triple {274962#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 112: Hoare triple {274962#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 113: Hoare triple {274962#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 114: Hoare triple {274962#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 115: Hoare triple {274962#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 116: Hoare triple {274962#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 117: Hoare triple {274962#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,873 INFO L290 TraceCheckUtils]: 118: Hoare triple {274962#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 119: Hoare triple {274962#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 120: Hoare triple {274962#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 121: Hoare triple {274962#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 122: Hoare triple {274962#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 123: Hoare triple {274962#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 124: Hoare triple {274962#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 125: Hoare triple {274962#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 126: Hoare triple {274962#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 127: Hoare triple {274962#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 128: Hoare triple {274962#true} assume 8672 == #t~mem79;havoc #t~mem79; {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 129: Hoare triple {274962#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 130: Hoare triple {274962#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 131: Hoare triple {274962#true} 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); {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 132: Hoare triple {274962#true} 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; {274962#true} is VALID [2022-04-28 08:58:05,874 INFO L290 TraceCheckUtils]: 133: Hoare triple {274962#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 134: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 135: Hoare triple {274962#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 136: Hoare triple {274962#true} ~skip~0 := 0; {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 137: Hoare triple {274962#true} assume !false; {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 138: Hoare triple {274962#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); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 139: Hoare triple {274962#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 140: Hoare triple {274962#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 141: Hoare triple {274962#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 142: Hoare triple {274962#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 143: Hoare triple {274962#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 144: Hoare triple {274962#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 145: Hoare triple {274962#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 146: Hoare triple {274962#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,875 INFO L290 TraceCheckUtils]: 147: Hoare triple {274962#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 148: Hoare triple {274962#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 149: Hoare triple {274962#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 150: Hoare triple {274962#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 151: Hoare triple {274962#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 152: Hoare triple {274962#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 153: Hoare triple {274962#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 154: Hoare triple {274962#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 155: Hoare triple {274962#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 156: Hoare triple {274962#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 157: Hoare triple {274962#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 158: Hoare triple {274962#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 159: Hoare triple {274962#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 160: Hoare triple {274962#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 161: Hoare triple {274962#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,876 INFO L290 TraceCheckUtils]: 162: Hoare triple {274962#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,877 INFO L290 TraceCheckUtils]: 163: Hoare triple {274962#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,877 INFO L290 TraceCheckUtils]: 164: Hoare triple {274962#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,877 INFO L290 TraceCheckUtils]: 165: Hoare triple {274962#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,877 INFO L290 TraceCheckUtils]: 166: Hoare triple {274962#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274962#true} is VALID [2022-04-28 08:58:05,877 INFO L290 TraceCheckUtils]: 167: Hoare triple {274962#true} assume 8640 == #t~mem75;havoc #t~mem75; {274962#true} is VALID [2022-04-28 08:58:05,877 INFO L290 TraceCheckUtils]: 168: Hoare triple {274962#true} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {274962#true} is VALID [2022-04-28 08:58:05,877 INFO L290 TraceCheckUtils]: 169: Hoare triple {274962#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,878 INFO L290 TraceCheckUtils]: 170: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(~ret~0 <= 0);call #t~mem139 := read~int(~s.base, 92 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,878 INFO L290 TraceCheckUtils]: 171: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume 0 != #t~mem139;havoc #t~mem139;call write~int(3, ~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,878 INFO L290 TraceCheckUtils]: 172: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,878 INFO L290 TraceCheckUtils]: 173: Hoare triple {274967#(<= 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); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,879 INFO L290 TraceCheckUtils]: 174: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,879 INFO L290 TraceCheckUtils]: 175: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,879 INFO L290 TraceCheckUtils]: 176: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,880 INFO L290 TraceCheckUtils]: 177: Hoare triple {274967#(<= 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); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,880 INFO L290 TraceCheckUtils]: 178: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,880 INFO L290 TraceCheckUtils]: 179: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,881 INFO L290 TraceCheckUtils]: 180: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,881 INFO L290 TraceCheckUtils]: 181: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,881 INFO L290 TraceCheckUtils]: 182: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,881 INFO L290 TraceCheckUtils]: 183: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,882 INFO L290 TraceCheckUtils]: 184: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,882 INFO L290 TraceCheckUtils]: 185: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,882 INFO L290 TraceCheckUtils]: 186: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,883 INFO L290 TraceCheckUtils]: 187: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,883 INFO L290 TraceCheckUtils]: 188: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,883 INFO L290 TraceCheckUtils]: 189: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,884 INFO L290 TraceCheckUtils]: 190: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,884 INFO L290 TraceCheckUtils]: 191: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,884 INFO L290 TraceCheckUtils]: 192: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,885 INFO L290 TraceCheckUtils]: 193: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,885 INFO L290 TraceCheckUtils]: 194: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,885 INFO L290 TraceCheckUtils]: 195: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,885 INFO L290 TraceCheckUtils]: 196: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,886 INFO L290 TraceCheckUtils]: 197: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,886 INFO L290 TraceCheckUtils]: 198: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,886 INFO L290 TraceCheckUtils]: 199: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,886 INFO L290 TraceCheckUtils]: 200: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,887 INFO L290 TraceCheckUtils]: 201: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,887 INFO L290 TraceCheckUtils]: 202: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,887 INFO L290 TraceCheckUtils]: 203: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,888 INFO L290 TraceCheckUtils]: 204: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,888 INFO L290 TraceCheckUtils]: 205: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,888 INFO L290 TraceCheckUtils]: 206: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,888 INFO L290 TraceCheckUtils]: 207: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,889 INFO L290 TraceCheckUtils]: 208: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,889 INFO L290 TraceCheckUtils]: 209: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,889 INFO L290 TraceCheckUtils]: 210: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume 8672 == #t~mem79;havoc #t~mem79; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,889 INFO L290 TraceCheckUtils]: 211: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 212: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume !(3 == ~blastFlag~0); {274967#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 213: Hoare triple {274967#(<= ssl3_accept_~blastFlag~0 5)} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {274963#false} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 214: Hoare triple {274963#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); {274963#false} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 215: Hoare triple {274963#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; {274963#false} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 216: Hoare triple {274963#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 217: Hoare triple {274963#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 218: Hoare triple {274963#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {274963#false} is VALID [2022-04-28 08:58:05,890 INFO L290 TraceCheckUtils]: 219: Hoare triple {274963#false} ~skip~0 := 0; {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 220: Hoare triple {274963#false} assume !false; {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 221: Hoare triple {274963#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 222: Hoare triple {274963#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 223: Hoare triple {274963#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 224: Hoare triple {274963#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 225: Hoare triple {274963#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 226: Hoare triple {274963#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 227: Hoare triple {274963#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 228: Hoare triple {274963#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 229: Hoare triple {274963#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 230: Hoare triple {274963#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 231: Hoare triple {274963#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 232: Hoare triple {274963#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 233: Hoare triple {274963#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,891 INFO L290 TraceCheckUtils]: 234: Hoare triple {274963#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 235: Hoare triple {274963#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 236: Hoare triple {274963#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 237: Hoare triple {274963#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 238: Hoare triple {274963#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 239: Hoare triple {274963#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 240: Hoare triple {274963#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 241: Hoare triple {274963#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 242: Hoare triple {274963#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 243: Hoare triple {274963#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 244: Hoare triple {274963#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 245: Hoare triple {274963#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 246: Hoare triple {274963#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 247: Hoare triple {274963#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 248: Hoare triple {274963#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 249: Hoare triple {274963#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {274963#false} is VALID [2022-04-28 08:58:05,892 INFO L290 TraceCheckUtils]: 250: Hoare triple {274963#false} assume 8640 == #t~mem75;havoc #t~mem75; {274963#false} is VALID [2022-04-28 08:58:05,893 INFO L290 TraceCheckUtils]: 251: Hoare triple {274963#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {274963#false} is VALID [2022-04-28 08:58:05,893 INFO L290 TraceCheckUtils]: 252: Hoare triple {274963#false} assume !(4 == ~blastFlag~0); {274963#false} is VALID [2022-04-28 08:58:05,893 INFO L290 TraceCheckUtils]: 253: Hoare triple {274963#false} assume !(7 == ~blastFlag~0); {274963#false} is VALID [2022-04-28 08:58:05,893 INFO L290 TraceCheckUtils]: 254: Hoare triple {274963#false} assume !(10 == ~blastFlag~0); {274963#false} is VALID [2022-04-28 08:58:05,893 INFO L290 TraceCheckUtils]: 255: Hoare triple {274963#false} assume 13 == ~blastFlag~0; {274963#false} is VALID [2022-04-28 08:58:05,893 INFO L290 TraceCheckUtils]: 256: Hoare triple {274963#false} assume !false; {274963#false} is VALID [2022-04-28 08:58:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-04-28 08:58:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:58:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321645782] [2022-04-28 08:58:05,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321645782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:58:05,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:58:05,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:58:05,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:58:05,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1482544436] [2022-04-28 08:58:05,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1482544436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:58:05,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:58:05,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:58:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422215413] [2022-04-28 08:58:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:58:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 257 [2022-04-28 08:58:05,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:58:05,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:06,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:58:06,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:58:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:58:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:58:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:58:06,003 INFO L87 Difference]: Start difference. First operand 2473 states and 3674 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:08,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:58:11,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:58:14,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-28 08:58:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:58:19,892 INFO L93 Difference]: Finished difference Result 4571 states and 6802 transitions. [2022-04-28 08:58:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:58:19,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 257 [2022-04-28 08:58:19,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:58:19,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2022-04-28 08:58:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2022-04-28 08:58:19,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 630 transitions. [2022-04-28 08:58:20,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 630 edges. 630 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:58:20,594 INFO L225 Difference]: With dead ends: 4571 [2022-04-28 08:58:20,594 INFO L226 Difference]: Without dead ends: 2897 [2022-04-28 08:58:20,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:58:20,596 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-28 08:58:20,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 385 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-28 08:58:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-04-28 08:58:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2897. [2022-04-28 08:58:21,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:58:21,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2897 states. Second operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:21,705 INFO L74 IsIncluded]: Start isIncluded. First operand 2897 states. Second operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:21,707 INFO L87 Difference]: Start difference. First operand 2897 states. Second operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:58:21,901 INFO L93 Difference]: Finished difference Result 2897 states and 4307 transitions. [2022-04-28 08:58:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4307 transitions. [2022-04-28 08:58:21,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:58:21,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:58:21,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2897 states. [2022-04-28 08:58:21,905 INFO L87 Difference]: Start difference. First operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2897 states. [2022-04-28 08:58:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:58:22,100 INFO L93 Difference]: Finished difference Result 2897 states and 4307 transitions. [2022-04-28 08:58:22,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4307 transitions. [2022-04-28 08:58:22,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:58:22,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:58:22,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:58:22,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:58:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2892 states have (on average 1.4878976486860305) internal successors, (4303), 2892 states have internal predecessors, (4303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4307 transitions. [2022-04-28 08:58:22,453 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4307 transitions. Word has length 257 [2022-04-28 08:58:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:58:22,454 INFO L495 AbstractCegarLoop]: Abstraction has 2897 states and 4307 transitions. [2022-04-28 08:58:22,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:58:22,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2897 states and 4307 transitions. [2022-04-28 08:58:29,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4307 edges. 4306 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:58:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4307 transitions. [2022-04-28 08:58:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-04-28 08:58:29,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:58:29,419 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:58:29,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-28 08:58:29,420 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:58:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:58:29,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1515482758, now seen corresponding path program 1 times [2022-04-28 08:58:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:58:29,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050154553] [2022-04-28 08:58:40,184 WARN L232 SmtUtils]: Spent 7.37s on a formula simplification. DAG size of input: 467 DAG size of output: 312 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-28 08:59:25,581 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 08:59:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1515482758, now seen corresponding path program 2 times [2022-04-28 08:59:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:59:25,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226217878] [2022-04-28 08:59:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:59:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:59:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:59:25,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:59:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:59:25,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {295708#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {295701#true} is VALID [2022-04-28 08:59:25,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {295701#true} assume true; {295701#true} is VALID [2022-04-28 08:59:25,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {295701#true} {295701#true} #708#return; {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {295701#true} call ULTIMATE.init(); {295708#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {295708#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {295701#true} assume true; {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295701#true} {295701#true} #708#return; {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {295701#true} call #t~ret161 := main(); {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {295701#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; {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {295701#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L272 TraceCheckUtils]: 7: Hoare triple {295701#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {295701#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; {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {295701#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; {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {295701#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {295701#true} is VALID [2022-04-28 08:59:25,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {295701#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {295701#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {295701#true} assume !false; {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {295701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {295701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {295701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {295701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {295701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {295701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {295701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {295701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {295701#true} assume 8464 == #t~mem55;havoc #t~mem55; {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 25: Hoare triple {295701#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; {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {295701#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {295701#true} is VALID [2022-04-28 08:59:25,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {295701#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {295701#true} ~skip~0 := 0; {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {295701#true} assume !false; {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {295701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {295701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 35: Hoare triple {295701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {295701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {295701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {295701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {295701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {295701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {295701#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,862 INFO L290 TraceCheckUtils]: 42: Hoare triple {295701#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {295701#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {295701#true} assume 8496 == #t~mem58;havoc #t~mem58; {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {295701#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 46: Hoare triple {295701#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {295701#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {295701#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {295701#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 51: Hoare triple {295701#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 52: Hoare triple {295701#true} ~skip~0 := 0; {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {295701#true} assume !false; {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {295701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {295701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {295701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {295701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {295701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {295701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {295701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 62: Hoare triple {295701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {295701#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {295701#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 65: Hoare triple {295701#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {295701#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {295701#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 68: Hoare triple {295701#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {295701#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {295701#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {295701#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 72: Hoare triple {295701#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,864 INFO L290 TraceCheckUtils]: 73: Hoare triple {295701#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {295701#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 75: Hoare triple {295701#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {295701#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {295701#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {295701#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {295701#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {295701#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {295701#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 82: Hoare triple {295701#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {295701#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 84: Hoare triple {295701#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 85: Hoare triple {295701#true} assume 8656 == #t~mem77;havoc #t~mem77; {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 86: Hoare triple {295701#true} 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; {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 87: Hoare triple {295701#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {295701#true} is VALID [2022-04-28 08:59:25,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {295701#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 89: Hoare triple {295701#true} assume !(~ret~0 <= 0);call write~int(8672, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 90: Hoare triple {295701#true} assume !(0 == ~tmp___10~0); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 91: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 92: Hoare triple {295701#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 93: Hoare triple {295701#true} ~skip~0 := 0; {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 94: Hoare triple {295701#true} assume !false; {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 95: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 96: Hoare triple {295701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 97: Hoare triple {295701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 98: Hoare triple {295701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 99: Hoare triple {295701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 100: Hoare triple {295701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 101: Hoare triple {295701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 102: Hoare triple {295701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 103: Hoare triple {295701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,866 INFO L290 TraceCheckUtils]: 104: Hoare triple {295701#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 105: Hoare triple {295701#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 106: Hoare triple {295701#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 107: Hoare triple {295701#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 108: Hoare triple {295701#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 109: Hoare triple {295701#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 110: Hoare triple {295701#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 111: Hoare triple {295701#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 112: Hoare triple {295701#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 113: Hoare triple {295701#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 114: Hoare triple {295701#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 115: Hoare triple {295701#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 116: Hoare triple {295701#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 117: Hoare triple {295701#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 118: Hoare triple {295701#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,867 INFO L290 TraceCheckUtils]: 119: Hoare triple {295701#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 120: Hoare triple {295701#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 121: Hoare triple {295701#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 122: Hoare triple {295701#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 123: Hoare triple {295701#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 124: Hoare triple {295701#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 125: Hoare triple {295701#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 126: Hoare triple {295701#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 127: Hoare triple {295701#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 128: Hoare triple {295701#true} assume 8672 == #t~mem79;havoc #t~mem79; {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 129: Hoare triple {295701#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 130: Hoare triple {295701#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 131: Hoare triple {295701#true} 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); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 132: Hoare triple {295701#true} 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; {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 133: Hoare triple {295701#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,868 INFO L290 TraceCheckUtils]: 134: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 135: Hoare triple {295701#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 136: Hoare triple {295701#true} ~skip~0 := 0; {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 137: Hoare triple {295701#true} assume !false; {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 138: Hoare triple {295701#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); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 139: Hoare triple {295701#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 140: Hoare triple {295701#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 141: Hoare triple {295701#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 142: Hoare triple {295701#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 143: Hoare triple {295701#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 144: Hoare triple {295701#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 145: Hoare triple {295701#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 146: Hoare triple {295701#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 147: Hoare triple {295701#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 148: Hoare triple {295701#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,869 INFO L290 TraceCheckUtils]: 149: Hoare triple {295701#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 150: Hoare triple {295701#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 151: Hoare triple {295701#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 152: Hoare triple {295701#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 153: Hoare triple {295701#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 154: Hoare triple {295701#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 155: Hoare triple {295701#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 156: Hoare triple {295701#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 157: Hoare triple {295701#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 158: Hoare triple {295701#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 159: Hoare triple {295701#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 160: Hoare triple {295701#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 161: Hoare triple {295701#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 162: Hoare triple {295701#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 163: Hoare triple {295701#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 164: Hoare triple {295701#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,870 INFO L290 TraceCheckUtils]: 165: Hoare triple {295701#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,871 INFO L290 TraceCheckUtils]: 166: Hoare triple {295701#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,871 INFO L290 TraceCheckUtils]: 167: Hoare triple {295701#true} assume 8640 == #t~mem75;havoc #t~mem75; {295701#true} is VALID [2022-04-28 08:59:25,871 INFO L290 TraceCheckUtils]: 168: Hoare triple {295701#true} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {295701#true} is VALID [2022-04-28 08:59:25,871 INFO L290 TraceCheckUtils]: 169: Hoare triple {295701#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {295701#true} is VALID [2022-04-28 08:59:25,871 INFO L290 TraceCheckUtils]: 170: Hoare triple {295701#true} assume !(~ret~0 <= 0);call #t~mem139 := read~int(~s.base, 92 + ~s.offset, 4); {295701#true} is VALID [2022-04-28 08:59:25,871 INFO L290 TraceCheckUtils]: 171: Hoare triple {295701#true} assume 0 != #t~mem139;havoc #t~mem139;call write~int(3, ~s.base, 52 + ~s.offset, 4); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,872 INFO L290 TraceCheckUtils]: 172: Hoare triple {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,873 INFO L290 TraceCheckUtils]: 173: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,873 INFO L290 TraceCheckUtils]: 174: Hoare triple {295706#(= 3 (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; {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,874 INFO L290 TraceCheckUtils]: 175: Hoare triple {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,874 INFO L290 TraceCheckUtils]: 176: Hoare triple {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,874 INFO L290 TraceCheckUtils]: 177: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,875 INFO L290 TraceCheckUtils]: 178: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,875 INFO L290 TraceCheckUtils]: 179: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,875 INFO L290 TraceCheckUtils]: 180: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,876 INFO L290 TraceCheckUtils]: 181: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,876 INFO L290 TraceCheckUtils]: 182: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,877 INFO L290 TraceCheckUtils]: 183: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,877 INFO L290 TraceCheckUtils]: 184: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,877 INFO L290 TraceCheckUtils]: 185: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,878 INFO L290 TraceCheckUtils]: 186: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,878 INFO L290 TraceCheckUtils]: 187: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,878 INFO L290 TraceCheckUtils]: 188: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,879 INFO L290 TraceCheckUtils]: 189: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,879 INFO L290 TraceCheckUtils]: 190: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,880 INFO L290 TraceCheckUtils]: 191: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,880 INFO L290 TraceCheckUtils]: 192: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,880 INFO L290 TraceCheckUtils]: 193: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,881 INFO L290 TraceCheckUtils]: 194: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,881 INFO L290 TraceCheckUtils]: 195: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,881 INFO L290 TraceCheckUtils]: 196: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,882 INFO L290 TraceCheckUtils]: 197: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,882 INFO L290 TraceCheckUtils]: 198: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,883 INFO L290 TraceCheckUtils]: 199: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,883 INFO L290 TraceCheckUtils]: 200: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,883 INFO L290 TraceCheckUtils]: 201: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,884 INFO L290 TraceCheckUtils]: 202: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,884 INFO L290 TraceCheckUtils]: 203: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,884 INFO L290 TraceCheckUtils]: 204: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,885 INFO L290 TraceCheckUtils]: 205: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,885 INFO L290 TraceCheckUtils]: 206: Hoare triple {295706#(= 3 (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); {295706#(= 3 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-28 08:59:25,885 INFO L290 TraceCheckUtils]: 207: Hoare triple {295706#(= 3 (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); {295707#(= |ssl3_accept_#t~mem77| 3)} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 208: Hoare triple {295707#(= |ssl3_accept_#t~mem77| 3)} assume 8656 == #t~mem77;havoc #t~mem77; {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 209: Hoare triple {295702#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; {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 210: Hoare triple {295702#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 211: Hoare triple {295702#false} assume !(2 == ~blastFlag~0); {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 212: Hoare triple {295702#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 213: Hoare triple {295702#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); {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 214: Hoare triple {295702#false} assume !(0 == ~tmp___10~0); {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 215: Hoare triple {295702#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 216: Hoare triple {295702#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 217: Hoare triple {295702#false} ~skip~0 := 0; {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 218: Hoare triple {295702#false} assume !false; {295702#false} is VALID [2022-04-28 08:59:25,886 INFO L290 TraceCheckUtils]: 219: Hoare triple {295702#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 220: Hoare triple {295702#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 221: Hoare triple {295702#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 222: Hoare triple {295702#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 223: Hoare triple {295702#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 224: Hoare triple {295702#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 225: Hoare triple {295702#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 226: Hoare triple {295702#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 227: Hoare triple {295702#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 228: Hoare triple {295702#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 229: Hoare triple {295702#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 230: Hoare triple {295702#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 231: Hoare triple {295702#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 232: Hoare triple {295702#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 233: Hoare triple {295702#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 234: Hoare triple {295702#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,887 INFO L290 TraceCheckUtils]: 235: Hoare triple {295702#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 236: Hoare triple {295702#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 237: Hoare triple {295702#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 238: Hoare triple {295702#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 239: Hoare triple {295702#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 240: Hoare triple {295702#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 241: Hoare triple {295702#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 242: Hoare triple {295702#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 243: Hoare triple {295702#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 244: Hoare triple {295702#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 245: Hoare triple {295702#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 246: Hoare triple {295702#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 247: Hoare triple {295702#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 248: Hoare triple {295702#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 249: Hoare triple {295702#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,888 INFO L290 TraceCheckUtils]: 250: Hoare triple {295702#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 251: Hoare triple {295702#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 252: Hoare triple {295702#false} assume 8672 == #t~mem79;havoc #t~mem79; {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 253: Hoare triple {295702#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 254: Hoare triple {295702#false} assume !(3 == ~blastFlag~0); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 255: Hoare triple {295702#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 256: Hoare triple {295702#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); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 257: Hoare triple {295702#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; {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 258: Hoare triple {295702#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 259: Hoare triple {295702#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 260: Hoare triple {295702#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 261: Hoare triple {295702#false} ~skip~0 := 0; {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 262: Hoare triple {295702#false} assume !false; {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 263: Hoare triple {295702#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 264: Hoare triple {295702#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 265: Hoare triple {295702#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,889 INFO L290 TraceCheckUtils]: 266: Hoare triple {295702#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 267: Hoare triple {295702#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 268: Hoare triple {295702#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 269: Hoare triple {295702#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 270: Hoare triple {295702#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 271: Hoare triple {295702#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 272: Hoare triple {295702#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 273: Hoare triple {295702#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 274: Hoare triple {295702#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 275: Hoare triple {295702#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 276: Hoare triple {295702#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 277: Hoare triple {295702#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 278: Hoare triple {295702#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 279: Hoare triple {295702#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 280: Hoare triple {295702#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,890 INFO L290 TraceCheckUtils]: 281: Hoare triple {295702#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 282: Hoare triple {295702#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 283: Hoare triple {295702#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 284: Hoare triple {295702#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 285: Hoare triple {295702#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 286: Hoare triple {295702#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 287: Hoare triple {295702#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 288: Hoare triple {295702#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 289: Hoare triple {295702#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 290: Hoare triple {295702#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 291: Hoare triple {295702#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 292: Hoare triple {295702#false} assume 8640 == #t~mem75;havoc #t~mem75; {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 293: Hoare triple {295702#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 294: Hoare triple {295702#false} assume !(4 == ~blastFlag~0); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 295: Hoare triple {295702#false} assume !(7 == ~blastFlag~0); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 296: Hoare triple {295702#false} assume !(10 == ~blastFlag~0); {295702#false} is VALID [2022-04-28 08:59:25,891 INFO L290 TraceCheckUtils]: 297: Hoare triple {295702#false} assume 13 == ~blastFlag~0; {295702#false} is VALID [2022-04-28 08:59:25,892 INFO L290 TraceCheckUtils]: 298: Hoare triple {295702#false} assume !false; {295702#false} is VALID [2022-04-28 08:59:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2022-04-28 08:59:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:59:25,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226217878] [2022-04-28 08:59:25,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226217878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:59:25,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:59:25,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:59:25,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:59:25,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050154553] [2022-04-28 08:59:25,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050154553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:59:25,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:59:25,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:59:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361984671] [2022-04-28 08:59:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:59:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 299 [2022-04-28 08:59:25,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:59:25,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:26,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:59:26,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:59:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:59:26,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:59:26,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:59:26,003 INFO L87 Difference]: Start difference. First operand 2897 states and 4307 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:33,386 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-28 08:59:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:59:43,362 INFO L93 Difference]: Finished difference Result 6328 states and 9383 transitions. [2022-04-28 08:59:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:59:43,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 299 [2022-04-28 08:59:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:59:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-04-28 08:59:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-04-28 08:59:43,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 548 transitions. [2022-04-28 08:59:43,662 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-28 08:59:44,183 INFO L225 Difference]: With dead ends: 6328 [2022-04-28 08:59:44,183 INFO L226 Difference]: Without dead ends: 3457 [2022-04-28 08:59:44,186 INFO L412 NwaCegarLoop]: 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-28 08:59:44,186 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 65 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:59:44,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 477 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-28 08:59:44,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2022-04-28 08:59:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3184. [2022-04-28 08:59:45,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:59:45,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3457 states. Second operand has 3184 states, 3179 states have (on average 1.4900912236552375) internal successors, (4737), 3179 states have internal predecessors, (4737), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:45,418 INFO L74 IsIncluded]: Start isIncluded. First operand 3457 states. Second operand has 3184 states, 3179 states have (on average 1.4900912236552375) internal successors, (4737), 3179 states have internal predecessors, (4737), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:45,419 INFO L87 Difference]: Start difference. First operand 3457 states. Second operand has 3184 states, 3179 states have (on average 1.4900912236552375) internal successors, (4737), 3179 states have internal predecessors, (4737), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:59:45,719 INFO L93 Difference]: Finished difference Result 3457 states and 5100 transitions. [2022-04-28 08:59:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 5100 transitions. [2022-04-28 08:59:45,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:59:45,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:59:45,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 3184 states, 3179 states have (on average 1.4900912236552375) internal successors, (4737), 3179 states have internal predecessors, (4737), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3457 states. [2022-04-28 08:59:45,724 INFO L87 Difference]: Start difference. First operand has 3184 states, 3179 states have (on average 1.4900912236552375) internal successors, (4737), 3179 states have internal predecessors, (4737), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3457 states. [2022-04-28 08:59:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:59:46,026 INFO L93 Difference]: Finished difference Result 3457 states and 5100 transitions. [2022-04-28 08:59:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 5100 transitions. [2022-04-28 08:59:46,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:59:46,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:59:46,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:59:46,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:59:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3179 states have (on average 1.4900912236552375) internal successors, (4737), 3179 states have internal predecessors, (4737), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4741 transitions. [2022-04-28 08:59:46,490 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4741 transitions. Word has length 299 [2022-04-28 08:59:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:59:46,490 INFO L495 AbstractCegarLoop]: Abstraction has 3184 states and 4741 transitions. [2022-04-28 08:59:46,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:59:46,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3184 states and 4741 transitions. [2022-04-28 08:59:53,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4741 edges. 4740 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 08:59:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4741 transitions. [2022-04-28 08:59:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-04-28 08:59:53,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:59:53,717 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:59:53,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-28 08:59:53,717 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:59:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:59:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2100254408, now seen corresponding path program 1 times [2022-04-28 08:59:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:59:53,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148721178]