/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.14.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:45:10,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:45:10,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:45:10,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:45:10,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:45:10,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:45:10,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:45:10,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:45:10,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:45:10,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:45:10,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:45:10,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:45:10,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:45:10,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:45:10,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:45:10,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:45:10,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:45:10,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:45:10,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:45:10,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:45:10,577 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:45:10,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:45:10,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:45:10,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:45:10,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:45:10,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:45:10,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:45:10,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:45:10,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:45:10,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:45:10,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:45:10,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:45:10,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:45:10,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:45:10,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:45:10,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:45:10,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:45:10,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:45:10,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:45:10,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:45:10,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:45:10,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:45:10,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:45:10,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:45:10,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:45:10,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:45:10,603 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:45:10,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:45:10,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:45:10,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:45:10,604 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:45:10,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:45:10,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:45:10,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:45:10,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:45:10,605 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:45:10,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:45:10,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:45:10,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:45:10,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:45:10,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:45:10,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:45:10,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:45:10,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:45:10,606 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:45:10,606 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:45:10,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:45:10,606 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:45:10,606 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 11:45:10,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:45:10,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:45:10,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:45:10,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:45:10,793 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:45:10,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-1.c [2022-04-15 11:45:10,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b631c29/c3888b6a3d18418c851054e645012eb5/FLAG4267cde91 [2022-04-15 11:45:11,276 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:45:11,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.14.i.cil-1.c [2022-04-15 11:45:11,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b631c29/c3888b6a3d18418c851054e645012eb5/FLAG4267cde91 [2022-04-15 11:45:11,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b631c29/c3888b6a3d18418c851054e645012eb5 [2022-04-15 11:45:11,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:45:11,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:45:11,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:45:11,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:45:11,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:45:11,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d5c7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11, skipping insertion in model container [2022-04-15 11:45:11,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:45:11,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:45:11,642 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.14.i.cil-1.c[76536,76549] [2022-04-15 11:45:11,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:45:11,672 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:45:11,771 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.14.i.cil-1.c[76536,76549] [2022-04-15 11:45:11,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:45:11,784 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:45:11,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11 WrapperNode [2022-04-15 11:45:11,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:45:11,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:45:11,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:45:11,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:45:11,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:45:11,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:45:11,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:45:11,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:45:11,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (1/1) ... [2022-04-15 11:45:11,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:45:11,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:45:11,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 11:45:11,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 11:45:11,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 11:45:11,962 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-15 11:45:11,962 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-15 11:45:11,963 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:45:11,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-15 11:45:11,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:45:12,112 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:45:12,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:45:12,900 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 11:45:13,314 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-15 11:45:13,314 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-15 11:45:13,324 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:45:13,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:45:13,335 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:45:13,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:45:13 BoogieIcfgContainer [2022-04-15 11:45:13,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:45:13,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:45:13,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:45:13,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:45:13,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:45:11" (1/3) ... [2022-04-15 11:45:13,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7b66a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:45:13, skipping insertion in model container [2022-04-15 11:45:13,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:45:11" (2/3) ... [2022-04-15 11:45:13,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7b66a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:45:13, skipping insertion in model container [2022-04-15 11:45:13,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:45:13" (3/3) ... [2022-04-15 11:45:13,343 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-1.c [2022-04-15 11:45:13,347 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:45:13,347 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:45:13,373 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:45:13,377 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 11:45:13,377 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:45:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 156 states have (on average 1.7179487179487178) internal successors, (268), 157 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 11:45:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 11:45:13,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:13,405 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:13,405 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:13,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1970039715, now seen corresponding path program 1 times [2022-04-15 11:45:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:13,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [618150531] [2022-04-15 11:45:13,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:45:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1970039715, now seen corresponding path program 2 times [2022-04-15 11:45:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:13,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044697782] [2022-04-15 11:45:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:13,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:13,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:13,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {167#true} is VALID [2022-04-15 11:45:13,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#true} assume true; {167#true} is VALID [2022-04-15 11:45:13,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {167#true} {167#true} #725#return; {167#true} is VALID [2022-04-15 11:45:13,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {167#true} call ULTIMATE.init(); {174#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:45:13,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {167#true} is VALID [2022-04-15 11:45:13,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {167#true} assume true; {167#true} is VALID [2022-04-15 11:45:13,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {167#true} {167#true} #725#return; {167#true} is VALID [2022-04-15 11:45:13,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {167#true} call #t~ret161 := main(); {167#true} is VALID [2022-04-15 11:45:13,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {167#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; {167#true} is VALID [2022-04-15 11:45:13,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {167#true} is VALID [2022-04-15 11:45:13,903 INFO L272 TraceCheckUtils]: 7: Hoare triple {167#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {167#true} is VALID [2022-04-15 11:45:13,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,928 INFO L290 TraceCheckUtils]: 37: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,929 INFO L290 TraceCheckUtils]: 38: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,930 INFO L290 TraceCheckUtils]: 40: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {172#(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); {172#(not (= 8640 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:45:13,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {172#(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); {173#(not (= |ssl3_accept_#t~mem75| 8640))} is VALID [2022-04-15 11:45:13,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {173#(not (= |ssl3_accept_#t~mem75| 8640))} assume 8640 == #t~mem75;havoc #t~mem75; {168#false} is VALID [2022-04-15 11:45:13,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {168#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {168#false} is VALID [2022-04-15 11:45:13,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {168#false} assume !(9 == ~blastFlag~0); {168#false} is VALID [2022-04-15 11:45:13,935 INFO L290 TraceCheckUtils]: 47: Hoare triple {168#false} assume !(12 == ~blastFlag~0); {168#false} is VALID [2022-04-15 11:45:13,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {168#false} assume 15 == ~blastFlag~0; {168#false} is VALID [2022-04-15 11:45:13,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {168#false} assume !false; {168#false} is VALID [2022-04-15 11:45:13,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:13,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:13,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044697782] [2022-04-15 11:45:13,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044697782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:13,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:13,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:13,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:13,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [618150531] [2022-04-15 11:45:13,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [618150531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:13,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:13,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241258011] [2022-04-15 11:45:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:13,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 11:45:13,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:13,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:14,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:14,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:14,035 INFO L87 Difference]: Start difference. First operand has 164 states, 156 states have (on average 1.7179487179487178) internal successors, (268), 157 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:18,934 INFO L93 Difference]: Finished difference Result 448 states and 762 transitions. [2022-04-15 11:45:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 11:45:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 762 transitions. [2022-04-15 11:45:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 762 transitions. [2022-04-15 11:45:18,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 762 transitions. [2022-04-15 11:45:19,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 762 edges. 762 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:19,479 INFO L225 Difference]: With dead ends: 448 [2022-04-15 11:45:19,479 INFO L226 Difference]: Without dead ends: 273 [2022-04-15 11:45:19,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:19,483 INFO L913 BasicCegarLoop]: 170 mSDtfsCounter, 166 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:19,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 499 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 11:45:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-15 11:45:19,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 188. [2022-04-15 11:45:19,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:19,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 188 states, 183 states have (on average 1.6174863387978142) internal successors, (296), 183 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:19,534 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 188 states, 183 states have (on average 1.6174863387978142) internal successors, (296), 183 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:19,535 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 188 states, 183 states have (on average 1.6174863387978142) internal successors, (296), 183 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:19,546 INFO L93 Difference]: Finished difference Result 273 states and 423 transitions. [2022-04-15 11:45:19,546 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 423 transitions. [2022-04-15 11:45:19,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:19,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:19,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 183 states have (on average 1.6174863387978142) internal successors, (296), 183 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-15 11:45:19,554 INFO L87 Difference]: Start difference. First operand has 188 states, 183 states have (on average 1.6174863387978142) internal successors, (296), 183 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 273 states. [2022-04-15 11:45:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:19,564 INFO L93 Difference]: Finished difference Result 273 states and 423 transitions. [2022-04-15 11:45:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 423 transitions. [2022-04-15 11:45:19,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:19,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:19,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:19,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 183 states have (on average 1.6174863387978142) internal successors, (296), 183 states have internal predecessors, (296), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 300 transitions. [2022-04-15 11:45:19,571 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 300 transitions. Word has length 50 [2022-04-15 11:45:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:19,572 INFO L478 AbstractCegarLoop]: Abstraction has 188 states and 300 transitions. [2022-04-15 11:45:19,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:19,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 188 states and 300 transitions. [2022-04-15 11:45:19,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 300 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 300 transitions. [2022-04-15 11:45:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 11:45:19,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:19,776 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:19,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:45:19,776 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:19,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2083271363, now seen corresponding path program 1 times [2022-04-15 11:45:19,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:19,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296602854] [2022-04-15 11:45:19,777 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:45:19,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2083271363, now seen corresponding path program 2 times [2022-04-15 11:45:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467346109] [2022-04-15 11:45:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:19,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:19,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:19,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {2004#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1997#true} is VALID [2022-04-15 11:45:19,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {1997#true} assume true; {1997#true} is VALID [2022-04-15 11:45:19,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1997#true} {1997#true} #725#return; {1997#true} is VALID [2022-04-15 11:45:19,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {1997#true} call ULTIMATE.init(); {2004#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:45:19,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {2004#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1997#true} is VALID [2022-04-15 11:45:19,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {1997#true} assume true; {1997#true} is VALID [2022-04-15 11:45:19,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1997#true} {1997#true} #725#return; {1997#true} is VALID [2022-04-15 11:45:19,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {1997#true} call #t~ret161 := main(); {1997#true} is VALID [2022-04-15 11:45:19,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {1997#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; {1997#true} is VALID [2022-04-15 11:45:19,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {1997#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1997#true} is VALID [2022-04-15 11:45:19,949 INFO L272 TraceCheckUtils]: 7: Hoare triple {1997#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1997#true} is VALID [2022-04-15 11:45:19,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {1997#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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {2002#(= 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; {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {2002#(= 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; {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {2002#(= 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)))); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {2002#(= 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; {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {2002#(= 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); {2002#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:19,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {2002#(= 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); {2003#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-15 11:45:19,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {2003#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {1998#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {1998#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {1998#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {1998#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {1998#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,959 INFO L290 TraceCheckUtils]: 30: Hoare triple {1998#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,959 INFO L290 TraceCheckUtils]: 31: Hoare triple {1998#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,959 INFO L290 TraceCheckUtils]: 32: Hoare triple {1998#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {1998#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {1998#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {1998#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {1998#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {1998#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {1998#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {1998#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,961 INFO L290 TraceCheckUtils]: 40: Hoare triple {1998#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {1998#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {1998#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {1998#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {1998#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1998#false} is VALID [2022-04-15 11:45:19,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {1998#false} assume 8641 == #t~mem76;havoc #t~mem76; {1998#false} is VALID [2022-04-15 11:45:19,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {1998#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {1998#false} is VALID [2022-04-15 11:45:19,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {1998#false} assume !(9 == ~blastFlag~0); {1998#false} is VALID [2022-04-15 11:45:19,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {1998#false} assume !(12 == ~blastFlag~0); {1998#false} is VALID [2022-04-15 11:45:19,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {1998#false} assume 15 == ~blastFlag~0; {1998#false} is VALID [2022-04-15 11:45:19,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {1998#false} assume !false; {1998#false} is VALID [2022-04-15 11:45:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:19,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:19,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467346109] [2022-04-15 11:45:19,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467346109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:19,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:19,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:19,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:19,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296602854] [2022-04-15 11:45:19,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296602854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:19,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:19,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:19,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493185107] [2022-04-15 11:45:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:19,974 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-15 11:45:19,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:19,974 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-15 11:45:20,010 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-15 11:45:20,010 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:20,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:20,011 INFO L87 Difference]: Start difference. First operand 188 states and 300 transitions. 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-15 11:45:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:23,808 INFO L93 Difference]: Finished difference Result 389 states and 622 transitions. [2022-04-15 11:45:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:23,808 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-15 11:45:23,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:23,809 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-15 11:45:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:45:23,812 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-15 11:45:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:45:23,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-15 11:45:24,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:24,159 INFO L225 Difference]: With dead ends: 389 [2022-04-15 11:45:24,159 INFO L226 Difference]: Without dead ends: 216 [2022-04-15 11:45:24,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:24,161 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 22 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:24,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 517 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 11:45:24,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-15 11:45:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2022-04-15 11:45:24,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:24,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 199 states, 194 states have (on average 1.6237113402061856) internal successors, (315), 194 states have internal predecessors, (315), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:24,179 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 199 states, 194 states have (on average 1.6237113402061856) internal successors, (315), 194 states have internal predecessors, (315), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:24,179 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 199 states, 194 states have (on average 1.6237113402061856) internal successors, (315), 194 states have internal predecessors, (315), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:24,190 INFO L93 Difference]: Finished difference Result 216 states and 340 transitions. [2022-04-15 11:45:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 340 transitions. [2022-04-15 11:45:24,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:24,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:24,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6237113402061856) internal successors, (315), 194 states have internal predecessors, (315), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 216 states. [2022-04-15 11:45:24,191 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6237113402061856) internal successors, (315), 194 states have internal predecessors, (315), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 216 states. [2022-04-15 11:45:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:24,199 INFO L93 Difference]: Finished difference Result 216 states and 340 transitions. [2022-04-15 11:45:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 340 transitions. [2022-04-15 11:45:24,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:24,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:24,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:24,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6237113402061856) internal successors, (315), 194 states have internal predecessors, (315), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 319 transitions. [2022-04-15 11:45:24,208 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 319 transitions. Word has length 51 [2022-04-15 11:45:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:24,209 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 319 transitions. [2022-04-15 11:45:24,209 INFO L479 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-15 11:45:24,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 319 transitions. [2022-04-15 11:45:24,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 319 transitions. [2022-04-15 11:45:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 11:45:24,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:24,415 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:24,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 11:45:24,415 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1174616107, now seen corresponding path program 1 times [2022-04-15 11:45:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:24,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1356690058] [2022-04-15 11:45:24,448 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:24,448 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:24,448 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1174616107, now seen corresponding path program 2 times [2022-04-15 11:45:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:24,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015422163] [2022-04-15 11:45:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:24,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:24,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {3624#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3617#true} is VALID [2022-04-15 11:45:24,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {3617#true} assume true; {3617#true} is VALID [2022-04-15 11:45:24,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3617#true} {3617#true} #725#return; {3617#true} is VALID [2022-04-15 11:45:24,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {3617#true} call ULTIMATE.init(); {3624#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:45:24,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3624#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3617#true} is VALID [2022-04-15 11:45:24,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {3617#true} assume true; {3617#true} is VALID [2022-04-15 11:45:24,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3617#true} {3617#true} #725#return; {3617#true} is VALID [2022-04-15 11:45:24,594 INFO L272 TraceCheckUtils]: 4: Hoare triple {3617#true} call #t~ret161 := main(); {3617#true} is VALID [2022-04-15 11:45:24,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {3617#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; {3617#true} is VALID [2022-04-15 11:45:24,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {3617#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3617#true} is VALID [2022-04-15 11:45:24,595 INFO L272 TraceCheckUtils]: 7: Hoare triple {3617#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3617#true} is VALID [2022-04-15 11:45:24,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {3617#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); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {3622#(= 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; {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {3622#(= 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; {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {3622#(= 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)))); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {3622#(= 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); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {3622#(= 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; {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {3622#(= 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); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {3622#(= 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); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {3622#(= 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); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {3622#(= 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); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {3622#(= 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); {3622#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:24,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {3622#(= 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); {3623#(= 8464 |ssl3_accept_#t~mem52|)} is VALID [2022-04-15 11:45:24,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {3623#(= 8464 |ssl3_accept_#t~mem52|)} assume 8480 == #t~mem52;havoc #t~mem52; {3618#false} is VALID [2022-04-15 11:45:24,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {3618#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; {3618#false} is VALID [2022-04-15 11:45:24,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {3618#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); {3618#false} is VALID [2022-04-15 11:45:24,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {3618#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); {3618#false} is VALID [2022-04-15 11:45:24,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {3618#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3618#false} is VALID [2022-04-15 11:45:24,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {3618#false} ~skip~0 := 0; {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {3618#false} assume !false; {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {3618#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); {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {3618#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {3618#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {3618#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {3618#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {3618#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {3618#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {3618#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 36: Hoare triple {3618#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {3618#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {3618#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {3618#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {3618#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 41: Hoare triple {3618#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {3618#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {3618#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {3618#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {3618#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {3618#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {3618#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 48: Hoare triple {3618#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 49: Hoare triple {3618#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 50: Hoare triple {3618#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 51: Hoare triple {3618#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {3618#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {3618#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {3618#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {3618#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 56: Hoare triple {3618#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 57: Hoare triple {3618#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 58: Hoare triple {3618#false} assume 8641 == #t~mem76;havoc #t~mem76; {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 59: Hoare triple {3618#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 60: Hoare triple {3618#false} assume !(9 == ~blastFlag~0); {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 61: Hoare triple {3618#false} assume !(12 == ~blastFlag~0); {3618#false} is VALID [2022-04-15 11:45:24,614 INFO L290 TraceCheckUtils]: 62: Hoare triple {3618#false} assume 15 == ~blastFlag~0; {3618#false} is VALID [2022-04-15 11:45:24,615 INFO L290 TraceCheckUtils]: 63: Hoare triple {3618#false} assume !false; {3618#false} is VALID [2022-04-15 11:45:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:24,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:24,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015422163] [2022-04-15 11:45:24,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015422163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:24,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:24,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:24,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:24,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1356690058] [2022-04-15 11:45:24,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1356690058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:24,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:24,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:24,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95359494] [2022-04-15 11:45:24,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:24,617 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-15 11:45:24,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:24,617 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-15 11:45:24,657 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-15 11:45:24,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:24,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:24,658 INFO L87 Difference]: Start difference. First operand 199 states and 319 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-15 11:45:31,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:32,583 INFO L93 Difference]: Finished difference Result 389 states and 621 transitions. [2022-04-15 11:45:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:32,583 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-15 11:45:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:32,583 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-15 11:45:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:45:32,596 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-15 11:45:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-15 11:45:32,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-15 11:45:32,901 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-15 11:45:32,904 INFO L225 Difference]: With dead ends: 389 [2022-04-15 11:45:32,904 INFO L226 Difference]: Without dead ends: 216 [2022-04-15 11:45:32,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:32,907 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 24 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:32,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 519 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 11:45:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-15 11:45:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2022-04-15 11:45:32,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:32,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 199 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 194 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:32,916 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 199 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 194 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:32,917 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 199 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 194 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:32,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:32,920 INFO L93 Difference]: Finished difference Result 216 states and 339 transitions. [2022-04-15 11:45:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 339 transitions. [2022-04-15 11:45:32,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:32,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:32,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 194 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 216 states. [2022-04-15 11:45:32,921 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 194 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 216 states. [2022-04-15 11:45:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:32,925 INFO L93 Difference]: Finished difference Result 216 states and 339 transitions. [2022-04-15 11:45:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 339 transitions. [2022-04-15 11:45:32,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:32,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:32,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:32,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 194 states have internal predecessors, (314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2022-04-15 11:45:32,929 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 64 [2022-04-15 11:45:32,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:32,929 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2022-04-15 11:45:32,929 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:32,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 318 transitions. [2022-04-15 11:45:33,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 318 edges. 318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2022-04-15 11:45:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:45:33,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:33,148 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:33,148 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 11:45:33,148 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -774984987, now seen corresponding path program 1 times [2022-04-15 11:45:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:33,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642954988] [2022-04-15 11:45:33,266 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:45:33,266 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:45:33,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:45:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash -774984987, now seen corresponding path program 2 times [2022-04-15 11:45:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:33,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222816684] [2022-04-15 11:45:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:33,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:33,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {5244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5237#true} is VALID [2022-04-15 11:45:33,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-15 11:45:33,413 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5237#true} {5237#true} #725#return; {5237#true} is VALID [2022-04-15 11:45:33,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {5237#true} call ULTIMATE.init(); {5244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:45:33,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {5244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5237#true} is VALID [2022-04-15 11:45:33,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {5237#true} assume true; {5237#true} is VALID [2022-04-15 11:45:33,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5237#true} {5237#true} #725#return; {5237#true} is VALID [2022-04-15 11:45:33,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {5237#true} call #t~ret161 := main(); {5237#true} is VALID [2022-04-15 11:45:33,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {5237#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; {5237#true} is VALID [2022-04-15 11:45:33,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {5237#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5237#true} is VALID [2022-04-15 11:45:33,414 INFO L272 TraceCheckUtils]: 7: Hoare triple {5237#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5237#true} is VALID [2022-04-15 11:45:33,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {5237#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); {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {5242#(= 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; {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {5242#(= 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; {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {5242#(= 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)))); {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {5242#(= 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); {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {5242#(= 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; {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5242#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:45:33,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {5242#(= 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); {5243#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {5243#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {5238#false} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {5238#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {5238#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {5238#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {5238#false} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {5238#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {5238#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); {5238#false} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {5238#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {5238#false} is VALID [2022-04-15 11:45:33,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {5238#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); {5238#false} is VALID [2022-04-15 11:45:33,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {5238#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); {5238#false} is VALID [2022-04-15 11:45:33,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {5238#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); {5238#false} is VALID [2022-04-15 11:45:33,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {5238#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5238#false} is VALID [2022-04-15 11:45:33,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {5238#false} ~skip~0 := 0; {5238#false} is VALID [2022-04-15 11:45:33,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {5238#false} assume !false; {5238#false} is VALID [2022-04-15 11:45:33,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {5238#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); {5238#false} is VALID [2022-04-15 11:45:33,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {5238#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {5238#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {5238#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {5238#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {5238#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {5238#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {5238#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {5238#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 38: Hoare triple {5238#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 39: Hoare triple {5238#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 40: Hoare triple {5238#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,432 INFO L290 TraceCheckUtils]: 41: Hoare triple {5238#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 42: Hoare triple {5238#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 43: Hoare triple {5238#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 44: Hoare triple {5238#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 45: Hoare triple {5238#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 46: Hoare triple {5238#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 47: Hoare triple {5238#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {5238#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {5238#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {5238#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {5238#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {5238#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {5238#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {5238#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {5238#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {5238#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {5238#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {5238#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {5238#false} assume 8641 == #t~mem76;havoc #t~mem76; {5238#false} is VALID [2022-04-15 11:45:33,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {5238#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {5238#false} is VALID [2022-04-15 11:45:33,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {5238#false} assume !(9 == ~blastFlag~0); {5238#false} is VALID [2022-04-15 11:45:33,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {5238#false} assume !(12 == ~blastFlag~0); {5238#false} is VALID [2022-04-15 11:45:33,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {5238#false} assume 15 == ~blastFlag~0; {5238#false} is VALID [2022-04-15 11:45:33,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {5238#false} assume !false; {5238#false} is VALID [2022-04-15 11:45:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:33,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:33,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222816684] [2022-04-15 11:45:33,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222816684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:33,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:33,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:33,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642954988] [2022-04-15 11:45:33,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642954988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:33,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:33,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:45:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598581572] [2022-04-15 11:45:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:33,440 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-15 11:45:33,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:33,441 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-15 11:45:33,486 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-15 11:45:33,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:45:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:33,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:45:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:45:33,487 INFO L87 Difference]: Start difference. First operand 199 states and 318 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-15 11:45:37,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:45:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:38,917 INFO L93 Difference]: Finished difference Result 388 states and 619 transitions. [2022-04-15 11:45:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:45:38,917 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-15 11:45:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:38,918 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-15 11:45:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:45:38,921 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-15 11:45:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 473 transitions. [2022-04-15 11:45:38,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 473 transitions. [2022-04-15 11:45:39,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:39,260 INFO L225 Difference]: With dead ends: 388 [2022-04-15 11:45:39,260 INFO L226 Difference]: Without dead ends: 215 [2022-04-15 11:45:39,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:45:39,261 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 28 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:39,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 521 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 11:45:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-15 11:45:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2022-04-15 11:45:39,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:39,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:39,276 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:39,276 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:39,279 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2022-04-15 11:45:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 337 transitions. [2022-04-15 11:45:39,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:39,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:39,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-15 11:45:39,281 INFO L87 Difference]: Start difference. First operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 215 states. [2022-04-15 11:45:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:39,284 INFO L93 Difference]: Finished difference Result 215 states and 337 transitions. [2022-04-15 11:45:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 337 transitions. [2022-04-15 11:45:39,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:39,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:39,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:39,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 194 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2022-04-15 11:45:39,289 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 65 [2022-04-15 11:45:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:39,289 INFO L478 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2022-04-15 11:45:39,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:39,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 317 transitions. [2022-04-15 11:45:39,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:39,506 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2022-04-15 11:45:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:45:39,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:39,506 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:39,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 11:45:39,507 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:39,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1884446929, now seen corresponding path program 1 times [2022-04-15 11:45:39,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:39,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [316593951] [2022-04-15 11:45:39,683 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:45:39,690 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:45:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash -87540384, now seen corresponding path program 1 times [2022-04-15 11:45:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:39,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332223521] [2022-04-15 11:45:39,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:39,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:39,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6853#true} is VALID [2022-04-15 11:45:39,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {6853#true} assume true; {6853#true} is VALID [2022-04-15 11:45:39,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6853#true} {6853#true} #725#return; {6853#true} is VALID [2022-04-15 11:45:39,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {6853#true} call ULTIMATE.init(); {6859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:45:39,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6853#true} is VALID [2022-04-15 11:45:39,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {6853#true} assume true; {6853#true} is VALID [2022-04-15 11:45:39,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6853#true} {6853#true} #725#return; {6853#true} is VALID [2022-04-15 11:45:39,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {6853#true} call #t~ret161 := main(); {6853#true} is VALID [2022-04-15 11:45:39,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {6853#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; {6853#true} is VALID [2022-04-15 11:45:39,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {6853#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6853#true} is VALID [2022-04-15 11:45:39,852 INFO L272 TraceCheckUtils]: 7: Hoare triple {6853#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6853#true} is VALID [2022-04-15 11:45:39,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {6853#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); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {6858#(= 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; {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {6858#(= 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; {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {6858#(= 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)))); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} [731] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.offset_262| |v_#memory_$Pointer$.offset_256|)) (.cse1 (= |v_ssl3_accept_#t~mem85_10| |v_ssl3_accept_#t~mem85_8|)) (.cse2 (= v_ssl3_accept_~skip~0_16 v_ssl3_accept_~skip~0_15)) (.cse3 (= |v_ssl3_accept_#t~mem47_12| |v_ssl3_accept_#t~mem47_10|)) (.cse4 (= |v_ssl3_accept_#t~mem150.base_10| |v_ssl3_accept_#t~mem150.base_8|)) (.cse5 (= v_ssl3_accept_~state~0_8 v_ssl3_accept_~state~0_7)) (.cse6 (= |v_ssl3_accept_#t~mem88.base_5| |v_ssl3_accept_#t~mem88.base_4|)) (.cse7 (= |v_ssl3_accept_#t~mem48_10| |v_ssl3_accept_#t~mem48_8|)) (.cse8 (= |v_ssl3_accept_#t~mem88.offset_5| |v_ssl3_accept_#t~mem88.offset_4|)) (.cse9 (= |v_ssl3_accept_#t~mem46_6| |v_ssl3_accept_#t~mem46_5|)) (.cse10 (= |v_ssl3_accept_#t~mem151_12| |v_ssl3_accept_#t~mem151_10|)) (.cse11 (= |v_ssl3_accept_#t~mem89_5| |v_ssl3_accept_#t~mem89_4|)) (.cse12 (= |v_ssl3_accept_#t~mem82_10| |v_ssl3_accept_#t~mem82_8|)) (.cse13 (= |v_#memory_$Pointer$.base_262| |v_#memory_$Pointer$.base_256|))) (or (and .cse0 .cse1 (= |v_ssl3_accept_#t~mem83.offset_8| |v_ssl3_accept_#t~mem83.offset_10|) .cse2 .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_8| |v_ssl3_accept_#t~mem150.offset_10|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_#memory_int_257| |v_#memory_int_262|) (= |v_ssl3_accept_#t~mem83.base_8| |v_ssl3_accept_#t~mem83.base_10|) .cse13) (and .cse0 .cse1 .cse2 (= |v_#memory_int_262| |v_#memory_int_257|) .cse3 .cse4 .cse5 (= |v_ssl3_accept_#t~mem150.offset_10| |v_ssl3_accept_#t~mem150.offset_8|) (= |v_ssl3_accept_#t~mem83.base_10| |v_ssl3_accept_#t~mem83.base_8|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem83.offset_10| |v_ssl3_accept_#t~mem83.offset_8|) .cse13))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_10|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_262|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_10|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_10|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_12|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_10|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_5|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_10|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_10|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_12|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_6|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_16, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_5|, #memory_int=|v_#memory_int_262|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_5|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_262|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_8} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_8|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_256|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_8|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_8|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_10|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_8|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_4|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_8|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_8|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_10|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_5|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_15, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_4|, #memory_int=|v_#memory_int_257|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_4|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_256|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_7} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} [730] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {6858#(= 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); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,858 INFO L290 TraceCheckUtils]: 25: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,858 INFO L290 TraceCheckUtils]: 26: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,858 INFO L290 TraceCheckUtils]: 27: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,862 INFO L290 TraceCheckUtils]: 37: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,862 INFO L290 TraceCheckUtils]: 38: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,863 INFO L290 TraceCheckUtils]: 40: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,864 INFO L290 TraceCheckUtils]: 44: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,864 INFO L290 TraceCheckUtils]: 47: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {6858#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:39,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {6858#(= ssl3_accept_~blastFlag~0 0)} assume 15 == ~blastFlag~0; {6854#false} is VALID [2022-04-15 11:45:39,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {6854#false} assume !false; {6854#false} is VALID [2022-04-15 11:45:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:39,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:39,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332223521] [2022-04-15 11:45:39,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332223521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:39,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:39,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:45:42,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:42,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [316593951] [2022-04-15 11:45:42,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [316593951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:42,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:42,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:45:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074089883] [2022-04-15 11:45:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:42,686 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-15 11:45:42,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:42,686 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-15 11:45:42,771 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-15 11:45:42,772 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:45:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:45:42,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:45:42,773 INFO L87 Difference]: Start difference. First operand 199 states and 317 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-15 11:45:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:50,716 INFO L93 Difference]: Finished difference Result 542 states and 878 transitions. [2022-04-15 11:45:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:45:50,716 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-15 11:45:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:45:50,717 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-15 11:45:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 642 transitions. [2022-04-15 11:45:50,720 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-15 11:45:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 642 transitions. [2022-04-15 11:45:50,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 642 transitions. [2022-04-15 11:45:51,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 642 edges. 642 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:51,226 INFO L225 Difference]: With dead ends: 542 [2022-04-15 11:45:51,226 INFO L226 Difference]: Without dead ends: 369 [2022-04-15 11:45:51,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:45:51,227 INFO L913 BasicCegarLoop]: 352 mSDtfsCounter, 148 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:45:51,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 928 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 729 Invalid, 0 Unknown, 209 Unchecked, 2.0s Time] [2022-04-15 11:45:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-04-15 11:45:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 365. [2022-04-15 11:45:51,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:45:51,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 369 states. Second operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:51,253 INFO L74 IsIncluded]: Start isIncluded. First operand 369 states. Second operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:51,254 INFO L87 Difference]: Start difference. First operand 369 states. Second operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:51,261 INFO L93 Difference]: Finished difference Result 369 states and 580 transitions. [2022-04-15 11:45:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 580 transitions. [2022-04-15 11:45:51,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:51,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:51,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-15 11:45:51,263 INFO L87 Difference]: Start difference. First operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 369 states. [2022-04-15 11:45:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:45:51,269 INFO L93 Difference]: Finished difference Result 369 states and 580 transitions. [2022-04-15 11:45:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 580 transitions. [2022-04-15 11:45:51,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:45:51,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:45:51,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:45:51,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:45:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:45:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 575 transitions. [2022-04-15 11:45:51,279 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 575 transitions. Word has length 65 [2022-04-15 11:45:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:45:51,279 INFO L478 AbstractCegarLoop]: Abstraction has 365 states and 575 transitions. [2022-04-15 11:45:51,279 INFO L479 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-15 11:45:51,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 365 states and 575 transitions. [2022-04-15 11:45:51,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:45:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 575 transitions. [2022-04-15 11:45:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 11:45:51,696 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:45:51,696 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:45:51,696 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 11:45:51,696 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:45:51,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:45:51,696 INFO L85 PathProgramCache]: Analyzing trace with hash -482247665, now seen corresponding path program 1 times [2022-04-15 11:45:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:51,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [392977373] [2022-04-15 11:45:51,824 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 18 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:45:51,825 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:45:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash -457368160, now seen corresponding path program 1 times [2022-04-15 11:45:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:45:51,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417885835] [2022-04-15 11:45:51,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:45:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:45:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:45:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:45:51,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {9429#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9423#true} is VALID [2022-04-15 11:45:51,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {9423#true} assume true; {9423#true} is VALID [2022-04-15 11:45:51,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9423#true} {9423#true} #725#return; {9423#true} is VALID [2022-04-15 11:45:51,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {9423#true} call ULTIMATE.init(); {9429#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:45:51,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {9429#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9423#true} is VALID [2022-04-15 11:45:51,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {9423#true} assume true; {9423#true} is VALID [2022-04-15 11:45:51,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9423#true} {9423#true} #725#return; {9423#true} is VALID [2022-04-15 11:45:51,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {9423#true} call #t~ret161 := main(); {9423#true} is VALID [2022-04-15 11:45:51,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {9423#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; {9423#true} is VALID [2022-04-15 11:45:51,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {9423#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9423#true} is VALID [2022-04-15 11:45:51,942 INFO L272 TraceCheckUtils]: 7: Hoare triple {9423#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9423#true} is VALID [2022-04-15 11:45:51,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {9423#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); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {9428#(= 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; {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {9428#(= 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; {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {9428#(= 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)))); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} [733] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem88.offset_10| |v_ssl3_accept_#t~mem88.offset_9|)) (.cse1 (= |v_#memory_$Pointer$.base_282| |v_#memory_$Pointer$.base_276|)) (.cse2 (= |v_ssl3_accept_#t~mem150.offset_16| |v_ssl3_accept_#t~mem150.offset_14|)) (.cse3 (= v_ssl3_accept_~skip~0_21 v_ssl3_accept_~skip~0_20)) (.cse4 (= |v_ssl3_accept_#t~mem82_17| |v_ssl3_accept_#t~mem82_15|)) (.cse5 (= |v_ssl3_accept_#t~mem151_18| |v_ssl3_accept_#t~mem151_16|)) (.cse6 (= |v_ssl3_accept_#t~mem47_19| |v_ssl3_accept_#t~mem47_17|)) (.cse7 (= |v_ssl3_accept_#t~mem83.offset_17| |v_ssl3_accept_#t~mem83.offset_15|)) (.cse8 (= |v_ssl3_accept_#t~mem85_17| |v_ssl3_accept_#t~mem85_15|)) (.cse9 (= v_ssl3_accept_~state~0_13 v_ssl3_accept_~state~0_12)) (.cse10 (= |v_#memory_$Pointer$.offset_282| |v_#memory_$Pointer$.offset_276|)) (.cse11 (= |v_ssl3_accept_#t~mem89_10| |v_ssl3_accept_#t~mem89_9|)) (.cse12 (= |v_ssl3_accept_#t~mem150.base_16| |v_ssl3_accept_#t~mem150.base_14|)) (.cse13 (= |v_ssl3_accept_#t~mem46_11| |v_ssl3_accept_#t~mem46_10|)) (.cse14 (= |v_#memory_int_281| |v_#memory_int_276|))) (or (and .cse0 .cse1 (= |v_ssl3_accept_#t~mem88.base_9| |v_ssl3_accept_#t~mem88.base_10|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |v_ssl3_accept_#t~mem48_15| |v_ssl3_accept_#t~mem48_17|) .cse13 (= |v_ssl3_accept_#t~mem83.base_15| |v_ssl3_accept_#t~mem83.base_17|) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_ssl3_accept_#t~mem83.base_17| |v_ssl3_accept_#t~mem83.base_15|) .cse5 (= |v_ssl3_accept_#t~mem48_17| |v_ssl3_accept_#t~mem48_15|) .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem88.base_10| |v_ssl3_accept_#t~mem88.base_9|) .cse11 .cse12 .cse13 .cse14))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_17|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_282|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_17|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_17|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_18|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_16|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_10|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_17|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_16|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_19|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_11|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_21, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_10|, #memory_int=|v_#memory_int_281|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_10|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_282|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_13} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_15|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_276|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_15|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_15|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_16|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_14|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_9|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_15|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_14|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_17|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_10|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_20, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_9|, #memory_int=|v_#memory_int_276|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_9|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_276|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_12} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} [732] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {9428#(= 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); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,949 INFO L290 TraceCheckUtils]: 35: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,952 INFO L290 TraceCheckUtils]: 44: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,953 INFO L290 TraceCheckUtils]: 49: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {9428#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:45:51,953 INFO L290 TraceCheckUtils]: 50: Hoare triple {9428#(= ssl3_accept_~blastFlag~0 0)} assume 15 == ~blastFlag~0; {9424#false} is VALID [2022-04-15 11:45:51,953 INFO L290 TraceCheckUtils]: 51: Hoare triple {9424#false} assume !false; {9424#false} is VALID [2022-04-15 11:45:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:45:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:45:51,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417885835] [2022-04-15 11:45:51,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417885835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:51,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:51,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:45:54,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:45:54,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [392977373] [2022-04-15 11:45:54,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [392977373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:45:54,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:45:54,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:45:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639176738] [2022-04-15 11:45:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:45:54,757 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-15 11:45:54,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:45:54,757 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-15 11:45:54,831 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-15 11:45:54,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 11:45:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:45:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 11:45:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:45:54,832 INFO L87 Difference]: Start difference. First operand 365 states and 575 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-15 11:45:59,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:02,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:04,978 INFO L93 Difference]: Finished difference Result 547 states and 868 transitions. [2022-04-15 11:46:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 11:46:04,978 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-15 11:46:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:04,978 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-15 11:46:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 627 transitions. [2022-04-15 11:46:04,982 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-15 11:46:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 627 transitions. [2022-04-15 11:46:04,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 627 transitions. [2022-04-15 11:46:05,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:05,449 INFO L225 Difference]: With dead ends: 547 [2022-04-15 11:46:05,449 INFO L226 Difference]: Without dead ends: 374 [2022-04-15 11:46:05,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=48, Invalid=107, Unknown=1, NotChecked=0, Total=156 [2022-04-15 11:46:05,453 INFO L913 BasicCegarLoop]: 212 mSDtfsCounter, 150 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:05,453 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 651 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 646 Invalid, 0 Unknown, 35 Unchecked, 4.6s Time] [2022-04-15 11:46:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-04-15 11:46:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 365. [2022-04-15 11:46:05,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:05,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:05,471 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:05,471 INFO L87 Difference]: Start difference. First operand 374 states. Second operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:05,478 INFO L93 Difference]: Finished difference Result 374 states and 586 transitions. [2022-04-15 11:46:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 586 transitions. [2022-04-15 11:46:05,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:05,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:05,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 374 states. [2022-04-15 11:46:05,480 INFO L87 Difference]: Start difference. First operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 374 states. [2022-04-15 11:46:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:05,487 INFO L93 Difference]: Finished difference Result 374 states and 586 transitions. [2022-04-15 11:46:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 586 transitions. [2022-04-15 11:46:05,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:05,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:05,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:05,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 360 states have (on average 1.586111111111111) internal successors, (571), 360 states have internal predecessors, (571), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 575 transitions. [2022-04-15 11:46:05,497 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 575 transitions. Word has length 65 [2022-04-15 11:46:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:05,497 INFO L478 AbstractCegarLoop]: Abstraction has 365 states and 575 transitions. [2022-04-15 11:46:05,498 INFO L479 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-15 11:46:05,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 365 states and 575 transitions. [2022-04-15 11:46:05,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 575 transitions. [2022-04-15 11:46:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:46:05,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:05,907 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:05,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 11:46:05,908 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1864193144, now seen corresponding path program 1 times [2022-04-15 11:46:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385920503] [2022-04-15 11:46:05,928 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:05,929 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:05,929 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1864193144, now seen corresponding path program 2 times [2022-04-15 11:46:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:05,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577078493] [2022-04-15 11:46:05,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:06,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {12020#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12013#true} is VALID [2022-04-15 11:46:06,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {12013#true} assume true; {12013#true} is VALID [2022-04-15 11:46:06,056 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12013#true} {12013#true} #725#return; {12013#true} is VALID [2022-04-15 11:46:06,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {12013#true} call ULTIMATE.init(); {12020#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:46:06,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {12020#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12013#true} is VALID [2022-04-15 11:46:06,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {12013#true} assume true; {12013#true} is VALID [2022-04-15 11:46:06,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12013#true} {12013#true} #725#return; {12013#true} is VALID [2022-04-15 11:46:06,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {12013#true} call #t~ret161 := main(); {12013#true} is VALID [2022-04-15 11:46:06,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {12013#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; {12013#true} is VALID [2022-04-15 11:46:06,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {12013#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12013#true} is VALID [2022-04-15 11:46:06,058 INFO L272 TraceCheckUtils]: 7: Hoare triple {12013#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12013#true} is VALID [2022-04-15 11:46:06,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {12013#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); {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {12018#(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; {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {12018#(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; {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {12018#(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)))); {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {12018#(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); {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {12018#(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; {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {12018#(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); {12018#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:06,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {12018#(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); {12019#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-15 11:46:06,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {12019#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {12014#false} is VALID [2022-04-15 11:46:06,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {12014#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {12014#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12014#false} is VALID [2022-04-15 11:46:06,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {12014#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {12014#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); {12014#false} is VALID [2022-04-15 11:46:06,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {12014#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {12014#false} is VALID [2022-04-15 11:46:06,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {12014#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); {12014#false} is VALID [2022-04-15 11:46:06,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {12014#false} assume 12292 != #t~mem85;havoc #t~mem85; {12014#false} is VALID [2022-04-15 11:46:06,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {12014#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; {12014#false} is VALID [2022-04-15 11:46:06,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {12014#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); {12014#false} is VALID [2022-04-15 11:46:06,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {12014#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12014#false} is VALID [2022-04-15 11:46:06,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {12014#false} ~skip~0 := 0; {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {12014#false} assume !false; {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {12014#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); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {12014#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {12014#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {12014#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {12014#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {12014#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 36: Hoare triple {12014#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {12014#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {12014#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {12014#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {12014#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {12014#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {12014#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 43: Hoare triple {12014#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 44: Hoare triple {12014#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {12014#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 46: Hoare triple {12014#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {12014#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {12014#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {12014#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {12014#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 51: Hoare triple {12014#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {12014#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {12014#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {12014#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 55: Hoare triple {12014#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {12014#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {12014#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {12014#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 59: Hoare triple {12014#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {12014#false} assume 8641 == #t~mem76;havoc #t~mem76; {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 61: Hoare triple {12014#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 62: Hoare triple {12014#false} assume !(9 == ~blastFlag~0); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 63: Hoare triple {12014#false} assume !(12 == ~blastFlag~0); {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {12014#false} assume 15 == ~blastFlag~0; {12014#false} is VALID [2022-04-15 11:46:06,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {12014#false} assume !false; {12014#false} is VALID [2022-04-15 11:46:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:06,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:06,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577078493] [2022-04-15 11:46:06,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577078493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:06,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:06,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:06,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:06,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385920503] [2022-04-15 11:46:06,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385920503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:06,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:06,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205996140] [2022-04-15 11:46:06,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:06,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:46:06,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:06,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:06,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:06,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:06,135 INFO L87 Difference]: Start difference. First operand 365 states and 575 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:08,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:11,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:14,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:15,889 INFO L93 Difference]: Finished difference Result 779 states and 1227 transitions. [2022-04-15 11:46:15,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:15,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 11:46:15,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2022-04-15 11:46:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 631 transitions. [2022-04-15 11:46:15,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 631 transitions. [2022-04-15 11:46:16,319 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-15 11:46:16,336 INFO L225 Difference]: With dead ends: 779 [2022-04-15 11:46:16,337 INFO L226 Difference]: Without dead ends: 599 [2022-04-15 11:46:16,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:16,338 INFO L913 BasicCegarLoop]: 130 mSDtfsCounter, 161 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:16,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 380 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-15 11:46:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-04-15 11:46:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 389. [2022-04-15 11:46:16,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:16,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 599 states. Second operand has 389 states, 384 states have (on average 1.5729166666666667) internal successors, (604), 384 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:16,354 INFO L74 IsIncluded]: Start isIncluded. First operand 599 states. Second operand has 389 states, 384 states have (on average 1.5729166666666667) internal successors, (604), 384 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:16,355 INFO L87 Difference]: Start difference. First operand 599 states. Second operand has 389 states, 384 states have (on average 1.5729166666666667) internal successors, (604), 384 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:16,370 INFO L93 Difference]: Finished difference Result 599 states and 932 transitions. [2022-04-15 11:46:16,370 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2022-04-15 11:46:16,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:16,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:16,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 389 states, 384 states have (on average 1.5729166666666667) internal successors, (604), 384 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 599 states. [2022-04-15 11:46:16,372 INFO L87 Difference]: Start difference. First operand has 389 states, 384 states have (on average 1.5729166666666667) internal successors, (604), 384 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 599 states. [2022-04-15 11:46:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:16,388 INFO L93 Difference]: Finished difference Result 599 states and 932 transitions. [2022-04-15 11:46:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 932 transitions. [2022-04-15 11:46:16,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:16,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:16,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:16,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.5729166666666667) internal successors, (604), 384 states have internal predecessors, (604), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 608 transitions. [2022-04-15 11:46:16,400 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 608 transitions. Word has length 66 [2022-04-15 11:46:16,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:16,401 INFO L478 AbstractCegarLoop]: Abstraction has 389 states and 608 transitions. [2022-04-15 11:46:16,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:16,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 389 states and 608 transitions. [2022-04-15 11:46:16,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 608 edges. 608 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 608 transitions. [2022-04-15 11:46:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:46:16,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:16,885 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:16,885 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 11:46:16,885 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:16,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1105145420, now seen corresponding path program 1 times [2022-04-15 11:46:16,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:16,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418185079] [2022-04-15 11:46:17,019 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:46:17,020 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:46:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash -827195936, now seen corresponding path program 1 times [2022-04-15 11:46:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:17,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582383544] [2022-04-15 11:46:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:17,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:17,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {15565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15559#true} is VALID [2022-04-15 11:46:17,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {15559#true} assume true; {15559#true} is VALID [2022-04-15 11:46:17,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15559#true} {15559#true} #725#return; {15559#true} is VALID [2022-04-15 11:46:17,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {15559#true} call ULTIMATE.init(); {15565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:46:17,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {15565#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15559#true} is VALID [2022-04-15 11:46:17,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {15559#true} assume true; {15559#true} is VALID [2022-04-15 11:46:17,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15559#true} {15559#true} #725#return; {15559#true} is VALID [2022-04-15 11:46:17,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {15559#true} call #t~ret161 := main(); {15559#true} is VALID [2022-04-15 11:46:17,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {15559#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; {15559#true} is VALID [2022-04-15 11:46:17,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {15559#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15559#true} is VALID [2022-04-15 11:46:17,152 INFO L272 TraceCheckUtils]: 7: Hoare triple {15559#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15559#true} is VALID [2022-04-15 11:46:17,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {15559#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); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {15564#(= 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; {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {15564#(= 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; {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {15564#(= 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)))); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} [735] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_#memory_$Pointer$.offset_323| |v_#memory_$Pointer$.offset_317|)) (.cse1 (= |v_ssl3_accept_#t~mem47_28| |v_ssl3_accept_#t~mem47_26|)) (.cse2 (= |v_ssl3_accept_#t~mem49_10| |v_ssl3_accept_#t~mem49_8|)) (.cse3 (= |v_ssl3_accept_#t~mem83.base_26| |v_ssl3_accept_#t~mem83.base_24|)) (.cse4 (= |v_ssl3_accept_#t~mem83.offset_26| |v_ssl3_accept_#t~mem83.offset_24|)) (.cse5 (= |v_ssl3_accept_#t~mem150.base_24| |v_ssl3_accept_#t~mem150.base_22|)) (.cse6 (= |v_ssl3_accept_#t~mem88.offset_15| |v_ssl3_accept_#t~mem88.offset_14|)) (.cse7 (= |v_ssl3_accept_#t~mem82_26| |v_ssl3_accept_#t~mem82_24|)) (.cse8 (= v_ssl3_accept_~skip~0_27 v_ssl3_accept_~skip~0_26)) (.cse9 (= |v_ssl3_accept_#t~mem88.base_15| |v_ssl3_accept_#t~mem88.base_14|)) (.cse10 (= |v_ssl3_accept_#t~mem89_15| |v_ssl3_accept_#t~mem89_14|)) (.cse11 (= |v_ssl3_accept_#t~mem85_26| |v_ssl3_accept_#t~mem85_24|)) (.cse12 (= |v_ssl3_accept_#t~mem150.offset_24| |v_ssl3_accept_#t~mem150.offset_22|)) (.cse13 (= |v_ssl3_accept_#t~mem151_26| |v_ssl3_accept_#t~mem151_24|)) (.cse14 (= v_ssl3_accept_~state~0_19 v_ssl3_accept_~state~0_18)) (.cse15 (= |v_ssl3_accept_#t~mem48_26| |v_ssl3_accept_#t~mem48_24|)) (.cse16 (= |v_ssl3_accept_#t~mem46_17| |v_ssl3_accept_#t~mem46_16|)) (.cse17 (= |v_#memory_$Pointer$.base_323| |v_#memory_$Pointer$.base_317|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_#memory_int_306| |v_#memory_int_311|) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_#memory_int_311| |v_#memory_int_306|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_323|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_26|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_26|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_26|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_24|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_15|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_26|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_10|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_26|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_24|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_28|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_17|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_27, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_15|, #memory_int=|v_#memory_int_311|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_15|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_323|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_19} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_24|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_317|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_24|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_24|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_24|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_22|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_14|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_24|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_8|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_24|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_22|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_26|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_16|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_26, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_14|, #memory_int=|v_#memory_int_306|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_14|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_317|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_18} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} [734] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {15564#(= 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); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,160 INFO L290 TraceCheckUtils]: 41: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {15564#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:17,163 INFO L290 TraceCheckUtils]: 50: Hoare triple {15564#(= ssl3_accept_~blastFlag~0 0)} assume 15 == ~blastFlag~0; {15560#false} is VALID [2022-04-15 11:46:17,163 INFO L290 TraceCheckUtils]: 51: Hoare triple {15560#false} assume !false; {15560#false} is VALID [2022-04-15 11:46:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:17,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582383544] [2022-04-15 11:46:17,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582383544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:17,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:17,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:46:20,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:20,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418185079] [2022-04-15 11:46:20,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418185079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:20,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:20,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:46:20,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884917706] [2022-04-15 11:46:20,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:20,067 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-15 11:46:20,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:20,067 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-15 11:46:20,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:20,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:46:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:20,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:46:20,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:46:20,141 INFO L87 Difference]: Start difference. First operand 389 states and 608 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-15 11:46:22,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:27,117 INFO L93 Difference]: Finished difference Result 586 states and 922 transitions. [2022-04-15 11:46:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:46:27,118 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-15 11:46:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:27,118 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-15 11:46:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 627 transitions. [2022-04-15 11:46:27,122 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-15 11:46:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 627 transitions. [2022-04-15 11:46:27,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 627 transitions. [2022-04-15 11:46:27,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:27,567 INFO L225 Difference]: With dead ends: 586 [2022-04-15 11:46:27,567 INFO L226 Difference]: Without dead ends: 401 [2022-04-15 11:46:27,567 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:46:27,568 INFO L913 BasicCegarLoop]: 205 mSDtfsCounter, 151 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:27,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 875 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 750 Invalid, 1 Unknown, 277 Unchecked, 4.2s Time] [2022-04-15 11:46:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-15 11:46:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 391. [2022-04-15 11:46:27,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:27,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 391 states, 386 states have (on average 1.572538860103627) internal successors, (607), 386 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:27,580 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 391 states, 386 states have (on average 1.572538860103627) internal successors, (607), 386 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:27,581 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 391 states, 386 states have (on average 1.572538860103627) internal successors, (607), 386 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:27,589 INFO L93 Difference]: Finished difference Result 401 states and 623 transitions. [2022-04-15 11:46:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 623 transitions. [2022-04-15 11:46:27,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:27,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:27,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 391 states, 386 states have (on average 1.572538860103627) internal successors, (607), 386 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-15 11:46:27,591 INFO L87 Difference]: Start difference. First operand has 391 states, 386 states have (on average 1.572538860103627) internal successors, (607), 386 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 401 states. [2022-04-15 11:46:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:27,599 INFO L93 Difference]: Finished difference Result 401 states and 623 transitions. [2022-04-15 11:46:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 623 transitions. [2022-04-15 11:46:27,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:27,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:27,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:27,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.572538860103627) internal successors, (607), 386 states have internal predecessors, (607), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 611 transitions. [2022-04-15 11:46:27,609 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 611 transitions. Word has length 66 [2022-04-15 11:46:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:27,609 INFO L478 AbstractCegarLoop]: Abstraction has 391 states and 611 transitions. [2022-04-15 11:46:27,610 INFO L479 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-15 11:46:27,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 391 states and 611 transitions. [2022-04-15 11:46:28,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 611 edges. 611 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 611 transitions. [2022-04-15 11:46:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 11:46:28,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:28,337 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:28,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 11:46:28,337 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1261549174, now seen corresponding path program 1 times [2022-04-15 11:46:28,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:28,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251215178] [2022-04-15 11:46:28,478 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 19 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:46:28,479 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:46:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1197023712, now seen corresponding path program 1 times [2022-04-15 11:46:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:28,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139447946] [2022-04-15 11:46:28,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:28,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {18340#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18334#true} is VALID [2022-04-15 11:46:28,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {18334#true} assume true; {18334#true} is VALID [2022-04-15 11:46:28,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18334#true} {18334#true} #725#return; {18334#true} is VALID [2022-04-15 11:46:28,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {18334#true} call ULTIMATE.init(); {18340#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:46:28,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {18340#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18334#true} is VALID [2022-04-15 11:46:28,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {18334#true} assume true; {18334#true} is VALID [2022-04-15 11:46:28,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18334#true} {18334#true} #725#return; {18334#true} is VALID [2022-04-15 11:46:28,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {18334#true} call #t~ret161 := main(); {18334#true} is VALID [2022-04-15 11:46:28,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {18334#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; {18334#true} is VALID [2022-04-15 11:46:28,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {18334#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18334#true} is VALID [2022-04-15 11:46:28,598 INFO L272 TraceCheckUtils]: 7: Hoare triple {18334#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18334#true} is VALID [2022-04-15 11:46:28,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {18334#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); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {18339#(= 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; {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {18339#(= 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; {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {18339#(= 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)))); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} [737] L1167-2-->L1168_primed: Formula: (let ((.cse0 (= |v_ssl3_accept_#t~mem82_33| |v_ssl3_accept_#t~mem82_31|)) (.cse1 (= |v_ssl3_accept_#t~mem89_20| |v_ssl3_accept_#t~mem89_19|)) (.cse2 (= |v_ssl3_accept_#t~mem85_33| |v_ssl3_accept_#t~mem85_31|)) (.cse3 (= v_ssl3_accept_~skip~0_32 v_ssl3_accept_~skip~0_31)) (.cse4 (= |v_ssl3_accept_#t~mem151_32| |v_ssl3_accept_#t~mem151_30|)) (.cse5 (= |v_#memory_$Pointer$.offset_343| |v_#memory_$Pointer$.offset_337|)) (.cse6 (= |v_ssl3_accept_#t~mem83.base_33| |v_ssl3_accept_#t~mem83.base_31|)) (.cse7 (= |v_#memory_$Pointer$.base_343| |v_#memory_$Pointer$.base_337|)) (.cse8 (= |v_ssl3_accept_#t~mem46_22| |v_ssl3_accept_#t~mem46_21|)) (.cse9 (= |v_ssl3_accept_#t~mem47_35| |v_ssl3_accept_#t~mem47_33|)) (.cse10 (= v_ssl3_accept_~state~0_24 v_ssl3_accept_~state~0_23)) (.cse11 (= |v_ssl3_accept_#t~mem83.offset_33| |v_ssl3_accept_#t~mem83.offset_31|)) (.cse12 (= |v_ssl3_accept_#t~mem48_33| |v_ssl3_accept_#t~mem48_31|))) (or (and .cse0 .cse1 .cse2 (= |v_ssl3_accept_#t~mem49_17| |v_ssl3_accept_#t~mem49_15|) .cse3 .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem150.offset_30| |v_ssl3_accept_#t~mem150.offset_28|) .cse7 .cse8 .cse9 .cse10 (= |v_ssl3_accept_#t~mem150.base_30| |v_ssl3_accept_#t~mem150.base_28|) (= |v_#memory_int_330| |v_#memory_int_325|) .cse11 (= |v_ssl3_accept_#t~mem88.base_20| |v_ssl3_accept_#t~mem88.base_19|) .cse12 (= |v_ssl3_accept_#t~mem88.offset_20| |v_ssl3_accept_#t~mem88.offset_19|)) (and (= |v_ssl3_accept_#t~mem150.offset_28| |v_ssl3_accept_#t~mem150.offset_30|) .cse0 (= |v_#memory_int_325| |v_#memory_int_330|) .cse1 .cse2 (= |v_ssl3_accept_#t~mem150.base_28| |v_ssl3_accept_#t~mem150.base_30|) (= |v_ssl3_accept_#t~mem88.base_19| |v_ssl3_accept_#t~mem88.base_20|) .cse3 .cse4 .cse5 .cse6 (= |v_ssl3_accept_#t~mem88.offset_19| |v_ssl3_accept_#t~mem88.offset_20|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |v_ssl3_accept_#t~mem49_15| |v_ssl3_accept_#t~mem49_17|) .cse12))) InVars {ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_33|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_343|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_33|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_33|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_32|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_30|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_20|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_33|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_17|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_33|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_30|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_35|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_22|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_32, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_20|, #memory_int=|v_#memory_int_330|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_20|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_343|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_24} OutVars{ssl3_accept_#t~mem83.base=|v_ssl3_accept_#t~mem83.base_31|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_337|, ssl3_accept_#t~mem82=|v_ssl3_accept_#t~mem82_31|, ssl3_accept_#t~mem85=|v_ssl3_accept_#t~mem85_31|, ssl3_accept_#t~mem151=|v_ssl3_accept_#t~mem151_30|, ssl3_accept_#t~mem150.base=|v_ssl3_accept_#t~mem150.base_28|, ssl3_accept_#t~mem88.base=|v_ssl3_accept_#t~mem88.base_19|, ssl3_accept_#t~mem83.offset=|v_ssl3_accept_#t~mem83.offset_31|, ssl3_accept_#t~mem49=|v_ssl3_accept_#t~mem49_15|, ssl3_accept_#t~mem48=|v_ssl3_accept_#t~mem48_31|, ssl3_accept_#t~mem150.offset=|v_ssl3_accept_#t~mem150.offset_28|, ssl3_accept_#t~mem47=|v_ssl3_accept_#t~mem47_33|, ssl3_accept_#t~mem46=|v_ssl3_accept_#t~mem46_21|, ssl3_accept_~skip~0=v_ssl3_accept_~skip~0_31, ssl3_accept_#t~mem88.offset=|v_ssl3_accept_#t~mem88.offset_19|, #memory_int=|v_#memory_int_325|, ssl3_accept_#t~mem89=|v_ssl3_accept_#t~mem89_19|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_337|, ssl3_accept_~state~0=v_ssl3_accept_~state~0_23} AuxVars[] AssignedVars[ssl3_accept_#t~mem83.base, #memory_$Pointer$.base, ssl3_accept_#t~mem82, ssl3_accept_#t~mem85, ssl3_accept_#t~mem151, ssl3_accept_#t~mem150.base, ssl3_accept_#t~mem88.base, ssl3_accept_#t~mem83.offset, ssl3_accept_#t~mem49, ssl3_accept_#t~mem48, ssl3_accept_#t~mem150.offset, ssl3_accept_#t~mem47, ssl3_accept_#t~mem46, ssl3_accept_~skip~0, ssl3_accept_#t~mem88.offset, #memory_int, ssl3_accept_#t~mem89, #memory_$Pointer$.offset, ssl3_accept_~state~0] {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} [736] L1168_primed-->L1168: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {18339#(= 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); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,604 INFO L290 TraceCheckUtils]: 22: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,607 INFO L290 TraceCheckUtils]: 34: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,609 INFO L290 TraceCheckUtils]: 41: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,609 INFO L290 TraceCheckUtils]: 42: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,609 INFO L290 TraceCheckUtils]: 43: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,610 INFO L290 TraceCheckUtils]: 44: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,610 INFO L290 TraceCheckUtils]: 45: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume 8641 == #t~mem76;havoc #t~mem76; {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(9 == ~blastFlag~0); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume !(12 == ~blastFlag~0); {18339#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-15 11:46:28,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {18339#(= ssl3_accept_~blastFlag~0 0)} assume 15 == ~blastFlag~0; {18335#false} is VALID [2022-04-15 11:46:28,611 INFO L290 TraceCheckUtils]: 51: Hoare triple {18335#false} assume !false; {18335#false} is VALID [2022-04-15 11:46:28,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:28,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:28,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139447946] [2022-04-15 11:46:28,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139447946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:28,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:28,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:46:31,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:31,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251215178] [2022-04-15 11:46:31,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251215178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:31,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:31,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 11:46:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764866773] [2022-04-15 11:46:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:31,590 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-15 11:46:31,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:31,591 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-15 11:46:31,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:31,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 11:46:31,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:31,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 11:46:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:46:31,648 INFO L87 Difference]: Start difference. First operand 391 states and 611 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-15 11:46:33,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:35,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:44,028 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-15 11:46:46,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:48,391 INFO L93 Difference]: Finished difference Result 778 states and 1231 transitions. [2022-04-15 11:46:48,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 11:46:48,391 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-15 11:46:48,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:48,392 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-15 11:46:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 661 transitions. [2022-04-15 11:46:48,394 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-15 11:46:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 661 transitions. [2022-04-15 11:46:48,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 661 transitions. [2022-04-15 11:46:48,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 661 edges. 661 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:48,874 INFO L225 Difference]: With dead ends: 778 [2022-04-15 11:46:48,874 INFO L226 Difference]: Without dead ends: 593 [2022-04-15 11:46:48,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=51, Invalid=130, Unknown=1, NotChecked=0, Total=182 [2022-04-15 11:46:48,876 INFO L913 BasicCegarLoop]: 196 mSDtfsCounter, 162 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:48,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 749 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 840 Invalid, 0 Unknown, 31 Unchecked, 9.2s Time] [2022-04-15 11:46:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-04-15 11:46:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 571. [2022-04-15 11:46:48,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:48,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand has 571 states, 566 states have (on average 1.5636042402826855) internal successors, (885), 566 states have internal predecessors, (885), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:48,901 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand has 571 states, 566 states have (on average 1.5636042402826855) internal successors, (885), 566 states have internal predecessors, (885), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:48,902 INFO L87 Difference]: Start difference. First operand 593 states. Second operand has 571 states, 566 states have (on average 1.5636042402826855) internal successors, (885), 566 states have internal predecessors, (885), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:48,916 INFO L93 Difference]: Finished difference Result 593 states and 916 transitions. [2022-04-15 11:46:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 916 transitions. [2022-04-15 11:46:48,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:48,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:48,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 571 states, 566 states have (on average 1.5636042402826855) internal successors, (885), 566 states have internal predecessors, (885), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 593 states. [2022-04-15 11:46:48,919 INFO L87 Difference]: Start difference. First operand has 571 states, 566 states have (on average 1.5636042402826855) internal successors, (885), 566 states have internal predecessors, (885), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 593 states. [2022-04-15 11:46:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:48,932 INFO L93 Difference]: Finished difference Result 593 states and 916 transitions. [2022-04-15 11:46:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 916 transitions. [2022-04-15 11:46:48,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:48,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:48,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:48,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:48,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 566 states have (on average 1.5636042402826855) internal successors, (885), 566 states have internal predecessors, (885), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 889 transitions. [2022-04-15 11:46:48,950 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 889 transitions. Word has length 66 [2022-04-15 11:46:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:48,950 INFO L478 AbstractCegarLoop]: Abstraction has 571 states and 889 transitions. [2022-04-15 11:46:48,950 INFO L479 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-15 11:46:48,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 571 states and 889 transitions. [2022-04-15 11:46:50,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 889 edges. 889 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:50,155 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 889 transitions. [2022-04-15 11:46:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 11:46:50,156 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:46:50,156 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:46:50,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 11:46:50,156 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:46:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:46:50,156 INFO L85 PathProgramCache]: Analyzing trace with hash -613660514, now seen corresponding path program 1 times [2022-04-15 11:46:50,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:50,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307241826] [2022-04-15 11:46:50,175 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:46:50,175 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:46:50,175 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:46:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash -613660514, now seen corresponding path program 2 times [2022-04-15 11:46:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:46:50,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846853081] [2022-04-15 11:46:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:46:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:46:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:46:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:46:50,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {22244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22237#true} is VALID [2022-04-15 11:46:50,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {22237#true} assume true; {22237#true} is VALID [2022-04-15 11:46:50,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22237#true} {22237#true} #725#return; {22237#true} is VALID [2022-04-15 11:46:50,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {22237#true} call ULTIMATE.init(); {22244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:46:50,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {22244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {22237#true} is VALID [2022-04-15 11:46:50,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {22237#true} assume true; {22237#true} is VALID [2022-04-15 11:46:50,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22237#true} {22237#true} #725#return; {22237#true} is VALID [2022-04-15 11:46:50,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {22237#true} call #t~ret161 := main(); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {22237#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; {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {22237#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L272 TraceCheckUtils]: 7: Hoare triple {22237#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {22237#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); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {22237#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; {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {22237#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; {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {22237#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {22237#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {22237#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {22237#true} assume !false; {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {22237#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {22237#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {22237#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {22237#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {22237#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {22237#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {22237#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {22237#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {22237#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {22237#true} assume 8464 == #t~mem55;havoc #t~mem55; {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {22237#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; {22237#true} is VALID [2022-04-15 11:46:50,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {22237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {22237#true} is VALID [2022-04-15 11:46:50,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {22237#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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {22242#(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; {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,348 INFO L290 TraceCheckUtils]: 33: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,350 INFO L290 TraceCheckUtils]: 38: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,352 INFO L290 TraceCheckUtils]: 44: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,353 INFO L290 TraceCheckUtils]: 45: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,353 INFO L290 TraceCheckUtils]: 46: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,354 INFO L290 TraceCheckUtils]: 49: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,355 INFO L290 TraceCheckUtils]: 50: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,355 INFO L290 TraceCheckUtils]: 51: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,355 INFO L290 TraceCheckUtils]: 52: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,356 INFO L290 TraceCheckUtils]: 54: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,356 INFO L290 TraceCheckUtils]: 55: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,357 INFO L290 TraceCheckUtils]: 56: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,357 INFO L290 TraceCheckUtils]: 57: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,358 INFO L290 TraceCheckUtils]: 58: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,358 INFO L290 TraceCheckUtils]: 59: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,358 INFO L290 TraceCheckUtils]: 60: Hoare triple {22242#(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); {22242#(not (= 8641 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:46:50,359 INFO L290 TraceCheckUtils]: 61: Hoare triple {22242#(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); {22243#(not (= |ssl3_accept_#t~mem76| 8641))} is VALID [2022-04-15 11:46:50,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {22243#(not (= |ssl3_accept_#t~mem76| 8641))} assume 8641 == #t~mem76;havoc #t~mem76; {22238#false} is VALID [2022-04-15 11:46:50,359 INFO L290 TraceCheckUtils]: 63: Hoare triple {22238#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {22238#false} is VALID [2022-04-15 11:46:50,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {22238#false} assume !(9 == ~blastFlag~0); {22238#false} is VALID [2022-04-15 11:46:50,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {22238#false} assume !(12 == ~blastFlag~0); {22238#false} is VALID [2022-04-15 11:46:50,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {22238#false} assume 15 == ~blastFlag~0; {22238#false} is VALID [2022-04-15 11:46:50,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {22238#false} assume !false; {22238#false} is VALID [2022-04-15 11:46:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:46:50,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:46:50,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846853081] [2022-04-15 11:46:50,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846853081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:50,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:50,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:50,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:46:50,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307241826] [2022-04-15 11:46:50,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307241826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:46:50,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:46:50,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:46:50,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726895427] [2022-04-15 11:46:50,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:46:50,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:46:50,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:46:50,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:50,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:46:50,419 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:46:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:46:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:46:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:46:50,419 INFO L87 Difference]: Start difference. First operand 571 states and 889 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:55,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:46:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:58,587 INFO L93 Difference]: Finished difference Result 1442 states and 2238 transitions. [2022-04-15 11:46:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:46:58,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-15 11:46:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:46:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2022-04-15 11:46:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2022-04-15 11:46:58,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 630 transitions. [2022-04-15 11:46:59,002 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-15 11:46:59,038 INFO L225 Difference]: With dead ends: 1442 [2022-04-15 11:46:59,038 INFO L226 Difference]: Without dead ends: 897 [2022-04-15 11:46:59,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:46:59,039 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 133 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:46:59,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 402 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 11:46:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-04-15 11:46:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 655. [2022-04-15 11:46:59,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:46:59,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 897 states. Second operand has 655 states, 650 states have (on average 1.6153846153846154) internal successors, (1050), 650 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:59,062 INFO L74 IsIncluded]: Start isIncluded. First operand 897 states. Second operand has 655 states, 650 states have (on average 1.6153846153846154) internal successors, (1050), 650 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:59,062 INFO L87 Difference]: Start difference. First operand 897 states. Second operand has 655 states, 650 states have (on average 1.6153846153846154) internal successors, (1050), 650 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:59,090 INFO L93 Difference]: Finished difference Result 897 states and 1381 transitions. [2022-04-15 11:46:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1381 transitions. [2022-04-15 11:46:59,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:59,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:59,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 655 states, 650 states have (on average 1.6153846153846154) internal successors, (1050), 650 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 897 states. [2022-04-15 11:46:59,093 INFO L87 Difference]: Start difference. First operand has 655 states, 650 states have (on average 1.6153846153846154) internal successors, (1050), 650 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 897 states. [2022-04-15 11:46:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:46:59,120 INFO L93 Difference]: Finished difference Result 897 states and 1381 transitions. [2022-04-15 11:46:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1381 transitions. [2022-04-15 11:46:59,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:46:59,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:46:59,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:46:59,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:46:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.6153846153846154) internal successors, (1050), 650 states have internal predecessors, (1050), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1054 transitions. [2022-04-15 11:46:59,143 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1054 transitions. Word has length 68 [2022-04-15 11:46:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:46:59,143 INFO L478 AbstractCegarLoop]: Abstraction has 655 states and 1054 transitions. [2022-04-15 11:46:59,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:46:59,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 655 states and 1054 transitions. [2022-04-15 11:47:00,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1054 edges. 1054 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1054 transitions. [2022-04-15 11:47:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 11:47:00,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:00,452 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:00,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 11:47:00,452 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:00,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash 678741447, now seen corresponding path program 1 times [2022-04-15 11:47:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:00,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359673848] [2022-04-15 11:47:00,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:00,494 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:00,495 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash 678741447, now seen corresponding path program 2 times [2022-04-15 11:47:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:00,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282203622] [2022-04-15 11:47:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:00,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {28244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28237#true} is VALID [2022-04-15 11:47:00,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {28237#true} assume true; {28237#true} is VALID [2022-04-15 11:47:00,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28237#true} {28237#true} #725#return; {28237#true} is VALID [2022-04-15 11:47:00,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {28237#true} call ULTIMATE.init(); {28244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:00,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {28244#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28237#true} is VALID [2022-04-15 11:47:00,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {28237#true} assume true; {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28237#true} {28237#true} #725#return; {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {28237#true} call #t~ret161 := main(); {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {28237#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; {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {28237#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L272 TraceCheckUtils]: 7: Hoare triple {28237#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {28237#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); {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {28237#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; {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {28237#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; {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {28237#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {28237#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {28237#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {28237#true} assume !false; {28237#true} is VALID [2022-04-15 11:47:00,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {28237#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {28237#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {28237#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {28237#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {28237#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {28237#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {28237#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {28237#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {28237#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {28237#true} assume 8464 == #t~mem55;havoc #t~mem55; {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {28237#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; {28237#true} is VALID [2022-04-15 11:47:00,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {28237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28237#true} is VALID [2022-04-15 11:47:00,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {28237#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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {28242#(= 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; {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,644 INFO L290 TraceCheckUtils]: 40: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,645 INFO L290 TraceCheckUtils]: 42: Hoare triple {28242#(= 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); {28242#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:00,645 INFO L290 TraceCheckUtils]: 43: Hoare triple {28242#(= 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); {28243#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-15 11:47:00,645 INFO L290 TraceCheckUtils]: 44: Hoare triple {28243#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {28238#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 46: Hoare triple {28238#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {28238#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {28238#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 49: Hoare triple {28238#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {28238#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {28238#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {28238#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {28238#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {28238#false} assume 8448 == #t~mem68;havoc #t~mem68; {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 55: Hoare triple {28238#false} assume !(~num1~0 > 0); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {28238#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; {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {28238#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); {28238#false} is VALID [2022-04-15 11:47:00,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {28238#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {28238#false} ~skip~0 := 0; {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {28238#false} assume !false; {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {28238#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); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {28238#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 63: Hoare triple {28238#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 64: Hoare triple {28238#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 65: Hoare triple {28238#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {28238#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {28238#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {28238#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 69: Hoare triple {28238#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 70: Hoare triple {28238#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 71: Hoare triple {28238#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,647 INFO L290 TraceCheckUtils]: 72: Hoare triple {28238#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 73: Hoare triple {28238#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 74: Hoare triple {28238#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 75: Hoare triple {28238#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 76: Hoare triple {28238#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 77: Hoare triple {28238#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 78: Hoare triple {28238#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 79: Hoare triple {28238#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 80: Hoare triple {28238#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 81: Hoare triple {28238#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 82: Hoare triple {28238#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 83: Hoare triple {28238#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 84: Hoare triple {28238#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,648 INFO L290 TraceCheckUtils]: 85: Hoare triple {28238#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 86: Hoare triple {28238#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 87: Hoare triple {28238#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 88: Hoare triple {28238#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 89: Hoare triple {28238#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 90: Hoare triple {28238#false} assume 8640 == #t~mem75;havoc #t~mem75; {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 91: Hoare triple {28238#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 92: Hoare triple {28238#false} assume !(9 == ~blastFlag~0); {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 93: Hoare triple {28238#false} assume !(12 == ~blastFlag~0); {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 94: Hoare triple {28238#false} assume 15 == ~blastFlag~0; {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L290 TraceCheckUtils]: 95: Hoare triple {28238#false} assume !false; {28238#false} is VALID [2022-04-15 11:47:00,649 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 11:47:00,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282203622] [2022-04-15 11:47:00,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282203622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:00,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:00,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:00,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359673848] [2022-04-15 11:47:00,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359673848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:00,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:00,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:00,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166757682] [2022-04-15 11:47:00,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:00,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 11:47:00,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:00,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:00,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:00,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:00,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:00,716 INFO L87 Difference]: Start difference. First operand 655 states and 1054 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:02,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:09,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:09,868 INFO L93 Difference]: Finished difference Result 911 states and 1472 transitions. [2022-04-15 11:47:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-15 11:47:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-04-15 11:47:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2022-04-15 11:47:09,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 500 transitions. [2022-04-15 11:47:10,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:10,224 INFO L225 Difference]: With dead ends: 911 [2022-04-15 11:47:10,224 INFO L226 Difference]: Without dead ends: 698 [2022-04-15 11:47:10,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:10,225 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 33 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:10,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 631 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 11:47:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-04-15 11:47:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 677. [2022-04-15 11:47:10,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:10,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand has 677 states, 672 states have (on average 1.6175595238095237) internal successors, (1087), 672 states have internal predecessors, (1087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,253 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand has 677 states, 672 states have (on average 1.6175595238095237) internal successors, (1087), 672 states have internal predecessors, (1087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,253 INFO L87 Difference]: Start difference. First operand 698 states. Second operand has 677 states, 672 states have (on average 1.6175595238095237) internal successors, (1087), 672 states have internal predecessors, (1087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:10,269 INFO L93 Difference]: Finished difference Result 698 states and 1118 transitions. [2022-04-15 11:47:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1118 transitions. [2022-04-15 11:47:10,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:10,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:10,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 677 states, 672 states have (on average 1.6175595238095237) internal successors, (1087), 672 states have internal predecessors, (1087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 698 states. [2022-04-15 11:47:10,272 INFO L87 Difference]: Start difference. First operand has 677 states, 672 states have (on average 1.6175595238095237) internal successors, (1087), 672 states have internal predecessors, (1087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 698 states. [2022-04-15 11:47:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:10,288 INFO L93 Difference]: Finished difference Result 698 states and 1118 transitions. [2022-04-15 11:47:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1118 transitions. [2022-04-15 11:47:10,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:10,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:10,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:10,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 672 states have (on average 1.6175595238095237) internal successors, (1087), 672 states have internal predecessors, (1087), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1091 transitions. [2022-04-15 11:47:10,311 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1091 transitions. Word has length 96 [2022-04-15 11:47:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:10,311 INFO L478 AbstractCegarLoop]: Abstraction has 677 states and 1091 transitions. [2022-04-15 11:47:10,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:10,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 677 states and 1091 transitions. [2022-04-15 11:47:11,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1091 edges. 1091 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1091 transitions. [2022-04-15 11:47:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 11:47:11,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:11,767 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:11,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 11:47:11,767 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:11,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:11,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2067454211, now seen corresponding path program 1 times [2022-04-15 11:47:11,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:11,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613658737] [2022-04-15 11:47:11,829 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:11,829 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:11,829 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:11,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2067454211, now seen corresponding path program 2 times [2022-04-15 11:47:11,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:11,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557193858] [2022-04-15 11:47:11,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:11,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:11,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:11,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {32828#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32821#true} is VALID [2022-04-15 11:47:11,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {32821#true} assume true; {32821#true} is VALID [2022-04-15 11:47:11,984 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32821#true} {32821#true} #725#return; {32821#true} is VALID [2022-04-15 11:47:11,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {32821#true} call ULTIMATE.init(); {32828#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:11,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {32828#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {32821#true} is VALID [2022-04-15 11:47:11,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {32821#true} assume true; {32821#true} is VALID [2022-04-15 11:47:11,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32821#true} {32821#true} #725#return; {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {32821#true} call #t~ret161 := main(); {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {32821#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; {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {32821#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L272 TraceCheckUtils]: 7: Hoare triple {32821#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {32821#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); {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {32821#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; {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {32821#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; {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {32821#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {32821#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {32821#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {32821#true} assume !false; {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {32821#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {32821#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {32821#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {32821#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {32821#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {32821#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 21: Hoare triple {32821#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {32821#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {32821#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {32821#true} assume 8464 == #t~mem55;havoc #t~mem55; {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {32821#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; {32821#true} is VALID [2022-04-15 11:47:11,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {32821#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {32821#true} is VALID [2022-04-15 11:47:11,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {32821#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); {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {32826#(= 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); {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {32826#(= 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; {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {32826#(= 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); {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {32826#(= 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); {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,991 INFO L290 TraceCheckUtils]: 34: Hoare triple {32826#(= 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); {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {32826#(= 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); {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {32826#(= 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); {32826#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:11,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {32826#(= 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); {32827#(= |ssl3_accept_#t~mem52| 8496)} is VALID [2022-04-15 11:47:11,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {32827#(= |ssl3_accept_#t~mem52| 8496)} assume 8480 == #t~mem52;havoc #t~mem52; {32822#false} is VALID [2022-04-15 11:47:11,992 INFO L290 TraceCheckUtils]: 39: Hoare triple {32822#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; {32822#false} is VALID [2022-04-15 11:47:11,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {32822#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); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {32822#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); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {32822#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 43: Hoare triple {32822#false} ~skip~0 := 0; {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {32822#false} assume !false; {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {32822#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); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {32822#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {32822#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {32822#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {32822#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {32822#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {32822#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {32822#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {32822#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {32822#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 55: Hoare triple {32822#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {32822#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {32822#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {32822#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {32822#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {32822#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {32822#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {32822#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {32822#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {32822#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {32822#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {32822#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {32822#false} assume 8448 == #t~mem68;havoc #t~mem68; {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {32822#false} assume !(~num1~0 > 0); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {32822#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; {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {32822#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); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {32822#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 72: Hoare triple {32822#false} ~skip~0 := 0; {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 73: Hoare triple {32822#false} assume !false; {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 74: Hoare triple {32822#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); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 75: Hoare triple {32822#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 76: Hoare triple {32822#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 77: Hoare triple {32822#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 78: Hoare triple {32822#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,995 INFO L290 TraceCheckUtils]: 79: Hoare triple {32822#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 80: Hoare triple {32822#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 81: Hoare triple {32822#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 82: Hoare triple {32822#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 83: Hoare triple {32822#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 84: Hoare triple {32822#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 85: Hoare triple {32822#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 86: Hoare triple {32822#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 87: Hoare triple {32822#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 88: Hoare triple {32822#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 89: Hoare triple {32822#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 90: Hoare triple {32822#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 91: Hoare triple {32822#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 92: Hoare triple {32822#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,996 INFO L290 TraceCheckUtils]: 93: Hoare triple {32822#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 94: Hoare triple {32822#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 95: Hoare triple {32822#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 96: Hoare triple {32822#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 97: Hoare triple {32822#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 98: Hoare triple {32822#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 99: Hoare triple {32822#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 100: Hoare triple {32822#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 101: Hoare triple {32822#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 102: Hoare triple {32822#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 103: Hoare triple {32822#false} assume 8640 == #t~mem75;havoc #t~mem75; {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 104: Hoare triple {32822#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 105: Hoare triple {32822#false} assume !(9 == ~blastFlag~0); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 106: Hoare triple {32822#false} assume !(12 == ~blastFlag~0); {32822#false} is VALID [2022-04-15 11:47:11,997 INFO L290 TraceCheckUtils]: 107: Hoare triple {32822#false} assume 15 == ~blastFlag~0; {32822#false} is VALID [2022-04-15 11:47:11,998 INFO L290 TraceCheckUtils]: 108: Hoare triple {32822#false} assume !false; {32822#false} is VALID [2022-04-15 11:47:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:47:11,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:11,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557193858] [2022-04-15 11:47:11,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557193858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:11,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:11,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:11,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:11,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613658737] [2022-04-15 11:47:11,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613658737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:11,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:11,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:11,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289248707] [2022-04-15 11:47:11,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:11,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 11:47:11,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:12,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:12,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:12,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:12,057 INFO L87 Difference]: Start difference. First operand 677 states and 1091 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:15,459 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-15 11:47:17,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:23,518 INFO L93 Difference]: Finished difference Result 933 states and 1508 transitions. [2022-04-15 11:47:23,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2022-04-15 11:47:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-04-15 11:47:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2022-04-15 11:47:23,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 499 transitions. [2022-04-15 11:47:23,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 499 edges. 499 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:23,882 INFO L225 Difference]: With dead ends: 933 [2022-04-15 11:47:23,882 INFO L226 Difference]: Without dead ends: 698 [2022-04-15 11:47:23,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:23,883 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 38 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:23,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 631 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 11:47:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-04-15 11:47:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 677. [2022-04-15 11:47:23,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:23,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand has 677 states, 672 states have (on average 1.6160714285714286) internal successors, (1086), 672 states have internal predecessors, (1086), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:23,916 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand has 677 states, 672 states have (on average 1.6160714285714286) internal successors, (1086), 672 states have internal predecessors, (1086), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:23,916 INFO L87 Difference]: Start difference. First operand 698 states. Second operand has 677 states, 672 states have (on average 1.6160714285714286) internal successors, (1086), 672 states have internal predecessors, (1086), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:23,940 INFO L93 Difference]: Finished difference Result 698 states and 1117 transitions. [2022-04-15 11:47:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1117 transitions. [2022-04-15 11:47:23,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:23,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:23,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 677 states, 672 states have (on average 1.6160714285714286) internal successors, (1086), 672 states have internal predecessors, (1086), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 698 states. [2022-04-15 11:47:23,943 INFO L87 Difference]: Start difference. First operand has 677 states, 672 states have (on average 1.6160714285714286) internal successors, (1086), 672 states have internal predecessors, (1086), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 698 states. [2022-04-15 11:47:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:23,968 INFO L93 Difference]: Finished difference Result 698 states and 1117 transitions. [2022-04-15 11:47:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1117 transitions. [2022-04-15 11:47:23,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:23,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:23,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:23,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 672 states have (on average 1.6160714285714286) internal successors, (1086), 672 states have internal predecessors, (1086), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1090 transitions. [2022-04-15 11:47:23,993 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1090 transitions. Word has length 109 [2022-04-15 11:47:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:23,993 INFO L478 AbstractCegarLoop]: Abstraction has 677 states and 1090 transitions. [2022-04-15 11:47:23,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:23,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 677 states and 1090 transitions. [2022-04-15 11:47:25,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1090 edges. 1090 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1090 transitions. [2022-04-15 11:47:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 11:47:25,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:25,741 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:25,741 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 11:47:25,741 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1858608041, now seen corresponding path program 1 times [2022-04-15 11:47:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:25,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384976033] [2022-04-15 11:47:25,799 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:25,799 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:25,799 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1858608041, now seen corresponding path program 2 times [2022-04-15 11:47:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:25,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059164919] [2022-04-15 11:47:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:25,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:25,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {37456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37449#true} is VALID [2022-04-15 11:47:25,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {37449#true} assume true; {37449#true} is VALID [2022-04-15 11:47:25,940 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37449#true} {37449#true} #725#return; {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {37449#true} call ULTIMATE.init(); {37456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {37456#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {37449#true} assume true; {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37449#true} {37449#true} #725#return; {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {37449#true} call #t~ret161 := main(); {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {37449#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; {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {37449#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L272 TraceCheckUtils]: 7: Hoare triple {37449#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {37449#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); {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {37449#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; {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {37449#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; {37449#true} is VALID [2022-04-15 11:47:25,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {37449#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {37449#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {37449#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {37449#true} assume !false; {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {37449#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {37449#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {37449#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {37449#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {37449#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {37449#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {37449#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {37449#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {37449#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {37449#true} assume 8464 == #t~mem55;havoc #t~mem55; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {37449#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; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {37449#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {37449#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); {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 28: Hoare triple {37449#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); {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {37449#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {37449#true} ~skip~0 := 0; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {37449#true} assume !false; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {37449#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {37449#true} assume 12292 == #t~mem47;havoc #t~mem47; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {37449#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {37449#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {37449#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {37449#true} is VALID [2022-04-15 11:47:25,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {37449#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {37449#true} is VALID [2022-04-15 11:47:25,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {37449#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); {37449#true} is VALID [2022-04-15 11:47:25,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {37449#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {37449#true} is VALID [2022-04-15 11:47:25,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {37449#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); {37449#true} is VALID [2022-04-15 11:47:25,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {37449#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); {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {37454#(= 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); {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {37454#(= 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; {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,949 INFO L290 TraceCheckUtils]: 45: Hoare triple {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {37454#(= 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); {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {37454#(= 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); {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {37454#(= 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); {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {37454#(= 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); {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {37454#(= 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); {37454#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {37454#(= 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); {37455#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {37455#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {37450#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {37450#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 55: Hoare triple {37450#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {37450#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {37450#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 58: Hoare triple {37450#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,952 INFO L290 TraceCheckUtils]: 59: Hoare triple {37450#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {37450#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {37450#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 62: Hoare triple {37450#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 63: Hoare triple {37450#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {37450#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {37450#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {37450#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 67: Hoare triple {37450#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 68: Hoare triple {37450#false} assume 8448 == #t~mem68;havoc #t~mem68; {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 69: Hoare triple {37450#false} assume !(~num1~0 > 0); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 70: Hoare triple {37450#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; {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 71: Hoare triple {37450#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); {37450#false} is VALID [2022-04-15 11:47:25,953 INFO L290 TraceCheckUtils]: 72: Hoare triple {37450#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 73: Hoare triple {37450#false} ~skip~0 := 0; {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 74: Hoare triple {37450#false} assume !false; {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 75: Hoare triple {37450#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); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 76: Hoare triple {37450#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 77: Hoare triple {37450#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 78: Hoare triple {37450#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 79: Hoare triple {37450#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 80: Hoare triple {37450#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 81: Hoare triple {37450#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 82: Hoare triple {37450#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 83: Hoare triple {37450#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 84: Hoare triple {37450#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 85: Hoare triple {37450#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,954 INFO L290 TraceCheckUtils]: 86: Hoare triple {37450#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 87: Hoare triple {37450#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 88: Hoare triple {37450#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 89: Hoare triple {37450#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 90: Hoare triple {37450#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 91: Hoare triple {37450#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 92: Hoare triple {37450#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 93: Hoare triple {37450#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 94: Hoare triple {37450#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 95: Hoare triple {37450#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 96: Hoare triple {37450#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 97: Hoare triple {37450#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 98: Hoare triple {37450#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,955 INFO L290 TraceCheckUtils]: 99: Hoare triple {37450#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 100: Hoare triple {37450#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 101: Hoare triple {37450#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 102: Hoare triple {37450#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 103: Hoare triple {37450#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 104: Hoare triple {37450#false} assume 8640 == #t~mem75;havoc #t~mem75; {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 105: Hoare triple {37450#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 106: Hoare triple {37450#false} assume !(9 == ~blastFlag~0); {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 107: Hoare triple {37450#false} assume !(12 == ~blastFlag~0); {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 108: Hoare triple {37450#false} assume 15 == ~blastFlag~0; {37450#false} is VALID [2022-04-15 11:47:25,956 INFO L290 TraceCheckUtils]: 109: Hoare triple {37450#false} assume !false; {37450#false} is VALID [2022-04-15 11:47:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 11:47:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059164919] [2022-04-15 11:47:25,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059164919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:25,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:25,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:25,957 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:25,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384976033] [2022-04-15 11:47:25,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384976033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:25,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:25,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:25,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236029996] [2022-04-15 11:47:25,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:25,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 11:47:25,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:25,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:26,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:26,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:26,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:26,024 INFO L87 Difference]: Start difference. First operand 677 states and 1090 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:33,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:35,126 INFO L93 Difference]: Finished difference Result 1194 states and 1916 transitions. [2022-04-15 11:47:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 11:47:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:35,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:47:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-15 11:47:35,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-15 11:47:35,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:35,467 INFO L225 Difference]: With dead ends: 1194 [2022-04-15 11:47:35,467 INFO L226 Difference]: Without dead ends: 742 [2022-04-15 11:47:35,468 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:35,468 INFO L913 BasicCegarLoop]: 244 mSDtfsCounter, 21 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:35,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 613 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 11:47:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-04-15 11:47:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 709. [2022-04-15 11:47:35,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:35,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 742 states. Second operand has 709 states, 704 states have (on average 1.6136363636363635) internal successors, (1136), 704 states have internal predecessors, (1136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,497 INFO L74 IsIncluded]: Start isIncluded. First operand 742 states. Second operand has 709 states, 704 states have (on average 1.6136363636363635) internal successors, (1136), 704 states have internal predecessors, (1136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,498 INFO L87 Difference]: Start difference. First operand 742 states. Second operand has 709 states, 704 states have (on average 1.6136363636363635) internal successors, (1136), 704 states have internal predecessors, (1136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:35,515 INFO L93 Difference]: Finished difference Result 742 states and 1181 transitions. [2022-04-15 11:47:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1181 transitions. [2022-04-15 11:47:35,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:35,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:35,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 709 states, 704 states have (on average 1.6136363636363635) internal successors, (1136), 704 states have internal predecessors, (1136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 742 states. [2022-04-15 11:47:35,523 INFO L87 Difference]: Start difference. First operand has 709 states, 704 states have (on average 1.6136363636363635) internal successors, (1136), 704 states have internal predecessors, (1136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 742 states. [2022-04-15 11:47:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:35,541 INFO L93 Difference]: Finished difference Result 742 states and 1181 transitions. [2022-04-15 11:47:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1181 transitions. [2022-04-15 11:47:35,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:35,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:35,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:35,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 704 states have (on average 1.6136363636363635) internal successors, (1136), 704 states have internal predecessors, (1136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1140 transitions. [2022-04-15 11:47:35,567 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1140 transitions. Word has length 110 [2022-04-15 11:47:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:35,567 INFO L478 AbstractCegarLoop]: Abstraction has 709 states and 1140 transitions. [2022-04-15 11:47:35,568 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:35,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 709 states and 1140 transitions. [2022-04-15 11:47:37,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1140 edges. 1140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:37,568 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1140 transitions. [2022-04-15 11:47:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 11:47:37,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:37,570 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:37,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 11:47:37,570 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:37,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -287017090, now seen corresponding path program 1 times [2022-04-15 11:47:37,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:37,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520608423] [2022-04-15 11:47:37,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:37,651 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:37,651 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:37,651 INFO L85 PathProgramCache]: Analyzing trace with hash -287017090, now seen corresponding path program 2 times [2022-04-15 11:47:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:37,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517208478] [2022-04-15 11:47:37,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:37,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:37,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {42758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42751#true} is VALID [2022-04-15 11:47:37,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {42751#true} assume true; {42751#true} is VALID [2022-04-15 11:47:37,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42751#true} {42751#true} #725#return; {42751#true} is VALID [2022-04-15 11:47:37,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {42751#true} call ULTIMATE.init(); {42758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:37,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {42758#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {42751#true} assume true; {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42751#true} {42751#true} #725#return; {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {42751#true} call #t~ret161 := main(); {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {42751#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; {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {42751#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L272 TraceCheckUtils]: 7: Hoare triple {42751#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {42751#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); {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {42751#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; {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {42751#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; {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {42751#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {42751#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {42751#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {42751#true} is VALID [2022-04-15 11:47:37,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {42751#true} assume !false; {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {42751#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {42751#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {42751#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {42751#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {42751#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {42751#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {42751#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {42751#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {42751#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {42751#true} assume 8464 == #t~mem55;havoc #t~mem55; {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {42751#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; {42751#true} is VALID [2022-04-15 11:47:37,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {42751#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {42751#true} is VALID [2022-04-15 11:47:37,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {42751#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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {42756#(= 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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {42756#(= 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; {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {42756#(= 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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {42756#(= 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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {42756#(= 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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {42756#(= 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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {42756#(= 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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {42756#(= 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); {42756#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:37,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {42756#(= 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); {42757#(= |ssl3_accept_#t~mem53| 8496)} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 39: Hoare triple {42757#(= |ssl3_accept_#t~mem53| 8496)} assume 8481 == #t~mem53;havoc #t~mem53; {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 40: Hoare triple {42752#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; {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 41: Hoare triple {42752#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); {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {42752#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); {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {42752#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {42752#false} ~skip~0 := 0; {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {42752#false} assume !false; {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 46: Hoare triple {42752#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); {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {42752#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {42752#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {42752#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {42752#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 51: Hoare triple {42752#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {42752#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {42752#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {42752#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 55: Hoare triple {42752#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 56: Hoare triple {42752#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 57: Hoare triple {42752#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 58: Hoare triple {42752#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 59: Hoare triple {42752#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 60: Hoare triple {42752#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 61: Hoare triple {42752#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {42752#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {42752#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 64: Hoare triple {42752#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {42752#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 66: Hoare triple {42752#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 67: Hoare triple {42752#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 68: Hoare triple {42752#false} assume 8448 == #t~mem68;havoc #t~mem68; {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 69: Hoare triple {42752#false} assume !(~num1~0 > 0); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 70: Hoare triple {42752#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; {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {42752#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); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 72: Hoare triple {42752#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 73: Hoare triple {42752#false} ~skip~0 := 0; {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 74: Hoare triple {42752#false} assume !false; {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 75: Hoare triple {42752#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); {42752#false} is VALID [2022-04-15 11:47:37,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {42752#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 77: Hoare triple {42752#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 78: Hoare triple {42752#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {42752#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 80: Hoare triple {42752#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 81: Hoare triple {42752#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 82: Hoare triple {42752#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 83: Hoare triple {42752#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 84: Hoare triple {42752#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 85: Hoare triple {42752#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 86: Hoare triple {42752#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 87: Hoare triple {42752#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 88: Hoare triple {42752#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 89: Hoare triple {42752#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,815 INFO L290 TraceCheckUtils]: 90: Hoare triple {42752#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 91: Hoare triple {42752#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 92: Hoare triple {42752#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 93: Hoare triple {42752#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 94: Hoare triple {42752#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 95: Hoare triple {42752#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 96: Hoare triple {42752#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 97: Hoare triple {42752#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 98: Hoare triple {42752#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 99: Hoare triple {42752#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 100: Hoare triple {42752#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 101: Hoare triple {42752#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 102: Hoare triple {42752#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 103: Hoare triple {42752#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {42752#false} is VALID [2022-04-15 11:47:37,816 INFO L290 TraceCheckUtils]: 104: Hoare triple {42752#false} assume 8640 == #t~mem75;havoc #t~mem75; {42752#false} is VALID [2022-04-15 11:47:37,817 INFO L290 TraceCheckUtils]: 105: Hoare triple {42752#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {42752#false} is VALID [2022-04-15 11:47:37,817 INFO L290 TraceCheckUtils]: 106: Hoare triple {42752#false} assume !(9 == ~blastFlag~0); {42752#false} is VALID [2022-04-15 11:47:37,817 INFO L290 TraceCheckUtils]: 107: Hoare triple {42752#false} assume !(12 == ~blastFlag~0); {42752#false} is VALID [2022-04-15 11:47:37,817 INFO L290 TraceCheckUtils]: 108: Hoare triple {42752#false} assume 15 == ~blastFlag~0; {42752#false} is VALID [2022-04-15 11:47:37,817 INFO L290 TraceCheckUtils]: 109: Hoare triple {42752#false} assume !false; {42752#false} is VALID [2022-04-15 11:47:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:47:37,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:37,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517208478] [2022-04-15 11:47:37,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517208478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:37,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:37,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:37,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:37,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520608423] [2022-04-15 11:47:37,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520608423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:37,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:37,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579778690] [2022-04-15 11:47:37,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 11:47:37,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:37,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:37,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:37,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:37,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:37,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:37,879 INFO L87 Difference]: Start difference. First operand 709 states and 1140 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:41,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:47,115 INFO L93 Difference]: Finished difference Result 979 states and 1579 transitions. [2022-04-15 11:47:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 11:47:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:47,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-15 11:47:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 496 transitions. [2022-04-15 11:47:47,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 496 transitions. [2022-04-15 11:47:47,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:47,455 INFO L225 Difference]: With dead ends: 979 [2022-04-15 11:47:47,455 INFO L226 Difference]: Without dead ends: 728 [2022-04-15 11:47:47,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:47,456 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 36 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:47,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 629 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:47:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-04-15 11:47:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 709. [2022-04-15 11:47:47,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:47,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 728 states. Second operand has 709 states, 704 states have (on average 1.6122159090909092) internal successors, (1135), 704 states have internal predecessors, (1135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:47,481 INFO L74 IsIncluded]: Start isIncluded. First operand 728 states. Second operand has 709 states, 704 states have (on average 1.6122159090909092) internal successors, (1135), 704 states have internal predecessors, (1135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:47,482 INFO L87 Difference]: Start difference. First operand 728 states. Second operand has 709 states, 704 states have (on average 1.6122159090909092) internal successors, (1135), 704 states have internal predecessors, (1135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:47,500 INFO L93 Difference]: Finished difference Result 728 states and 1164 transitions. [2022-04-15 11:47:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1164 transitions. [2022-04-15 11:47:47,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:47,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:47,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 709 states, 704 states have (on average 1.6122159090909092) internal successors, (1135), 704 states have internal predecessors, (1135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 728 states. [2022-04-15 11:47:47,502 INFO L87 Difference]: Start difference. First operand has 709 states, 704 states have (on average 1.6122159090909092) internal successors, (1135), 704 states have internal predecessors, (1135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 728 states. [2022-04-15 11:47:47,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:47,520 INFO L93 Difference]: Finished difference Result 728 states and 1164 transitions. [2022-04-15 11:47:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1164 transitions. [2022-04-15 11:47:47,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:47,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:47,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:47,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 704 states have (on average 1.6122159090909092) internal successors, (1135), 704 states have internal predecessors, (1135), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1139 transitions. [2022-04-15 11:47:47,555 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1139 transitions. Word has length 110 [2022-04-15 11:47:47,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:47,556 INFO L478 AbstractCegarLoop]: Abstraction has 709 states and 1139 transitions. [2022-04-15 11:47:47,556 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:47,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 709 states and 1139 transitions. [2022-04-15 11:47:49,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1139 edges. 1139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1139 transitions. [2022-04-15 11:47:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 11:47:49,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:49,588 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:49,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 11:47:49,589 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash 200829149, now seen corresponding path program 1 times [2022-04-15 11:47:49,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:49,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157290353] [2022-04-15 11:47:49,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:49,636 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:49,636 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 200829149, now seen corresponding path program 2 times [2022-04-15 11:47:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:49,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953724386] [2022-04-15 11:47:49,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:49,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:49,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {47602#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47595#true} is VALID [2022-04-15 11:47:49,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {47595#true} assume true; {47595#true} is VALID [2022-04-15 11:47:49,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47595#true} {47595#true} #725#return; {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {47595#true} call ULTIMATE.init(); {47602#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:49,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {47602#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {47595#true} assume true; {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47595#true} {47595#true} #725#return; {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {47595#true} call #t~ret161 := main(); {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {47595#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; {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {47595#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L272 TraceCheckUtils]: 7: Hoare triple {47595#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {47595#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); {47595#true} is VALID [2022-04-15 11:47:49,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {47595#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; {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {47595#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; {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {47595#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {47595#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 13: Hoare triple {47595#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {47595#true} assume !false; {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {47595#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {47595#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {47595#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {47595#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {47595#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {47595#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {47595#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {47595#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {47595#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47595#true} is VALID [2022-04-15 11:47:49,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {47595#true} assume 8464 == #t~mem55;havoc #t~mem55; {47595#true} is VALID [2022-04-15 11:47:49,805 INFO L290 TraceCheckUtils]: 25: Hoare triple {47595#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; {47595#true} is VALID [2022-04-15 11:47:49,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {47595#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {47595#true} is VALID [2022-04-15 11:47:49,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {47595#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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {47600#(= 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; {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {47600#(= 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); {47600#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:49,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {47600#(= 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); {47601#(= |ssl3_accept_#t~mem54| 8496)} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {47601#(= |ssl3_accept_#t~mem54| 8496)} assume 8482 == #t~mem54;havoc #t~mem54; {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {47596#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {47596#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); {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {47596#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {47596#false} ~skip~0 := 0; {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {47596#false} assume !false; {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {47596#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); {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {47596#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {47596#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {47596#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {47596#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {47596#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 52: Hoare triple {47596#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {47596#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {47596#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 55: Hoare triple {47596#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {47596#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {47596#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 58: Hoare triple {47596#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 59: Hoare triple {47596#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 60: Hoare triple {47596#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {47596#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 62: Hoare triple {47596#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {47596#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 64: Hoare triple {47596#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 65: Hoare triple {47596#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,812 INFO L290 TraceCheckUtils]: 66: Hoare triple {47596#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 67: Hoare triple {47596#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 68: Hoare triple {47596#false} assume 8448 == #t~mem68;havoc #t~mem68; {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 69: Hoare triple {47596#false} assume !(~num1~0 > 0); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 70: Hoare triple {47596#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; {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 71: Hoare triple {47596#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); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 72: Hoare triple {47596#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 73: Hoare triple {47596#false} ~skip~0 := 0; {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {47596#false} assume !false; {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {47596#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); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {47596#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 77: Hoare triple {47596#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {47596#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {47596#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {47596#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 81: Hoare triple {47596#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {47596#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 83: Hoare triple {47596#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 84: Hoare triple {47596#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 85: Hoare triple {47596#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 86: Hoare triple {47596#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 87: Hoare triple {47596#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {47596#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {47596#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 90: Hoare triple {47596#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 91: Hoare triple {47596#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 92: Hoare triple {47596#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 93: Hoare triple {47596#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,814 INFO L290 TraceCheckUtils]: 94: Hoare triple {47596#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 95: Hoare triple {47596#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 96: Hoare triple {47596#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 97: Hoare triple {47596#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 98: Hoare triple {47596#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 99: Hoare triple {47596#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 100: Hoare triple {47596#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 101: Hoare triple {47596#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 102: Hoare triple {47596#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 103: Hoare triple {47596#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 104: Hoare triple {47596#false} assume 8640 == #t~mem75;havoc #t~mem75; {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 105: Hoare triple {47596#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 106: Hoare triple {47596#false} assume !(9 == ~blastFlag~0); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 107: Hoare triple {47596#false} assume !(12 == ~blastFlag~0); {47596#false} is VALID [2022-04-15 11:47:49,815 INFO L290 TraceCheckUtils]: 108: Hoare triple {47596#false} assume 15 == ~blastFlag~0; {47596#false} is VALID [2022-04-15 11:47:49,816 INFO L290 TraceCheckUtils]: 109: Hoare triple {47596#false} assume !false; {47596#false} is VALID [2022-04-15 11:47:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:47:49,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:49,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953724386] [2022-04-15 11:47:49,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953724386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:49,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:49,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:49,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:49,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157290353] [2022-04-15 11:47:49,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157290353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:49,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:49,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:47:49,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211366084] [2022-04-15 11:47:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:49,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 11:47:49,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:49,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:49,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:49,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:47:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:47:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:47:49,877 INFO L87 Difference]: Start difference. First operand 709 states and 1139 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:51,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:47:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:55,467 INFO L93 Difference]: Finished difference Result 978 states and 1576 transitions. [2022-04-15 11:47:55,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:47:55,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2022-04-15 11:47:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:47:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-04-15 11:47:55,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:55,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2022-04-15 11:47:55,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 494 transitions. [2022-04-15 11:47:55,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:55,860 INFO L225 Difference]: With dead ends: 978 [2022-04-15 11:47:55,860 INFO L226 Difference]: Without dead ends: 727 [2022-04-15 11:47:55,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:55,861 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 34 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:47:55,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 627 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 444 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 11:47:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-04-15 11:47:55,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 709. [2022-04-15 11:47:55,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:47:55,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 727 states. Second operand has 709 states, 704 states have (on average 1.6107954545454546) internal successors, (1134), 704 states have internal predecessors, (1134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:55,917 INFO L74 IsIncluded]: Start isIncluded. First operand 727 states. Second operand has 709 states, 704 states have (on average 1.6107954545454546) internal successors, (1134), 704 states have internal predecessors, (1134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:55,918 INFO L87 Difference]: Start difference. First operand 727 states. Second operand has 709 states, 704 states have (on average 1.6107954545454546) internal successors, (1134), 704 states have internal predecessors, (1134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:55,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:55,941 INFO L93 Difference]: Finished difference Result 727 states and 1162 transitions. [2022-04-15 11:47:55,941 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1162 transitions. [2022-04-15 11:47:55,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:55,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:55,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 709 states, 704 states have (on average 1.6107954545454546) internal successors, (1134), 704 states have internal predecessors, (1134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 727 states. [2022-04-15 11:47:55,944 INFO L87 Difference]: Start difference. First operand has 709 states, 704 states have (on average 1.6107954545454546) internal successors, (1134), 704 states have internal predecessors, (1134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 727 states. [2022-04-15 11:47:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:47:55,968 INFO L93 Difference]: Finished difference Result 727 states and 1162 transitions. [2022-04-15 11:47:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1162 transitions. [2022-04-15 11:47:55,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:47:55,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:47:55,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:47:55,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:47:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 704 states have (on average 1.6107954545454546) internal successors, (1134), 704 states have internal predecessors, (1134), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1138 transitions. [2022-04-15 11:47:56,003 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1138 transitions. Word has length 110 [2022-04-15 11:47:56,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:47:56,004 INFO L478 AbstractCegarLoop]: Abstraction has 709 states and 1138 transitions. [2022-04-15 11:47:56,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:56,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 709 states and 1138 transitions. [2022-04-15 11:47:58,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1138 edges. 1138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1138 transitions. [2022-04-15 11:47:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 11:47:58,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:47:58,709 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:47:58,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 11:47:58,709 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:47:58,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:47:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash -364891054, now seen corresponding path program 1 times [2022-04-15 11:47:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:58,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285834046] [2022-04-15 11:47:58,764 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:47:58,764 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:47:58,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:47:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -364891054, now seen corresponding path program 2 times [2022-04-15 11:47:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:47:58,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253255396] [2022-04-15 11:47:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:47:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:47:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:47:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:47:58,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {52443#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52435#true} is VALID [2022-04-15 11:47:58,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {52435#true} assume true; {52435#true} is VALID [2022-04-15 11:47:58,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52435#true} {52435#true} #725#return; {52435#true} is VALID [2022-04-15 11:47:58,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {52435#true} call ULTIMATE.init(); {52443#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:47:58,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {52443#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {52435#true} is VALID [2022-04-15 11:47:58,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {52435#true} assume true; {52435#true} is VALID [2022-04-15 11:47:58,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52435#true} {52435#true} #725#return; {52435#true} is VALID [2022-04-15 11:47:58,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {52435#true} call #t~ret161 := main(); {52435#true} is VALID [2022-04-15 11:47:58,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {52435#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; {52435#true} is VALID [2022-04-15 11:47:58,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {52435#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L272 TraceCheckUtils]: 7: Hoare triple {52435#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {52435#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); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {52435#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; {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {52435#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; {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {52435#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {52435#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {52435#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {52435#true} assume !false; {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {52435#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {52435#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {52435#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {52435#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {52435#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {52435#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {52435#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {52435#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {52435#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {52435#true} assume 8464 == #t~mem55;havoc #t~mem55; {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {52435#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; {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {52435#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {52435#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); {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {52435#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); {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 29: Hoare triple {52435#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 30: Hoare triple {52435#true} ~skip~0 := 0; {52435#true} is VALID [2022-04-15 11:47:58,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {52435#true} assume !false; {52435#true} is VALID [2022-04-15 11:47:58,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {52435#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {52440#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {52440#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,936 INFO L290 TraceCheckUtils]: 36: Hoare triple {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,937 INFO L290 TraceCheckUtils]: 38: Hoare triple {52441#(= 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); {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {52441#(= 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; {52441#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:47:58,938 INFO L290 TraceCheckUtils]: 40: Hoare triple {52441#(= 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); {52442#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 41: Hoare triple {52442#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 42: Hoare triple {52436#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; {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {52436#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); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {52436#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {52436#false} ~skip~0 := 0; {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 47: Hoare triple {52436#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); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 48: Hoare triple {52436#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 49: Hoare triple {52436#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 50: Hoare triple {52436#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 51: Hoare triple {52436#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 52: Hoare triple {52436#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 53: Hoare triple {52436#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {52436#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 55: Hoare triple {52436#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 56: Hoare triple {52436#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 57: Hoare triple {52436#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {52436#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {52436#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 60: Hoare triple {52436#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {52436#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {52436#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {52436#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {52436#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {52436#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {52436#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {52436#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {52436#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 69: Hoare triple {52436#false} assume 8448 == #t~mem68;havoc #t~mem68; {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {52436#false} assume !(~num1~0 > 0); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {52436#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; {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {52436#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); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {52436#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {52436#false} ~skip~0 := 0; {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 75: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {52436#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); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 77: Hoare triple {52436#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 78: Hoare triple {52436#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 79: Hoare triple {52436#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 80: Hoare triple {52436#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 81: Hoare triple {52436#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 82: Hoare triple {52436#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,941 INFO L290 TraceCheckUtils]: 83: Hoare triple {52436#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 84: Hoare triple {52436#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 85: Hoare triple {52436#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 86: Hoare triple {52436#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 87: Hoare triple {52436#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 88: Hoare triple {52436#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 89: Hoare triple {52436#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 90: Hoare triple {52436#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 91: Hoare triple {52436#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 92: Hoare triple {52436#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 93: Hoare triple {52436#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 94: Hoare triple {52436#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 95: Hoare triple {52436#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 96: Hoare triple {52436#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,942 INFO L290 TraceCheckUtils]: 97: Hoare triple {52436#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 98: Hoare triple {52436#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 99: Hoare triple {52436#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 100: Hoare triple {52436#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 101: Hoare triple {52436#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 102: Hoare triple {52436#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 103: Hoare triple {52436#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 104: Hoare triple {52436#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 105: Hoare triple {52436#false} assume 8640 == #t~mem75;havoc #t~mem75; {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 106: Hoare triple {52436#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 107: Hoare triple {52436#false} assume !(9 == ~blastFlag~0); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 108: Hoare triple {52436#false} assume !(12 == ~blastFlag~0); {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 109: Hoare triple {52436#false} assume 15 == ~blastFlag~0; {52436#false} is VALID [2022-04-15 11:47:58,943 INFO L290 TraceCheckUtils]: 110: Hoare triple {52436#false} assume !false; {52436#false} is VALID [2022-04-15 11:47:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-15 11:47:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:47:58,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253255396] [2022-04-15 11:47:58,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253255396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:58,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:58,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:47:58,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:47:58,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285834046] [2022-04-15 11:47:58,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285834046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:47:58,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:47:58,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:47:58,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448032174] [2022-04-15 11:47:58,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:47:58,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 11:47:58,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:47:58,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:47:59,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:47:59,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:47:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:47:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:47:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:47:59,004 INFO L87 Difference]: Start difference. First operand 709 states and 1138 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:02,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:05,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:12,610 INFO L93 Difference]: Finished difference Result 1211 states and 1943 transitions. [2022-04-15 11:48:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:48:12,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2022-04-15 11:48:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 447 transitions. [2022-04-15 11:48:12,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 447 transitions. [2022-04-15 11:48:12,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 447 transitions. [2022-04-15 11:48:12,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 447 edges. 447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:12,914 INFO L225 Difference]: With dead ends: 1211 [2022-04-15 11:48:12,914 INFO L226 Difference]: Without dead ends: 727 [2022-04-15 11:48:12,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 11:48:12,915 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 3 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:12,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 706 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 11:48:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-04-15 11:48:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2022-04-15 11:48:12,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:12,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 727 states. Second operand has 727 states, 722 states have (on average 1.6011080332409973) internal successors, (1156), 722 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:12,940 INFO L74 IsIncluded]: Start isIncluded. First operand 727 states. Second operand has 727 states, 722 states have (on average 1.6011080332409973) internal successors, (1156), 722 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:12,941 INFO L87 Difference]: Start difference. First operand 727 states. Second operand has 727 states, 722 states have (on average 1.6011080332409973) internal successors, (1156), 722 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:12,958 INFO L93 Difference]: Finished difference Result 727 states and 1160 transitions. [2022-04-15 11:48:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1160 transitions. [2022-04-15 11:48:12,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:12,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:12,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 722 states have (on average 1.6011080332409973) internal successors, (1156), 722 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 727 states. [2022-04-15 11:48:12,960 INFO L87 Difference]: Start difference. First operand has 727 states, 722 states have (on average 1.6011080332409973) internal successors, (1156), 722 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 727 states. [2022-04-15 11:48:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:12,977 INFO L93 Difference]: Finished difference Result 727 states and 1160 transitions. [2022-04-15 11:48:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1160 transitions. [2022-04-15 11:48:12,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:12,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:12,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:12,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 722 states have (on average 1.6011080332409973) internal successors, (1156), 722 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1160 transitions. [2022-04-15 11:48:13,011 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1160 transitions. Word has length 111 [2022-04-15 11:48:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:13,011 INFO L478 AbstractCegarLoop]: Abstraction has 727 states and 1160 transitions. [2022-04-15 11:48:13,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:13,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 1160 transitions. [2022-04-15 11:48:15,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1160 edges. 1160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1160 transitions. [2022-04-15 11:48:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 11:48:15,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:15,043 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:15,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 11:48:15,043 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash 244557921, now seen corresponding path program 1 times [2022-04-15 11:48:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:15,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1132425033] [2022-04-15 11:48:15,097 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:15,098 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:15,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash 244557921, now seen corresponding path program 2 times [2022-04-15 11:48:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:15,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55845315] [2022-04-15 11:48:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:15,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {57785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {57778#true} is VALID [2022-04-15 11:48:15,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {57778#true} assume true; {57778#true} is VALID [2022-04-15 11:48:15,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57778#true} {57778#true} #725#return; {57778#true} is VALID [2022-04-15 11:48:15,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {57778#true} call ULTIMATE.init(); {57785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:15,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {57785#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {57778#true} is VALID [2022-04-15 11:48:15,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {57778#true} assume true; {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57778#true} {57778#true} #725#return; {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {57778#true} call #t~ret161 := main(); {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {57778#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; {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {57778#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L272 TraceCheckUtils]: 7: Hoare triple {57778#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {57778#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); {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {57778#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; {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {57778#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; {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {57778#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {57778#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {57778#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {57778#true} assume !false; {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {57778#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {57778#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {57778#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {57778#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {57778#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {57778#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {57778#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {57778#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {57778#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {57778#true} assume 8464 == #t~mem55;havoc #t~mem55; {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {57778#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; {57778#true} is VALID [2022-04-15 11:48:15,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {57778#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {57778#true} is VALID [2022-04-15 11:48:15,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {57778#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); {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:15,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:15,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:15,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:15,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:15,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {57783#(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); {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:15,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {57783#(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); {57783#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:15,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {57783#(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); {57784#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-15 11:48:15,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {57784#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {57779#false} is VALID [2022-04-15 11:48:15,235 INFO L290 TraceCheckUtils]: 36: Hoare triple {57779#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,235 INFO L290 TraceCheckUtils]: 37: Hoare triple {57779#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {57779#false} is VALID [2022-04-15 11:48:15,235 INFO L290 TraceCheckUtils]: 38: Hoare triple {57779#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 39: Hoare triple {57779#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); {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 40: Hoare triple {57779#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 41: Hoare triple {57779#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); {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {57779#false} assume 12292 != #t~mem85;havoc #t~mem85; {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {57779#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; {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {57779#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); {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {57779#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {57779#false} ~skip~0 := 0; {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {57779#false} assume !false; {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {57779#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); {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 49: Hoare triple {57779#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {57779#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {57779#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {57779#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 53: Hoare triple {57779#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 54: Hoare triple {57779#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 55: Hoare triple {57779#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 56: Hoare triple {57779#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 57: Hoare triple {57779#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {57779#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 59: Hoare triple {57779#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {57779#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {57779#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 62: Hoare triple {57779#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 63: Hoare triple {57779#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {57779#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,237 INFO L290 TraceCheckUtils]: 65: Hoare triple {57779#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {57779#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 67: Hoare triple {57779#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 68: Hoare triple {57779#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 69: Hoare triple {57779#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 70: Hoare triple {57779#false} assume 8448 == #t~mem68;havoc #t~mem68; {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 71: Hoare triple {57779#false} assume !(~num1~0 > 0); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 72: Hoare triple {57779#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; {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 73: Hoare triple {57779#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); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 74: Hoare triple {57779#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 75: Hoare triple {57779#false} ~skip~0 := 0; {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 76: Hoare triple {57779#false} assume !false; {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 77: Hoare triple {57779#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); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 78: Hoare triple {57779#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,238 INFO L290 TraceCheckUtils]: 79: Hoare triple {57779#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {57779#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 81: Hoare triple {57779#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {57779#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {57779#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {57779#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 85: Hoare triple {57779#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 86: Hoare triple {57779#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 87: Hoare triple {57779#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 88: Hoare triple {57779#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 89: Hoare triple {57779#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 90: Hoare triple {57779#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 91: Hoare triple {57779#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 92: Hoare triple {57779#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,239 INFO L290 TraceCheckUtils]: 93: Hoare triple {57779#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {57779#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 95: Hoare triple {57779#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 96: Hoare triple {57779#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 97: Hoare triple {57779#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 98: Hoare triple {57779#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 99: Hoare triple {57779#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 100: Hoare triple {57779#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 101: Hoare triple {57779#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 102: Hoare triple {57779#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 103: Hoare triple {57779#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 104: Hoare triple {57779#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 105: Hoare triple {57779#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 106: Hoare triple {57779#false} assume 8640 == #t~mem75;havoc #t~mem75; {57779#false} is VALID [2022-04-15 11:48:15,240 INFO L290 TraceCheckUtils]: 107: Hoare triple {57779#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {57779#false} is VALID [2022-04-15 11:48:15,241 INFO L290 TraceCheckUtils]: 108: Hoare triple {57779#false} assume !(9 == ~blastFlag~0); {57779#false} is VALID [2022-04-15 11:48:15,241 INFO L290 TraceCheckUtils]: 109: Hoare triple {57779#false} assume !(12 == ~blastFlag~0); {57779#false} is VALID [2022-04-15 11:48:15,241 INFO L290 TraceCheckUtils]: 110: Hoare triple {57779#false} assume 15 == ~blastFlag~0; {57779#false} is VALID [2022-04-15 11:48:15,241 INFO L290 TraceCheckUtils]: 111: Hoare triple {57779#false} assume !false; {57779#false} is VALID [2022-04-15 11:48:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:48:15,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:15,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55845315] [2022-04-15 11:48:15,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55845315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:15,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:15,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:15,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:15,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1132425033] [2022-04-15 11:48:15,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1132425033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:15,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:15,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389629709] [2022-04-15 11:48:15,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:15,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 11:48:15,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:15,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:15,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:15,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:15,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:15,305 INFO L87 Difference]: Start difference. First operand 727 states and 1160 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:22,268 INFO L93 Difference]: Finished difference Result 1482 states and 2303 transitions. [2022-04-15 11:48:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-04-15 11:48:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2022-04-15 11:48:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2022-04-15 11:48:22,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 629 transitions. [2022-04-15 11:48:22,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:22,730 INFO L225 Difference]: With dead ends: 1482 [2022-04-15 11:48:22,730 INFO L226 Difference]: Without dead ends: 978 [2022-04-15 11:48:22,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:22,731 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 159 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:22,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 402 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 11:48:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-04-15 11:48:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 727. [2022-04-15 11:48:22,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:22,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 978 states. Second operand has 727 states, 722 states have (on average 1.5872576177285318) internal successors, (1146), 722 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,757 INFO L74 IsIncluded]: Start isIncluded. First operand 978 states. Second operand has 727 states, 722 states have (on average 1.5872576177285318) internal successors, (1146), 722 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,757 INFO L87 Difference]: Start difference. First operand 978 states. Second operand has 727 states, 722 states have (on average 1.5872576177285318) internal successors, (1146), 722 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:22,788 INFO L93 Difference]: Finished difference Result 978 states and 1487 transitions. [2022-04-15 11:48:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1487 transitions. [2022-04-15 11:48:22,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:22,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:22,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 722 states have (on average 1.5872576177285318) internal successors, (1146), 722 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 978 states. [2022-04-15 11:48:22,790 INFO L87 Difference]: Start difference. First operand has 727 states, 722 states have (on average 1.5872576177285318) internal successors, (1146), 722 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 978 states. [2022-04-15 11:48:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:22,822 INFO L93 Difference]: Finished difference Result 978 states and 1487 transitions. [2022-04-15 11:48:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1487 transitions. [2022-04-15 11:48:22,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:22,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:22,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:22,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 722 states have (on average 1.5872576177285318) internal successors, (1146), 722 states have internal predecessors, (1146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1150 transitions. [2022-04-15 11:48:22,849 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1150 transitions. Word has length 112 [2022-04-15 11:48:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:22,849 INFO L478 AbstractCegarLoop]: Abstraction has 727 states and 1150 transitions. [2022-04-15 11:48:22,849 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:22,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 1150 transitions. [2022-04-15 11:48:25,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1150 edges. 1150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1150 transitions. [2022-04-15 11:48:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 11:48:25,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:25,025 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:25,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 11:48:25,025 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash 88448459, now seen corresponding path program 1 times [2022-04-15 11:48:25,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:25,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165196217] [2022-04-15 11:48:25,083 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:25,083 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:25,083 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash 88448459, now seen corresponding path program 2 times [2022-04-15 11:48:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:25,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418718590] [2022-04-15 11:48:25,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:25,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {64171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {64164#true} is VALID [2022-04-15 11:48:25,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {64164#true} assume true; {64164#true} is VALID [2022-04-15 11:48:25,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64164#true} {64164#true} #725#return; {64164#true} is VALID [2022-04-15 11:48:25,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {64164#true} call ULTIMATE.init(); {64171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:25,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {64171#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {64164#true} is VALID [2022-04-15 11:48:25,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {64164#true} assume true; {64164#true} is VALID [2022-04-15 11:48:25,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64164#true} {64164#true} #725#return; {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {64164#true} call #t~ret161 := main(); {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {64164#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; {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {64164#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L272 TraceCheckUtils]: 7: Hoare triple {64164#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {64164#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); {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {64164#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; {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {64164#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; {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {64164#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {64164#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {64164#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {64164#true} assume !false; {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {64164#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {64164#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {64164#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {64164#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {64164#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {64164#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {64164#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {64164#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {64164#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {64164#true} assume 8464 == #t~mem55;havoc #t~mem55; {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {64164#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; {64164#true} is VALID [2022-04-15 11:48:25,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {64164#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {64164#true} is VALID [2022-04-15 11:48:25,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {64164#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); {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {64169#(= 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); {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {64169#(= 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; {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {64169#(= 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); {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {64169#(= 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); {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {64169#(= 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); {64169#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:25,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {64169#(= 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); {64170#(= |ssl3_accept_#t~mem50| 8496)} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {64170#(= |ssl3_accept_#t~mem50| 8496)} assume 24576 == #t~mem50;havoc #t~mem50; {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 37: Hoare triple {64165#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {64165#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {64165#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {64165#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); {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {64165#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {64165#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); {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {64165#false} assume 12292 != #t~mem85;havoc #t~mem85; {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {64165#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; {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {64165#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); {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {64165#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {64165#false} ~skip~0 := 0; {64165#false} is VALID [2022-04-15 11:48:25,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {64165#false} assume !false; {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 49: Hoare triple {64165#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); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 50: Hoare triple {64165#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 51: Hoare triple {64165#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 52: Hoare triple {64165#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {64165#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {64165#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {64165#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {64165#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 57: Hoare triple {64165#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 58: Hoare triple {64165#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 59: Hoare triple {64165#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {64165#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {64165#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {64165#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {64165#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 64: Hoare triple {64165#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 65: Hoare triple {64165#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 66: Hoare triple {64165#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 67: Hoare triple {64165#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 68: Hoare triple {64165#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {64165#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {64165#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 71: Hoare triple {64165#false} assume 8448 == #t~mem68;havoc #t~mem68; {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 72: Hoare triple {64165#false} assume !(~num1~0 > 0); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 73: Hoare triple {64165#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; {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 74: Hoare triple {64165#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); {64165#false} is VALID [2022-04-15 11:48:25,227 INFO L290 TraceCheckUtils]: 75: Hoare triple {64165#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 76: Hoare triple {64165#false} ~skip~0 := 0; {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 77: Hoare triple {64165#false} assume !false; {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 78: Hoare triple {64165#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); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 79: Hoare triple {64165#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 80: Hoare triple {64165#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 81: Hoare triple {64165#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 82: Hoare triple {64165#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 83: Hoare triple {64165#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 84: Hoare triple {64165#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 85: Hoare triple {64165#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 86: Hoare triple {64165#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 87: Hoare triple {64165#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {64165#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {64165#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 90: Hoare triple {64165#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 91: Hoare triple {64165#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 92: Hoare triple {64165#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 93: Hoare triple {64165#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 94: Hoare triple {64165#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 95: Hoare triple {64165#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 96: Hoare triple {64165#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 97: Hoare triple {64165#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {64165#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {64165#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {64165#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 101: Hoare triple {64165#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 102: Hoare triple {64165#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,229 INFO L290 TraceCheckUtils]: 103: Hoare triple {64165#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 104: Hoare triple {64165#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {64165#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 106: Hoare triple {64165#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 107: Hoare triple {64165#false} assume 8640 == #t~mem75;havoc #t~mem75; {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 108: Hoare triple {64165#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 109: Hoare triple {64165#false} assume !(9 == ~blastFlag~0); {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 110: Hoare triple {64165#false} assume !(12 == ~blastFlag~0); {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 111: Hoare triple {64165#false} assume 15 == ~blastFlag~0; {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L290 TraceCheckUtils]: 112: Hoare triple {64165#false} assume !false; {64165#false} is VALID [2022-04-15 11:48:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:48:25,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:25,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418718590] [2022-04-15 11:48:25,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418718590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:25,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:25,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:25,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:25,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165196217] [2022-04-15 11:48:25,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165196217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:25,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:25,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048108734] [2022-04-15 11:48:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 11:48:25,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:25,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:25,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:25,308 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:25,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:25,309 INFO L87 Difference]: Start difference. First operand 727 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:27,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:29,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:34,230 INFO L93 Difference]: Finished difference Result 1014 states and 1604 transitions. [2022-04-15 11:48:34,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 113 [2022-04-15 11:48:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2022-04-15 11:48:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2022-04-15 11:48:34,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 492 transitions. [2022-04-15 11:48:34,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 492 edges. 492 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:34,568 INFO L225 Difference]: With dead ends: 1014 [2022-04-15 11:48:34,568 INFO L226 Difference]: Without dead ends: 754 [2022-04-15 11:48:34,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:34,569 INFO L913 BasicCegarLoop]: 249 mSDtfsCounter, 36 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:34,570 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 623 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 11:48:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-04-15 11:48:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 727. [2022-04-15 11:48:34,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:34,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 754 states. Second operand has 727 states, 722 states have (on average 1.5858725761772854) internal successors, (1145), 722 states have internal predecessors, (1145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,595 INFO L74 IsIncluded]: Start isIncluded. First operand 754 states. Second operand has 727 states, 722 states have (on average 1.5858725761772854) internal successors, (1145), 722 states have internal predecessors, (1145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,595 INFO L87 Difference]: Start difference. First operand 754 states. Second operand has 727 states, 722 states have (on average 1.5858725761772854) internal successors, (1145), 722 states have internal predecessors, (1145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:34,631 INFO L93 Difference]: Finished difference Result 754 states and 1184 transitions. [2022-04-15 11:48:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1184 transitions. [2022-04-15 11:48:34,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:34,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:34,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 722 states have (on average 1.5858725761772854) internal successors, (1145), 722 states have internal predecessors, (1145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 754 states. [2022-04-15 11:48:34,634 INFO L87 Difference]: Start difference. First operand has 727 states, 722 states have (on average 1.5858725761772854) internal successors, (1145), 722 states have internal predecessors, (1145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 754 states. [2022-04-15 11:48:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:34,652 INFO L93 Difference]: Finished difference Result 754 states and 1184 transitions. [2022-04-15 11:48:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1184 transitions. [2022-04-15 11:48:34,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:34,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:34,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:34,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 722 states have (on average 1.5858725761772854) internal successors, (1145), 722 states have internal predecessors, (1145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1149 transitions. [2022-04-15 11:48:34,678 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1149 transitions. Word has length 113 [2022-04-15 11:48:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:34,678 INFO L478 AbstractCegarLoop]: Abstraction has 727 states and 1149 transitions. [2022-04-15 11:48:34,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:34,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 1149 transitions. [2022-04-15 11:48:36,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1149 edges. 1149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1149 transitions. [2022-04-15 11:48:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 11:48:36,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:36,629 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:36,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 11:48:36,629 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:36,629 INFO L85 PathProgramCache]: Analyzing trace with hash -388313562, now seen corresponding path program 1 times [2022-04-15 11:48:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:36,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2116801542] [2022-04-15 11:48:36,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:36,696 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:36,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash -388313562, now seen corresponding path program 2 times [2022-04-15 11:48:36,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815337698] [2022-04-15 11:48:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:36,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {69173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {69166#true} is VALID [2022-04-15 11:48:36,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {69166#true} assume true; {69166#true} is VALID [2022-04-15 11:48:36,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69166#true} {69166#true} #725#return; {69166#true} is VALID [2022-04-15 11:48:36,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {69166#true} call ULTIMATE.init(); {69173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:36,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {69173#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {69166#true} is VALID [2022-04-15 11:48:36,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {69166#true} assume true; {69166#true} is VALID [2022-04-15 11:48:36,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69166#true} {69166#true} #725#return; {69166#true} is VALID [2022-04-15 11:48:36,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {69166#true} call #t~ret161 := main(); {69166#true} is VALID [2022-04-15 11:48:36,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {69166#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; {69166#true} is VALID [2022-04-15 11:48:36,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {69166#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L272 TraceCheckUtils]: 7: Hoare triple {69166#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {69166#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); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {69166#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; {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {69166#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; {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {69166#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {69166#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {69166#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {69166#true} assume !false; {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {69166#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {69166#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {69166#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {69166#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {69166#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {69166#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {69166#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {69166#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {69166#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69166#true} is VALID [2022-04-15 11:48:36,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {69166#true} assume 8464 == #t~mem55;havoc #t~mem55; {69166#true} is VALID [2022-04-15 11:48:36,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {69166#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; {69166#true} is VALID [2022-04-15 11:48:36,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {69166#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {69166#true} is VALID [2022-04-15 11:48:36,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {69166#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); {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {69171#(= 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); {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {69171#(= 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; {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {69171#(= 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); {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {69171#(= 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); {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {69171#(= 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); {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {69171#(= 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); {69171#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:36,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {69171#(= 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); {69172#(= |ssl3_accept_#t~mem51| 8496)} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {69172#(= |ssl3_accept_#t~mem51| 8496)} assume 8195 == #t~mem51;havoc #t~mem51; {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {69167#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {69167#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {69167#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {69167#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); {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {69167#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {69167#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); {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {69167#false} assume 12292 != #t~mem85;havoc #t~mem85; {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {69167#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; {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {69167#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); {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {69167#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {69167#false} is VALID [2022-04-15 11:48:36,847 INFO L290 TraceCheckUtils]: 48: Hoare triple {69167#false} ~skip~0 := 0; {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {69167#false} assume !false; {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {69167#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); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {69167#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {69167#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {69167#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 54: Hoare triple {69167#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 55: Hoare triple {69167#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {69167#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {69167#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {69167#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {69167#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {69167#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {69167#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,848 INFO L290 TraceCheckUtils]: 62: Hoare triple {69167#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 63: Hoare triple {69167#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {69167#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {69167#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {69167#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 67: Hoare triple {69167#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 68: Hoare triple {69167#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 69: Hoare triple {69167#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 70: Hoare triple {69167#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 71: Hoare triple {69167#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 72: Hoare triple {69167#false} assume 8448 == #t~mem68;havoc #t~mem68; {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 73: Hoare triple {69167#false} assume !(~num1~0 > 0); {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 74: Hoare triple {69167#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; {69167#false} is VALID [2022-04-15 11:48:36,849 INFO L290 TraceCheckUtils]: 75: Hoare triple {69167#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); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {69167#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 77: Hoare triple {69167#false} ~skip~0 := 0; {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 78: Hoare triple {69167#false} assume !false; {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 79: Hoare triple {69167#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); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 80: Hoare triple {69167#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 81: Hoare triple {69167#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 82: Hoare triple {69167#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 83: Hoare triple {69167#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 84: Hoare triple {69167#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 85: Hoare triple {69167#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 86: Hoare triple {69167#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 87: Hoare triple {69167#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 88: Hoare triple {69167#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,850 INFO L290 TraceCheckUtils]: 89: Hoare triple {69167#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 90: Hoare triple {69167#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 91: Hoare triple {69167#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 92: Hoare triple {69167#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 93: Hoare triple {69167#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 94: Hoare triple {69167#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 95: Hoare triple {69167#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 96: Hoare triple {69167#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 97: Hoare triple {69167#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 98: Hoare triple {69167#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 99: Hoare triple {69167#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 100: Hoare triple {69167#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 101: Hoare triple {69167#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 102: Hoare triple {69167#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,851 INFO L290 TraceCheckUtils]: 103: Hoare triple {69167#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 104: Hoare triple {69167#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 105: Hoare triple {69167#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 106: Hoare triple {69167#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 107: Hoare triple {69167#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 108: Hoare triple {69167#false} assume 8640 == #t~mem75;havoc #t~mem75; {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 109: Hoare triple {69167#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 110: Hoare triple {69167#false} assume !(9 == ~blastFlag~0); {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 111: Hoare triple {69167#false} assume !(12 == ~blastFlag~0); {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 112: Hoare triple {69167#false} assume 15 == ~blastFlag~0; {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L290 TraceCheckUtils]: 113: Hoare triple {69167#false} assume !false; {69167#false} is VALID [2022-04-15 11:48:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 11:48:36,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:36,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815337698] [2022-04-15 11:48:36,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815337698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:36,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:36,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:36,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:36,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2116801542] [2022-04-15 11:48:36,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2116801542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:36,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:36,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003253854] [2022-04-15 11:48:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:48:36,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:36,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:36,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:36,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:36,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:36,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:36,918 INFO L87 Difference]: Start difference. First operand 727 states and 1149 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:40,625 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-15 11:48:42,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:44,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:47,131 INFO L93 Difference]: Finished difference Result 1004 states and 1589 transitions. [2022-04-15 11:48:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:47,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-15 11:48:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2022-04-15 11:48:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2022-04-15 11:48:47,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 489 transitions. [2022-04-15 11:48:47,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:47,457 INFO L225 Difference]: With dead ends: 1004 [2022-04-15 11:48:47,458 INFO L226 Difference]: Without dead ends: 744 [2022-04-15 11:48:47,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:47,458 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 33 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:47,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 619 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:48:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2022-04-15 11:48:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 727. [2022-04-15 11:48:47,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:47,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 744 states. Second operand has 727 states, 722 states have (on average 1.5844875346260388) internal successors, (1144), 722 states have internal predecessors, (1144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,484 INFO L74 IsIncluded]: Start isIncluded. First operand 744 states. Second operand has 727 states, 722 states have (on average 1.5844875346260388) internal successors, (1144), 722 states have internal predecessors, (1144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,485 INFO L87 Difference]: Start difference. First operand 744 states. Second operand has 727 states, 722 states have (on average 1.5844875346260388) internal successors, (1144), 722 states have internal predecessors, (1144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:47,503 INFO L93 Difference]: Finished difference Result 744 states and 1170 transitions. [2022-04-15 11:48:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1170 transitions. [2022-04-15 11:48:47,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:47,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:47,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 727 states, 722 states have (on average 1.5844875346260388) internal successors, (1144), 722 states have internal predecessors, (1144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 744 states. [2022-04-15 11:48:47,506 INFO L87 Difference]: Start difference. First operand has 727 states, 722 states have (on average 1.5844875346260388) internal successors, (1144), 722 states have internal predecessors, (1144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 744 states. [2022-04-15 11:48:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:47,526 INFO L93 Difference]: Finished difference Result 744 states and 1170 transitions. [2022-04-15 11:48:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1170 transitions. [2022-04-15 11:48:47,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:47,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:47,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:47,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 722 states have (on average 1.5844875346260388) internal successors, (1144), 722 states have internal predecessors, (1144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1148 transitions. [2022-04-15 11:48:47,552 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1148 transitions. Word has length 114 [2022-04-15 11:48:47,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:47,552 INFO L478 AbstractCegarLoop]: Abstraction has 727 states and 1148 transitions. [2022-04-15 11:48:47,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:47,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 727 states and 1148 transitions. [2022-04-15 11:48:49,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1148 edges. 1148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1148 transitions. [2022-04-15 11:48:49,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 11:48:49,639 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:49,639 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:49,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 11:48:49,640 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1695799758, now seen corresponding path program 1 times [2022-04-15 11:48:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:49,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1634221284] [2022-04-15 11:48:49,695 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:49,696 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:49,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1695799758, now seen corresponding path program 2 times [2022-04-15 11:48:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:49,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037543267] [2022-04-15 11:48:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:49,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {74135#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74128#true} is VALID [2022-04-15 11:48:49,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {74128#true} assume true; {74128#true} is VALID [2022-04-15 11:48:49,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74128#true} {74128#true} #725#return; {74128#true} is VALID [2022-04-15 11:48:49,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {74128#true} call ULTIMATE.init(); {74135#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:49,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {74135#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {74128#true} is VALID [2022-04-15 11:48:49,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {74128#true} assume true; {74128#true} is VALID [2022-04-15 11:48:49,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74128#true} {74128#true} #725#return; {74128#true} is VALID [2022-04-15 11:48:49,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {74128#true} call #t~ret161 := main(); {74128#true} is VALID [2022-04-15 11:48:49,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {74128#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; {74128#true} is VALID [2022-04-15 11:48:49,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {74128#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L272 TraceCheckUtils]: 7: Hoare triple {74128#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {74128#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); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {74128#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; {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {74128#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; {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {74128#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {74128#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {74128#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {74128#true} assume !false; {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {74128#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {74128#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {74128#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {74128#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {74128#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {74128#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {74128#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {74128#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {74128#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {74128#true} assume 8464 == #t~mem55;havoc #t~mem55; {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {74128#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; {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {74128#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {74128#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); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {74128#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); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {74128#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {74128#true} ~skip~0 := 0; {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {74128#true} assume !false; {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {74128#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {74128#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 34: Hoare triple {74128#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {74128#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {74128#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {74128#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 38: Hoare triple {74128#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {74128#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {74128#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {74128#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 42: Hoare triple {74128#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 43: Hoare triple {74128#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {74128#true} assume 8496 == #t~mem58;havoc #t~mem58; {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {74128#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 46: Hoare triple {74128#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {74128#true} is VALID [2022-04-15 11:48:49,829 INFO L290 TraceCheckUtils]: 47: Hoare triple {74128#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {74128#true} is VALID [2022-04-15 11:48:49,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {74128#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {74133#(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; {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,835 INFO L290 TraceCheckUtils]: 59: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,835 INFO L290 TraceCheckUtils]: 60: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,836 INFO L290 TraceCheckUtils]: 62: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,836 INFO L290 TraceCheckUtils]: 63: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,836 INFO L290 TraceCheckUtils]: 64: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {74133#(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); {74133#(not (= 8448 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:48:49,840 INFO L290 TraceCheckUtils]: 75: Hoare triple {74133#(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); {74134#(not (= 8448 |ssl3_accept_#t~mem68|))} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 76: Hoare triple {74134#(not (= 8448 |ssl3_accept_#t~mem68|))} assume 8448 == #t~mem68;havoc #t~mem68; {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 77: Hoare triple {74129#false} assume !(~num1~0 > 0); {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 78: Hoare triple {74129#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; {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {74129#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); {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {74129#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {74129#false} ~skip~0 := 0; {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {74129#false} assume !false; {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {74129#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); {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {74129#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 85: Hoare triple {74129#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 86: Hoare triple {74129#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 87: Hoare triple {74129#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,841 INFO L290 TraceCheckUtils]: 88: Hoare triple {74129#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 89: Hoare triple {74129#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 90: Hoare triple {74129#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 91: Hoare triple {74129#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 92: Hoare triple {74129#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 93: Hoare triple {74129#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 94: Hoare triple {74129#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 95: Hoare triple {74129#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 96: Hoare triple {74129#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 97: Hoare triple {74129#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 98: Hoare triple {74129#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 99: Hoare triple {74129#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 100: Hoare triple {74129#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 101: Hoare triple {74129#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,842 INFO L290 TraceCheckUtils]: 102: Hoare triple {74129#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 103: Hoare triple {74129#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 104: Hoare triple {74129#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 105: Hoare triple {74129#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 106: Hoare triple {74129#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 107: Hoare triple {74129#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 108: Hoare triple {74129#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 109: Hoare triple {74129#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 110: Hoare triple {74129#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 111: Hoare triple {74129#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 112: Hoare triple {74129#false} assume 8640 == #t~mem75;havoc #t~mem75; {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 113: Hoare triple {74129#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 114: Hoare triple {74129#false} assume !(9 == ~blastFlag~0); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 115: Hoare triple {74129#false} assume !(12 == ~blastFlag~0); {74129#false} is VALID [2022-04-15 11:48:49,843 INFO L290 TraceCheckUtils]: 116: Hoare triple {74129#false} assume 15 == ~blastFlag~0; {74129#false} is VALID [2022-04-15 11:48:49,844 INFO L290 TraceCheckUtils]: 117: Hoare triple {74129#false} assume !false; {74129#false} is VALID [2022-04-15 11:48:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:48:49,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:49,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037543267] [2022-04-15 11:48:49,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037543267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:49,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:49,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:49,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:49,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1634221284] [2022-04-15 11:48:49,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1634221284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:49,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:49,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:49,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131018474] [2022-04-15 11:48:49,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:49,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:48:49,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:49,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:49,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:49,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:49,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:49,922 INFO L87 Difference]: Start difference. First operand 727 states and 1148 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:51,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:48:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:55,567 INFO L93 Difference]: Finished difference Result 1907 states and 3013 transitions. [2022-04-15 11:48:55,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:48:55,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 118 [2022-04-15 11:48:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:48:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-04-15 11:48:55,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-04-15 11:48:55,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 624 transitions. [2022-04-15 11:48:55,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:56,039 INFO L225 Difference]: With dead ends: 1907 [2022-04-15 11:48:56,039 INFO L226 Difference]: Without dead ends: 1206 [2022-04-15 11:48:56,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:48:56,041 INFO L913 BasicCegarLoop]: 278 mSDtfsCounter, 138 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:48:56,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 674 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 628 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 11:48:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2022-04-15 11:48:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 919. [2022-04-15 11:48:56,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:48:56,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1206 states. Second operand has 919 states, 914 states have (on average 1.6192560175054704) internal successors, (1480), 914 states have internal predecessors, (1480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:56,103 INFO L74 IsIncluded]: Start isIncluded. First operand 1206 states. Second operand has 919 states, 914 states have (on average 1.6192560175054704) internal successors, (1480), 914 states have internal predecessors, (1480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:56,104 INFO L87 Difference]: Start difference. First operand 1206 states. Second operand has 919 states, 914 states have (on average 1.6192560175054704) internal successors, (1480), 914 states have internal predecessors, (1480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:56,148 INFO L93 Difference]: Finished difference Result 1206 states and 1893 transitions. [2022-04-15 11:48:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1893 transitions. [2022-04-15 11:48:56,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:56,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:56,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 919 states, 914 states have (on average 1.6192560175054704) internal successors, (1480), 914 states have internal predecessors, (1480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1206 states. [2022-04-15 11:48:56,151 INFO L87 Difference]: Start difference. First operand has 919 states, 914 states have (on average 1.6192560175054704) internal successors, (1480), 914 states have internal predecessors, (1480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1206 states. [2022-04-15 11:48:56,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:48:56,196 INFO L93 Difference]: Finished difference Result 1206 states and 1893 transitions. [2022-04-15 11:48:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1893 transitions. [2022-04-15 11:48:56,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:48:56,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:48:56,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:48:56,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:48:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 914 states have (on average 1.6192560175054704) internal successors, (1480), 914 states have internal predecessors, (1480), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1484 transitions. [2022-04-15 11:48:56,241 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1484 transitions. Word has length 118 [2022-04-15 11:48:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:48:56,242 INFO L478 AbstractCegarLoop]: Abstraction has 919 states and 1484 transitions. [2022-04-15 11:48:56,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:56,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 919 states and 1484 transitions. [2022-04-15 11:48:58,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1484 edges. 1484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1484 transitions. [2022-04-15 11:48:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 11:48:58,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:48:58,618 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:48:58,618 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 11:48:58,618 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:48:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:48:58,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1569038945, now seen corresponding path program 1 times [2022-04-15 11:48:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:58,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [23104272] [2022-04-15 11:48:58,684 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:48:58,684 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:48:58,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:48:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1569038945, now seen corresponding path program 2 times [2022-04-15 11:48:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:48:58,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794358585] [2022-04-15 11:48:58,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:48:58,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:48:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:48:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:48:58,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {82211#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {82204#true} is VALID [2022-04-15 11:48:58,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {82204#true} assume true; {82204#true} is VALID [2022-04-15 11:48:58,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82204#true} {82204#true} #725#return; {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {82204#true} call ULTIMATE.init(); {82211#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:48:58,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {82211#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {82204#true} assume true; {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82204#true} {82204#true} #725#return; {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {82204#true} call #t~ret161 := main(); {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {82204#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; {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {82204#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L272 TraceCheckUtils]: 7: Hoare triple {82204#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {82204#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); {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {82204#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; {82204#true} is VALID [2022-04-15 11:48:58,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {82204#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; {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {82204#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {82204#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {82204#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {82204#true} assume !false; {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {82204#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {82204#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {82204#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {82204#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {82204#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {82204#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {82204#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {82204#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {82204#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {82204#true} is VALID [2022-04-15 11:48:58,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {82204#true} assume 8464 == #t~mem55;havoc #t~mem55; {82204#true} is VALID [2022-04-15 11:48:58,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {82204#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; {82204#true} is VALID [2022-04-15 11:48:58,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {82204#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {82204#true} is VALID [2022-04-15 11:48:58,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {82204#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); {82209#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:58,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {82209#(= 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); {82209#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:58,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {82209#(= 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; {82209#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:58,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {82209#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {82209#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:58,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {82209#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {82209#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:48:58,838 INFO L290 TraceCheckUtils]: 32: Hoare triple {82209#(= 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); {82210#(= |ssl3_accept_#t~mem47| 8496)} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {82210#(= |ssl3_accept_#t~mem47| 8496)} assume 12292 == #t~mem47;havoc #t~mem47; {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {82205#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {82205#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {82205#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {82205#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {82205#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,839 INFO L290 TraceCheckUtils]: 42: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {82205#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {82205#false} ~skip~0 := 0; {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {82205#false} assume !false; {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 46: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 47: Hoare triple {82205#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {82205#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {82205#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {82205#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 51: Hoare triple {82205#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 52: Hoare triple {82205#false} assume 8480 == #t~mem52;havoc #t~mem52; {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {82205#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; {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 56: Hoare triple {82205#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {82205#false} ~skip~0 := 0; {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 58: Hoare triple {82205#false} assume !false; {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {82205#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {82205#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {82205#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {82205#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {82205#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {82205#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {82205#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 67: Hoare triple {82205#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {82205#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 69: Hoare triple {82205#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {82205#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {82205#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 72: Hoare triple {82205#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 73: Hoare triple {82205#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 74: Hoare triple {82205#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 75: Hoare triple {82205#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 76: Hoare triple {82205#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 77: Hoare triple {82205#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {82205#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 79: Hoare triple {82205#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 80: Hoare triple {82205#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 81: Hoare triple {82205#false} assume 8448 == #t~mem68;havoc #t~mem68; {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 82: Hoare triple {82205#false} assume !(~num1~0 > 0); {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 83: Hoare triple {82205#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; {82205#false} is VALID [2022-04-15 11:48:58,842 INFO L290 TraceCheckUtils]: 84: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 85: Hoare triple {82205#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 86: Hoare triple {82205#false} ~skip~0 := 0; {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 87: Hoare triple {82205#false} assume !false; {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 88: Hoare triple {82205#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); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 89: Hoare triple {82205#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 90: Hoare triple {82205#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 91: Hoare triple {82205#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 92: Hoare triple {82205#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 93: Hoare triple {82205#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 94: Hoare triple {82205#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {82205#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 96: Hoare triple {82205#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 97: Hoare triple {82205#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,843 INFO L290 TraceCheckUtils]: 98: Hoare triple {82205#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 99: Hoare triple {82205#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 100: Hoare triple {82205#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 101: Hoare triple {82205#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 102: Hoare triple {82205#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 103: Hoare triple {82205#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 104: Hoare triple {82205#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 105: Hoare triple {82205#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 106: Hoare triple {82205#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 107: Hoare triple {82205#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 108: Hoare triple {82205#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 109: Hoare triple {82205#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 110: Hoare triple {82205#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 111: Hoare triple {82205#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,844 INFO L290 TraceCheckUtils]: 112: Hoare triple {82205#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 113: Hoare triple {82205#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 114: Hoare triple {82205#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 115: Hoare triple {82205#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 116: Hoare triple {82205#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 117: Hoare triple {82205#false} assume 8640 == #t~mem75;havoc #t~mem75; {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 118: Hoare triple {82205#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 119: Hoare triple {82205#false} assume !(9 == ~blastFlag~0); {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 120: Hoare triple {82205#false} assume !(12 == ~blastFlag~0); {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 121: Hoare triple {82205#false} assume 15 == ~blastFlag~0; {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L290 TraceCheckUtils]: 122: Hoare triple {82205#false} assume !false; {82205#false} is VALID [2022-04-15 11:48:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 11:48:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:48:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794358585] [2022-04-15 11:48:58,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794358585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:58,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:58,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:58,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:48:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [23104272] [2022-04-15 11:48:58,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [23104272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:48:58,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:48:58,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:48:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35099322] [2022-04-15 11:48:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:48:58,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 11:48:58,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:48:58,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:48:58,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:48:58,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:48:58,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:48:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:48:58,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:48:58,915 INFO L87 Difference]: Start difference. First operand 919 states and 1484 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:09,383 INFO L93 Difference]: Finished difference Result 1250 states and 2023 transitions. [2022-04-15 11:49:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 123 [2022-04-15 11:49:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:49:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-15 11:49:09,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-15 11:49:09,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 476 edges. 476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:09,732 INFO L225 Difference]: With dead ends: 1250 [2022-04-15 11:49:09,733 INFO L226 Difference]: Without dead ends: 926 [2022-04-15 11:49:09,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:09,734 INFO L913 BasicCegarLoop]: 241 mSDtfsCounter, 30 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:09,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 607 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 11:49:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-04-15 11:49:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 919. [2022-04-15 11:49:09,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:09,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 926 states. Second operand has 919 states, 914 states have (on average 1.6181619256017505) internal successors, (1479), 914 states have internal predecessors, (1479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,771 INFO L74 IsIncluded]: Start isIncluded. First operand 926 states. Second operand has 919 states, 914 states have (on average 1.6181619256017505) internal successors, (1479), 914 states have internal predecessors, (1479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,771 INFO L87 Difference]: Start difference. First operand 926 states. Second operand has 919 states, 914 states have (on average 1.6181619256017505) internal successors, (1479), 914 states have internal predecessors, (1479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:09,800 INFO L93 Difference]: Finished difference Result 926 states and 1493 transitions. [2022-04-15 11:49:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1493 transitions. [2022-04-15 11:49:09,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:09,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:09,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 919 states, 914 states have (on average 1.6181619256017505) internal successors, (1479), 914 states have internal predecessors, (1479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 926 states. [2022-04-15 11:49:09,804 INFO L87 Difference]: Start difference. First operand has 919 states, 914 states have (on average 1.6181619256017505) internal successors, (1479), 914 states have internal predecessors, (1479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 926 states. [2022-04-15 11:49:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:09,834 INFO L93 Difference]: Finished difference Result 926 states and 1493 transitions. [2022-04-15 11:49:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1493 transitions. [2022-04-15 11:49:09,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:09,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:09,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:09,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 914 states have (on average 1.6181619256017505) internal successors, (1479), 914 states have internal predecessors, (1479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1483 transitions. [2022-04-15 11:49:09,897 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1483 transitions. Word has length 123 [2022-04-15 11:49:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:09,897 INFO L478 AbstractCegarLoop]: Abstraction has 919 states and 1483 transitions. [2022-04-15 11:49:09,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:09,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 919 states and 1483 transitions. [2022-04-15 11:49:12,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1483 edges. 1483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1483 transitions. [2022-04-15 11:49:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 11:49:12,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:12,262 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:12,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 11:49:12,263 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1768065624, now seen corresponding path program 1 times [2022-04-15 11:49:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:12,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [335982343] [2022-04-15 11:49:12,329 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:12,329 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:12,329 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1768065624, now seen corresponding path program 2 times [2022-04-15 11:49:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:12,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329925346] [2022-04-15 11:49:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:12,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:12,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {88413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88406#true} is VALID [2022-04-15 11:49:12,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {88406#true} assume true; {88406#true} is VALID [2022-04-15 11:49:12,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88406#true} {88406#true} #725#return; {88406#true} is VALID [2022-04-15 11:49:12,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {88406#true} call ULTIMATE.init(); {88413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:12,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {88413#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {88406#true} is VALID [2022-04-15 11:49:12,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {88406#true} assume true; {88406#true} is VALID [2022-04-15 11:49:12,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88406#true} {88406#true} #725#return; {88406#true} is VALID [2022-04-15 11:49:12,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {88406#true} call #t~ret161 := main(); {88406#true} is VALID [2022-04-15 11:49:12,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {88406#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; {88406#true} is VALID [2022-04-15 11:49:12,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {88406#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,491 INFO L272 TraceCheckUtils]: 7: Hoare triple {88406#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {88406#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); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {88406#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; {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {88406#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; {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {88406#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {88406#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {88406#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {88406#true} assume !false; {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {88406#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {88406#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {88406#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {88406#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {88406#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {88406#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {88406#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {88406#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {88406#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 24: Hoare triple {88406#true} assume 8464 == #t~mem55;havoc #t~mem55; {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {88406#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; {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {88406#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {88406#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); {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {88406#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); {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {88406#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {88406#true} ~skip~0 := 0; {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {88406#true} assume !false; {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {88406#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {88406#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 34: Hoare triple {88406#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {88406#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {88406#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {88406#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 38: Hoare triple {88406#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 39: Hoare triple {88406#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {88406#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 41: Hoare triple {88406#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {88406#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {88406#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {88406#true} assume 8496 == #t~mem58;havoc #t~mem58; {88406#true} is VALID [2022-04-15 11:49:12,495 INFO L290 TraceCheckUtils]: 45: Hoare triple {88406#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {88406#true} is VALID [2022-04-15 11:49:12,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {88406#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {88406#true} is VALID [2022-04-15 11:49:12,495 INFO L290 TraceCheckUtils]: 47: Hoare triple {88406#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {88406#true} is VALID [2022-04-15 11:49:12,495 INFO L290 TraceCheckUtils]: 48: Hoare triple {88406#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,496 INFO L290 TraceCheckUtils]: 49: Hoare triple {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,497 INFO L290 TraceCheckUtils]: 50: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,497 INFO L290 TraceCheckUtils]: 51: Hoare triple {88411#(= 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; {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,497 INFO L290 TraceCheckUtils]: 52: Hoare triple {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,498 INFO L290 TraceCheckUtils]: 53: Hoare triple {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,498 INFO L290 TraceCheckUtils]: 54: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,498 INFO L290 TraceCheckUtils]: 55: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,501 INFO L290 TraceCheckUtils]: 61: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,501 INFO L290 TraceCheckUtils]: 62: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,501 INFO L290 TraceCheckUtils]: 63: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,502 INFO L290 TraceCheckUtils]: 64: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,502 INFO L290 TraceCheckUtils]: 65: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,503 INFO L290 TraceCheckUtils]: 67: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,503 INFO L290 TraceCheckUtils]: 68: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,503 INFO L290 TraceCheckUtils]: 69: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,504 INFO L290 TraceCheckUtils]: 70: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,504 INFO L290 TraceCheckUtils]: 71: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,505 INFO L290 TraceCheckUtils]: 72: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,505 INFO L290 TraceCheckUtils]: 73: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,505 INFO L290 TraceCheckUtils]: 74: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,506 INFO L290 TraceCheckUtils]: 75: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,506 INFO L290 TraceCheckUtils]: 76: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,506 INFO L290 TraceCheckUtils]: 77: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,507 INFO L290 TraceCheckUtils]: 78: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {88411#(= 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); {88411#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:12,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {88411#(= 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); {88412#(= |ssl3_accept_#t~mem73| 8656)} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 81: Hoare triple {88412#(= |ssl3_accept_#t~mem73| 8656)} assume 8608 == #t~mem73;havoc #t~mem73; {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 82: Hoare triple {88407#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 83: Hoare triple {88407#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {88407#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); {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {88407#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); {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {88407#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 87: Hoare triple {88407#false} ~skip~0 := 0; {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 88: Hoare triple {88407#false} assume !false; {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {88407#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); {88407#false} is VALID [2022-04-15 11:49:12,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {88407#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 91: Hoare triple {88407#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 92: Hoare triple {88407#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 93: Hoare triple {88407#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 94: Hoare triple {88407#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 95: Hoare triple {88407#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 96: Hoare triple {88407#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 97: Hoare triple {88407#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 98: Hoare triple {88407#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 99: Hoare triple {88407#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 100: Hoare triple {88407#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 101: Hoare triple {88407#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 102: Hoare triple {88407#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,509 INFO L290 TraceCheckUtils]: 103: Hoare triple {88407#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 104: Hoare triple {88407#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 105: Hoare triple {88407#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 106: Hoare triple {88407#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 107: Hoare triple {88407#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 108: Hoare triple {88407#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 109: Hoare triple {88407#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 110: Hoare triple {88407#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 111: Hoare triple {88407#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 112: Hoare triple {88407#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 113: Hoare triple {88407#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 114: Hoare triple {88407#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 115: Hoare triple {88407#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,510 INFO L290 TraceCheckUtils]: 116: Hoare triple {88407#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L290 TraceCheckUtils]: 117: Hoare triple {88407#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L290 TraceCheckUtils]: 118: Hoare triple {88407#false} assume 8640 == #t~mem75;havoc #t~mem75; {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L290 TraceCheckUtils]: 119: Hoare triple {88407#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L290 TraceCheckUtils]: 120: Hoare triple {88407#false} assume !(9 == ~blastFlag~0); {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L290 TraceCheckUtils]: 121: Hoare triple {88407#false} assume !(12 == ~blastFlag~0); {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L290 TraceCheckUtils]: 122: Hoare triple {88407#false} assume 15 == ~blastFlag~0; {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L290 TraceCheckUtils]: 123: Hoare triple {88407#false} assume !false; {88407#false} is VALID [2022-04-15 11:49:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:49:12,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:12,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329925346] [2022-04-15 11:49:12,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329925346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:12,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:12,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:12,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:12,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [335982343] [2022-04-15 11:49:12,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [335982343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:12,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:12,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:12,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135910492] [2022-04-15 11:49:12,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:12,513 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-15 11:49:12,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:12,514 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-15 11:49:12,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:12,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:12,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:12,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:12,609 INFO L87 Difference]: Start difference. First operand 919 states and 1483 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-15 11:49:15,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:18,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:22,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:22,608 INFO L93 Difference]: Finished difference Result 2118 states and 3383 transitions. [2022-04-15 11:49:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:22,608 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-15 11:49:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:22,608 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-15 11:49:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-15 11:49:22,611 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-15 11:49:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-04-15 11:49:22,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 590 transitions. [2022-04-15 11:49:22,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:23,045 INFO L225 Difference]: With dead ends: 2118 [2022-04-15 11:49:23,046 INFO L226 Difference]: Without dead ends: 1225 [2022-04-15 11:49:23,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:23,047 INFO L913 BasicCegarLoop]: 293 mSDtfsCounter, 92 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:23,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 711 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 648 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 11:49:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2022-04-15 11:49:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1036. [2022-04-15 11:49:23,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:23,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1225 states. Second operand has 1036 states, 1031 states have (on average 1.629485935984481) internal successors, (1680), 1031 states have internal predecessors, (1680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:23,087 INFO L74 IsIncluded]: Start isIncluded. First operand 1225 states. Second operand has 1036 states, 1031 states have (on average 1.629485935984481) internal successors, (1680), 1031 states have internal predecessors, (1680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:23,087 INFO L87 Difference]: Start difference. First operand 1225 states. Second operand has 1036 states, 1031 states have (on average 1.629485935984481) internal successors, (1680), 1031 states have internal predecessors, (1680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:23,131 INFO L93 Difference]: Finished difference Result 1225 states and 1931 transitions. [2022-04-15 11:49:23,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1931 transitions. [2022-04-15 11:49:23,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:23,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:23,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 1036 states, 1031 states have (on average 1.629485935984481) internal successors, (1680), 1031 states have internal predecessors, (1680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1225 states. [2022-04-15 11:49:23,134 INFO L87 Difference]: Start difference. First operand has 1036 states, 1031 states have (on average 1.629485935984481) internal successors, (1680), 1031 states have internal predecessors, (1680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1225 states. [2022-04-15 11:49:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:23,189 INFO L93 Difference]: Finished difference Result 1225 states and 1931 transitions. [2022-04-15 11:49:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1931 transitions. [2022-04-15 11:49:23,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:23,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:23,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:23,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1031 states have (on average 1.629485935984481) internal successors, (1680), 1031 states have internal predecessors, (1680), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:23,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1684 transitions. [2022-04-15 11:49:23,241 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1684 transitions. Word has length 124 [2022-04-15 11:49:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:23,242 INFO L478 AbstractCegarLoop]: Abstraction has 1036 states and 1684 transitions. [2022-04-15 11:49:23,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:23,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1036 states and 1684 transitions. [2022-04-15 11:49:25,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1684 edges. 1684 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1684 transitions. [2022-04-15 11:49:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-04-15 11:49:25,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:25,864 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:25,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 11:49:25,864 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash -309271274, now seen corresponding path program 1 times [2022-04-15 11:49:25,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:25,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273679036] [2022-04-15 11:49:25,926 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:25,926 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:25,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash -309271274, now seen corresponding path program 2 times [2022-04-15 11:49:25,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:25,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804873733] [2022-04-15 11:49:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:26,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {97183#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {97176#true} is VALID [2022-04-15 11:49:26,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {97176#true} assume true; {97176#true} is VALID [2022-04-15 11:49:26,054 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97176#true} {97176#true} #725#return; {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {97176#true} call ULTIMATE.init(); {97183#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:26,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {97183#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {97176#true} assume true; {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97176#true} {97176#true} #725#return; {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {97176#true} call #t~ret161 := main(); {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {97176#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; {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {97176#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L272 TraceCheckUtils]: 7: Hoare triple {97176#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {97176#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); {97176#true} is VALID [2022-04-15 11:49:26,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {97176#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; {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {97176#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; {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {97176#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {97176#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {97176#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {97176#true} assume !false; {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {97176#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {97176#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {97176#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {97176#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {97176#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {97176#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {97176#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {97176#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {97176#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {97176#true} assume 8464 == #t~mem55;havoc #t~mem55; {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {97176#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; {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {97176#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {97176#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); {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {97176#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); {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {97176#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97176#true} is VALID [2022-04-15 11:49:26,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {97176#true} ~skip~0 := 0; {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {97176#true} assume !false; {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {97176#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {97176#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {97176#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {97176#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {97176#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {97176#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {97176#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {97176#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {97176#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {97176#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {97176#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {97176#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {97176#true} assume 8496 == #t~mem58;havoc #t~mem58; {97176#true} is VALID [2022-04-15 11:49:26,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {97176#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {97176#true} is VALID [2022-04-15 11:49:26,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {97176#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {97176#true} is VALID [2022-04-15 11:49:26,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {97176#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {97176#true} is VALID [2022-04-15 11:49:26,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {97176#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,061 INFO L290 TraceCheckUtils]: 50: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,061 INFO L290 TraceCheckUtils]: 51: Hoare triple {97181#(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; {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,061 INFO L290 TraceCheckUtils]: 52: Hoare triple {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,062 INFO L290 TraceCheckUtils]: 54: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,063 INFO L290 TraceCheckUtils]: 55: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,063 INFO L290 TraceCheckUtils]: 56: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,063 INFO L290 TraceCheckUtils]: 57: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,064 INFO L290 TraceCheckUtils]: 58: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,064 INFO L290 TraceCheckUtils]: 59: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,064 INFO L290 TraceCheckUtils]: 60: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,065 INFO L290 TraceCheckUtils]: 61: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,065 INFO L290 TraceCheckUtils]: 62: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,066 INFO L290 TraceCheckUtils]: 64: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,066 INFO L290 TraceCheckUtils]: 65: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,067 INFO L290 TraceCheckUtils]: 67: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,067 INFO L290 TraceCheckUtils]: 68: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,067 INFO L290 TraceCheckUtils]: 69: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,068 INFO L290 TraceCheckUtils]: 70: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,068 INFO L290 TraceCheckUtils]: 71: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,068 INFO L290 TraceCheckUtils]: 72: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,069 INFO L290 TraceCheckUtils]: 73: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,069 INFO L290 TraceCheckUtils]: 74: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,069 INFO L290 TraceCheckUtils]: 75: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,070 INFO L290 TraceCheckUtils]: 76: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,070 INFO L290 TraceCheckUtils]: 77: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,071 INFO L290 TraceCheckUtils]: 78: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,071 INFO L290 TraceCheckUtils]: 79: Hoare triple {97181#(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); {97181#(not (= 8608 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:49:26,071 INFO L290 TraceCheckUtils]: 80: Hoare triple {97181#(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); {97182#(not (= |ssl3_accept_#t~mem73| 8608))} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 81: Hoare triple {97182#(not (= |ssl3_accept_#t~mem73| 8608))} assume 8608 == #t~mem73;havoc #t~mem73; {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 82: Hoare triple {97177#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 83: Hoare triple {97177#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 84: Hoare triple {97177#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); {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 85: Hoare triple {97177#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); {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 86: Hoare triple {97177#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 87: Hoare triple {97177#false} ~skip~0 := 0; {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 88: Hoare triple {97177#false} assume !false; {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 89: Hoare triple {97177#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); {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 90: Hoare triple {97177#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 91: Hoare triple {97177#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 92: Hoare triple {97177#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,072 INFO L290 TraceCheckUtils]: 93: Hoare triple {97177#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 94: Hoare triple {97177#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 95: Hoare triple {97177#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 96: Hoare triple {97177#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 97: Hoare triple {97177#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 98: Hoare triple {97177#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 99: Hoare triple {97177#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 100: Hoare triple {97177#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 101: Hoare triple {97177#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 102: Hoare triple {97177#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 103: Hoare triple {97177#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 104: Hoare triple {97177#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 105: Hoare triple {97177#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 106: Hoare triple {97177#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 107: Hoare triple {97177#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,073 INFO L290 TraceCheckUtils]: 108: Hoare triple {97177#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 109: Hoare triple {97177#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 110: Hoare triple {97177#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 111: Hoare triple {97177#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 112: Hoare triple {97177#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 113: Hoare triple {97177#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 114: Hoare triple {97177#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 115: Hoare triple {97177#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 116: Hoare triple {97177#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 117: Hoare triple {97177#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 118: Hoare triple {97177#false} assume 8640 == #t~mem75;havoc #t~mem75; {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 119: Hoare triple {97177#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 120: Hoare triple {97177#false} assume !(9 == ~blastFlag~0); {97177#false} is VALID [2022-04-15 11:49:26,074 INFO L290 TraceCheckUtils]: 121: Hoare triple {97177#false} assume !(12 == ~blastFlag~0); {97177#false} is VALID [2022-04-15 11:49:26,075 INFO L290 TraceCheckUtils]: 122: Hoare triple {97177#false} assume 15 == ~blastFlag~0; {97177#false} is VALID [2022-04-15 11:49:26,075 INFO L290 TraceCheckUtils]: 123: Hoare triple {97177#false} assume !false; {97177#false} is VALID [2022-04-15 11:49:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:49:26,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:26,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804873733] [2022-04-15 11:49:26,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804873733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:26,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:26,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:26,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:26,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273679036] [2022-04-15 11:49:26,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273679036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:26,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:26,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384041093] [2022-04-15 11:49:26,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:26,076 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-15 11:49:26,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:26,077 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-15 11:49:26,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:26,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:26,147 INFO L87 Difference]: Start difference. First operand 1036 states and 1684 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-15 11:49:29,328 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:31,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:33,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:35,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:37,966 INFO L93 Difference]: Finished difference Result 2417 states and 3881 transitions. [2022-04-15 11:49:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:37,966 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-15 11:49:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:37,967 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-15 11:49:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2022-04-15 11:49:37,969 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-15 11:49:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2022-04-15 11:49:37,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 628 transitions. [2022-04-15 11:49:38,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:38,458 INFO L225 Difference]: With dead ends: 2417 [2022-04-15 11:49:38,458 INFO L226 Difference]: Without dead ends: 1407 [2022-04-15 11:49:38,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:38,459 INFO L913 BasicCegarLoop]: 137 mSDtfsCounter, 134 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:38,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 394 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 497 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-04-15 11:49:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2022-04-15 11:49:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1030. [2022-04-15 11:49:38,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:38,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1407 states. Second operand has 1030 states, 1025 states have (on average 1.6302439024390243) internal successors, (1671), 1025 states have internal predecessors, (1671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,506 INFO L74 IsIncluded]: Start isIncluded. First operand 1407 states. Second operand has 1030 states, 1025 states have (on average 1.6302439024390243) internal successors, (1671), 1025 states have internal predecessors, (1671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,507 INFO L87 Difference]: Start difference. First operand 1407 states. Second operand has 1030 states, 1025 states have (on average 1.6302439024390243) internal successors, (1671), 1025 states have internal predecessors, (1671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:38,578 INFO L93 Difference]: Finished difference Result 1407 states and 2225 transitions. [2022-04-15 11:49:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2225 transitions. [2022-04-15 11:49:38,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:38,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:38,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 1030 states, 1025 states have (on average 1.6302439024390243) internal successors, (1671), 1025 states have internal predecessors, (1671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1407 states. [2022-04-15 11:49:38,582 INFO L87 Difference]: Start difference. First operand has 1030 states, 1025 states have (on average 1.6302439024390243) internal successors, (1671), 1025 states have internal predecessors, (1671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1407 states. [2022-04-15 11:49:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:38,649 INFO L93 Difference]: Finished difference Result 1407 states and 2225 transitions. [2022-04-15 11:49:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2225 transitions. [2022-04-15 11:49:38,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:38,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:38,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:38,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1025 states have (on average 1.6302439024390243) internal successors, (1671), 1025 states have internal predecessors, (1671), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1675 transitions. [2022-04-15 11:49:38,701 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1675 transitions. Word has length 124 [2022-04-15 11:49:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:38,701 INFO L478 AbstractCegarLoop]: Abstraction has 1030 states and 1675 transitions. [2022-04-15 11:49:38,701 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:38,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1030 states and 1675 transitions. [2022-04-15 11:49:41,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1675 edges. 1675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1675 transitions. [2022-04-15 11:49:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 11:49:41,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:41,666 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:41,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 11:49:41,667 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1003398932, now seen corresponding path program 1 times [2022-04-15 11:49:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:41,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206729573] [2022-04-15 11:49:41,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:41,725 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:41,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:41,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1003398932, now seen corresponding path program 2 times [2022-04-15 11:49:41,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:41,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725923603] [2022-04-15 11:49:41,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:41,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {106903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {106896#true} is VALID [2022-04-15 11:49:41,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {106896#true} assume true; {106896#true} is VALID [2022-04-15 11:49:41,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {106896#true} {106896#true} #725#return; {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {106896#true} call ULTIMATE.init(); {106903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:41,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {106903#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {106896#true} assume true; {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106896#true} {106896#true} #725#return; {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {106896#true} call #t~ret161 := main(); {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {106896#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; {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {106896#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L272 TraceCheckUtils]: 7: Hoare triple {106896#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {106896#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); {106896#true} is VALID [2022-04-15 11:49:41,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {106896#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; {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {106896#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; {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {106896#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {106896#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {106896#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {106896#true} assume !false; {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {106896#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {106896#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {106896#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {106896#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {106896#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {106896#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {106896#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {106896#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {106896#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {106896#true} assume 8464 == #t~mem55;havoc #t~mem55; {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {106896#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; {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {106896#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {106896#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); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {106896#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); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {106896#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {106896#true} ~skip~0 := 0; {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {106896#true} assume !false; {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {106896#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {106896#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {106896#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {106896#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {106896#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {106896#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {106896#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {106896#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {106896#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {106896#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {106896#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {106896#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {106896#true} assume 8496 == #t~mem58;havoc #t~mem58; {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {106896#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {106896#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {106896#true} is VALID [2022-04-15 11:49:41,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {106896#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {106896#true} is VALID [2022-04-15 11:49:41,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {106896#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {106901#(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; {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} ~skip~0 := 0; {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} assume !false; {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,881 INFO L290 TraceCheckUtils]: 72: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,882 INFO L290 TraceCheckUtils]: 75: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,882 INFO L290 TraceCheckUtils]: 76: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,882 INFO L290 TraceCheckUtils]: 77: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,883 INFO L290 TraceCheckUtils]: 78: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,883 INFO L290 TraceCheckUtils]: 79: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,883 INFO L290 TraceCheckUtils]: 80: Hoare triple {106901#(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); {106901#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8609))} is VALID [2022-04-15 11:49:41,884 INFO L290 TraceCheckUtils]: 81: Hoare triple {106901#(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); {106902#(not (= |ssl3_accept_#t~mem74| 8609))} is VALID [2022-04-15 11:49:41,884 INFO L290 TraceCheckUtils]: 82: Hoare triple {106902#(not (= |ssl3_accept_#t~mem74| 8609))} assume 8609 == #t~mem74;havoc #t~mem74; {106897#false} is VALID [2022-04-15 11:49:41,884 INFO L290 TraceCheckUtils]: 83: Hoare triple {106897#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {106897#false} is VALID [2022-04-15 11:49:41,884 INFO L290 TraceCheckUtils]: 84: Hoare triple {106897#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {106897#false} is VALID [2022-04-15 11:49:41,884 INFO L290 TraceCheckUtils]: 85: Hoare triple {106897#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); {106897#false} is VALID [2022-04-15 11:49:41,884 INFO L290 TraceCheckUtils]: 86: Hoare triple {106897#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); {106897#false} is VALID [2022-04-15 11:49:41,884 INFO L290 TraceCheckUtils]: 87: Hoare triple {106897#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 88: Hoare triple {106897#false} ~skip~0 := 0; {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 89: Hoare triple {106897#false} assume !false; {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 90: Hoare triple {106897#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); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 91: Hoare triple {106897#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 92: Hoare triple {106897#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 93: Hoare triple {106897#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 94: Hoare triple {106897#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 95: Hoare triple {106897#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 96: Hoare triple {106897#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 97: Hoare triple {106897#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 98: Hoare triple {106897#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 99: Hoare triple {106897#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 100: Hoare triple {106897#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 101: Hoare triple {106897#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,885 INFO L290 TraceCheckUtils]: 102: Hoare triple {106897#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 103: Hoare triple {106897#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 104: Hoare triple {106897#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 105: Hoare triple {106897#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 106: Hoare triple {106897#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 107: Hoare triple {106897#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 108: Hoare triple {106897#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 109: Hoare triple {106897#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 110: Hoare triple {106897#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 111: Hoare triple {106897#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 112: Hoare triple {106897#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 113: Hoare triple {106897#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {106897#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 115: Hoare triple {106897#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 116: Hoare triple {106897#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,886 INFO L290 TraceCheckUtils]: 117: Hoare triple {106897#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L290 TraceCheckUtils]: 118: Hoare triple {106897#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L290 TraceCheckUtils]: 119: Hoare triple {106897#false} assume 8640 == #t~mem75;havoc #t~mem75; {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {106897#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L290 TraceCheckUtils]: 121: Hoare triple {106897#false} assume !(9 == ~blastFlag~0); {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L290 TraceCheckUtils]: 122: Hoare triple {106897#false} assume !(12 == ~blastFlag~0); {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L290 TraceCheckUtils]: 123: Hoare triple {106897#false} assume 15 == ~blastFlag~0; {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L290 TraceCheckUtils]: 124: Hoare triple {106897#false} assume !false; {106897#false} is VALID [2022-04-15 11:49:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:49:41,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:41,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725923603] [2022-04-15 11:49:41,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725923603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:41,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:41,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:41,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:41,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206729573] [2022-04-15 11:49:41,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206729573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:41,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:41,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:41,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246215774] [2022-04-15 11:49:41,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:41,889 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-15 11:49:41,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:41,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:41,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:41,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:41,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:41,977 INFO L87 Difference]: Start difference. First operand 1030 states and 1675 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:44,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:46,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:49:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:53,394 INFO L93 Difference]: Finished difference Result 2285 states and 3653 transitions. [2022-04-15 11:49:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:49:53,394 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-15 11:49:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:49:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2022-04-15 11:49:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2022-04-15 11:49:53,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 628 transitions. [2022-04-15 11:49:53,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 628 edges. 628 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:53,931 INFO L225 Difference]: With dead ends: 2285 [2022-04-15 11:49:53,932 INFO L226 Difference]: Without dead ends: 1281 [2022-04-15 11:49:53,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:49:53,933 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 133 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:49:53,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 410 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 504 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 11:49:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2022-04-15 11:49:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1030. [2022-04-15 11:49:53,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:49:53,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1281 states. Second operand has 1030 states, 1025 states have (on average 1.6243902439024391) internal successors, (1665), 1025 states have internal predecessors, (1665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,997 INFO L74 IsIncluded]: Start isIncluded. First operand 1281 states. Second operand has 1030 states, 1025 states have (on average 1.6243902439024391) internal successors, (1665), 1025 states have internal predecessors, (1665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:53,998 INFO L87 Difference]: Start difference. First operand 1281 states. Second operand has 1030 states, 1025 states have (on average 1.6243902439024391) internal successors, (1665), 1025 states have internal predecessors, (1665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:54,071 INFO L93 Difference]: Finished difference Result 1281 states and 2006 transitions. [2022-04-15 11:49:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2006 transitions. [2022-04-15 11:49:54,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:54,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:54,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 1030 states, 1025 states have (on average 1.6243902439024391) internal successors, (1665), 1025 states have internal predecessors, (1665), 3 states have call successors, (3), 3 states 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-15 11:49:54,075 INFO L87 Difference]: Start difference. First operand has 1030 states, 1025 states have (on average 1.6243902439024391) internal successors, (1665), 1025 states have internal predecessors, (1665), 3 states have call successors, (3), 3 states 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-15 11:49:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:49:54,151 INFO L93 Difference]: Finished difference Result 1281 states and 2006 transitions. [2022-04-15 11:49:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 2006 transitions. [2022-04-15 11:49:54,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:49:54,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:49:54,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:49:54,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:49:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1025 states have (on average 1.6243902439024391) internal successors, (1665), 1025 states have internal predecessors, (1665), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1669 transitions. [2022-04-15 11:49:54,205 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1669 transitions. Word has length 125 [2022-04-15 11:49:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:49:54,205 INFO L478 AbstractCegarLoop]: Abstraction has 1030 states and 1669 transitions. [2022-04-15 11:49:54,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:54,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1030 states and 1669 transitions. [2022-04-15 11:49:56,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1669 edges. 1669 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1669 transitions. [2022-04-15 11:49:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 11:49:56,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:49:56,710 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:49:56,710 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 11:49:56,711 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:49:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:49:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2043463772, now seen corresponding path program 1 times [2022-04-15 11:49:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:56,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1265979467] [2022-04-15 11:49:56,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:49:56,786 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:49:56,786 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:49:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2043463772, now seen corresponding path program 2 times [2022-04-15 11:49:56,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:49:56,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10771404] [2022-04-15 11:49:56,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:49:56,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:49:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:49:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:49:56,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {116107#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {116100#true} is VALID [2022-04-15 11:49:56,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {116100#true} assume true; {116100#true} is VALID [2022-04-15 11:49:56,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {116100#true} {116100#true} #725#return; {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {116100#true} call ULTIMATE.init(); {116107#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:49:56,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {116107#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {116100#true} assume true; {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116100#true} {116100#true} #725#return; {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {116100#true} call #t~ret161 := main(); {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {116100#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; {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {116100#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L272 TraceCheckUtils]: 7: Hoare triple {116100#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {116100#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); {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {116100#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; {116100#true} is VALID [2022-04-15 11:49:56,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {116100#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; {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {116100#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {116100#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {116100#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {116100#true} assume !false; {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {116100#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {116100#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {116100#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {116100#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {116100#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {116100#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {116100#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {116100#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {116100#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {116100#true} assume 8464 == #t~mem55;havoc #t~mem55; {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {116100#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; {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {116100#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {116100#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); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {116100#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); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {116100#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {116100#true} ~skip~0 := 0; {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {116100#true} assume !false; {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {116100#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {116100#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {116100#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {116100#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {116100#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {116100#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {116100#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {116100#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {116100#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 41: Hoare triple {116100#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {116100#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 43: Hoare triple {116100#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {116100#true} assume 8496 == #t~mem58;havoc #t~mem58; {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {116100#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 46: Hoare triple {116100#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {116100#true} is VALID [2022-04-15 11:49:56,945 INFO L290 TraceCheckUtils]: 47: Hoare triple {116100#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {116100#true} is VALID [2022-04-15 11:49:56,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {116100#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {116105#(= 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); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,947 INFO L290 TraceCheckUtils]: 51: Hoare triple {116105#(= 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; {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,948 INFO L290 TraceCheckUtils]: 54: Hoare triple {116105#(= 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); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,949 INFO L290 TraceCheckUtils]: 55: Hoare triple {116105#(= 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); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,949 INFO L290 TraceCheckUtils]: 56: Hoare triple {116105#(= 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); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,949 INFO L290 TraceCheckUtils]: 57: Hoare triple {116105#(= 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); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {116105#(= 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); {116105#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:49:56,950 INFO L290 TraceCheckUtils]: 59: Hoare triple {116105#(= 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); {116106#(= |ssl3_accept_#t~mem52| 8656)} is VALID [2022-04-15 11:49:56,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {116106#(= |ssl3_accept_#t~mem52| 8656)} assume 8480 == #t~mem52;havoc #t~mem52; {116101#false} is VALID [2022-04-15 11:49:56,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {116101#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; {116101#false} is VALID [2022-04-15 11:49:56,950 INFO L290 TraceCheckUtils]: 62: Hoare triple {116101#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); {116101#false} is VALID [2022-04-15 11:49:56,950 INFO L290 TraceCheckUtils]: 63: Hoare triple {116101#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); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {116101#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 65: Hoare triple {116101#false} ~skip~0 := 0; {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {116101#false} assume !false; {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {116101#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); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 68: Hoare triple {116101#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {116101#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 70: Hoare triple {116101#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 71: Hoare triple {116101#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 72: Hoare triple {116101#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {116101#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 74: Hoare triple {116101#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 75: Hoare triple {116101#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 76: Hoare triple {116101#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,951 INFO L290 TraceCheckUtils]: 77: Hoare triple {116101#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 78: Hoare triple {116101#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 79: Hoare triple {116101#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 80: Hoare triple {116101#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 81: Hoare triple {116101#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 82: Hoare triple {116101#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 83: Hoare triple {116101#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 84: Hoare triple {116101#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 85: Hoare triple {116101#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 86: Hoare triple {116101#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 87: Hoare triple {116101#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 88: Hoare triple {116101#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 89: Hoare triple {116101#false} assume 8448 == #t~mem68;havoc #t~mem68; {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 90: Hoare triple {116101#false} assume !(~num1~0 > 0); {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 91: Hoare triple {116101#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; {116101#false} is VALID [2022-04-15 11:49:56,952 INFO L290 TraceCheckUtils]: 92: Hoare triple {116101#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); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 93: Hoare triple {116101#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 94: Hoare triple {116101#false} ~skip~0 := 0; {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 95: Hoare triple {116101#false} assume !false; {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 96: Hoare triple {116101#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); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 97: Hoare triple {116101#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 98: Hoare triple {116101#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 99: Hoare triple {116101#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 100: Hoare triple {116101#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 101: Hoare triple {116101#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 102: Hoare triple {116101#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 103: Hoare triple {116101#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 104: Hoare triple {116101#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 105: Hoare triple {116101#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,953 INFO L290 TraceCheckUtils]: 106: Hoare triple {116101#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 107: Hoare triple {116101#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 108: Hoare triple {116101#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 109: Hoare triple {116101#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 110: Hoare triple {116101#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 111: Hoare triple {116101#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 112: Hoare triple {116101#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 113: Hoare triple {116101#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 114: Hoare triple {116101#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 115: Hoare triple {116101#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 116: Hoare triple {116101#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 117: Hoare triple {116101#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 118: Hoare triple {116101#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 119: Hoare triple {116101#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 120: Hoare triple {116101#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,954 INFO L290 TraceCheckUtils]: 121: Hoare triple {116101#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 122: Hoare triple {116101#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 123: Hoare triple {116101#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 124: Hoare triple {116101#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 125: Hoare triple {116101#false} assume 8640 == #t~mem75;havoc #t~mem75; {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 126: Hoare triple {116101#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 127: Hoare triple {116101#false} assume !(9 == ~blastFlag~0); {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 128: Hoare triple {116101#false} assume !(12 == ~blastFlag~0); {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 129: Hoare triple {116101#false} assume 15 == ~blastFlag~0; {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L290 TraceCheckUtils]: 130: Hoare triple {116101#false} assume !false; {116101#false} is VALID [2022-04-15 11:49:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:49:56,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:49:56,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10771404] [2022-04-15 11:49:56,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10771404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:56,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:56,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:56,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:49:56,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1265979467] [2022-04-15 11:49:56,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1265979467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:49:56,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:49:56,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:49:56,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619540536] [2022-04-15 11:49:56,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:49:56,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 11:49:56,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:49:56,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:49:57,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:49:57,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:49:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:49:57,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:49:57,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:49:57,020 INFO L87 Difference]: Start difference. First operand 1030 states and 1669 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:00,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:02,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:03,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:06,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:09,394 INFO L93 Difference]: Finished difference Result 2331 states and 3739 transitions. [2022-04-15 11:50:09,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:09,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 11:50:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-15 11:50:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-04-15 11:50:09,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 584 transitions. [2022-04-15 11:50:09,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 584 edges. 584 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:09,835 INFO L225 Difference]: With dead ends: 2331 [2022-04-15 11:50:09,835 INFO L226 Difference]: Without dead ends: 1327 [2022-04-15 11:50:09,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:09,837 INFO L913 BasicCegarLoop]: 288 mSDtfsCounter, 108 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:09,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 701 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 639 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2022-04-15 11:50:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2022-04-15 11:50:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1084. [2022-04-15 11:50:09,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:09,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1327 states. Second operand has 1084 states, 1079 states have (on average 1.6153846153846154) internal successors, (1743), 1079 states have internal predecessors, (1743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,896 INFO L74 IsIncluded]: Start isIncluded. First operand 1327 states. Second operand has 1084 states, 1079 states have (on average 1.6153846153846154) internal successors, (1743), 1079 states have internal predecessors, (1743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,897 INFO L87 Difference]: Start difference. First operand 1327 states. Second operand has 1084 states, 1079 states have (on average 1.6153846153846154) internal successors, (1743), 1079 states have internal predecessors, (1743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:09,955 INFO L93 Difference]: Finished difference Result 1327 states and 2101 transitions. [2022-04-15 11:50:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2101 transitions. [2022-04-15 11:50:09,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:09,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:09,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 1084 states, 1079 states have (on average 1.6153846153846154) internal successors, (1743), 1079 states have internal predecessors, (1743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1327 states. [2022-04-15 11:50:09,959 INFO L87 Difference]: Start difference. First operand has 1084 states, 1079 states have (on average 1.6153846153846154) internal successors, (1743), 1079 states have internal predecessors, (1743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1327 states. [2022-04-15 11:50:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:10,013 INFO L93 Difference]: Finished difference Result 1327 states and 2101 transitions. [2022-04-15 11:50:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 2101 transitions. [2022-04-15 11:50:10,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:10,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:10,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:10,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1079 states have (on average 1.6153846153846154) internal successors, (1743), 1079 states have internal predecessors, (1743), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1747 transitions. [2022-04-15 11:50:10,074 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1747 transitions. Word has length 131 [2022-04-15 11:50:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:10,074 INFO L478 AbstractCegarLoop]: Abstraction has 1084 states and 1747 transitions. [2022-04-15 11:50:10,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:10,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1084 states and 1747 transitions. [2022-04-15 11:50:12,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1747 edges. 1747 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1747 transitions. [2022-04-15 11:50:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 11:50:12,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:12,636 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:12,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 11:50:12,637 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -926647330, now seen corresponding path program 1 times [2022-04-15 11:50:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:12,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526268998] [2022-04-15 11:50:12,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:12,702 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:12,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash -926647330, now seen corresponding path program 2 times [2022-04-15 11:50:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:12,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461356109] [2022-04-15 11:50:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:12,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:12,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {125603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {125596#true} is VALID [2022-04-15 11:50:12,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {125596#true} assume true; {125596#true} is VALID [2022-04-15 11:50:12,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {125596#true} {125596#true} #725#return; {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {125596#true} call ULTIMATE.init(); {125603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {125603#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {125596#true} assume true; {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125596#true} {125596#true} #725#return; {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {125596#true} call #t~ret161 := main(); {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {125596#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; {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {125596#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L272 TraceCheckUtils]: 7: Hoare triple {125596#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {125596#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); {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {125596#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; {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {125596#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; {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {125596#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {125596#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {125596#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {125596#true} assume !false; {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {125596#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {125596#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {125596#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {125596#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {125596#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {125596#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {125596#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {125596#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {125596#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {125596#true} assume 8464 == #t~mem55;havoc #t~mem55; {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {125596#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; {125596#true} is VALID [2022-04-15 11:50:12,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {125596#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {125596#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); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {125596#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); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {125596#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {125596#true} ~skip~0 := 0; {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {125596#true} assume !false; {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {125596#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {125596#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {125596#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {125596#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {125596#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {125596#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {125596#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {125596#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {125596#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {125596#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {125596#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {125596#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {125596#true} assume 8496 == #t~mem58;havoc #t~mem58; {125596#true} is VALID [2022-04-15 11:50:12,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {125596#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {125596#true} is VALID [2022-04-15 11:50:12,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {125596#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {125596#true} is VALID [2022-04-15 11:50:12,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {125596#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {125596#true} is VALID [2022-04-15 11:50:12,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {125596#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {125601#(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); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {125601#(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); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {125601#(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); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {125601#(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); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {125601#(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); {125601#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 59: Hoare triple {125601#(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); {125602#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 60: Hoare triple {125602#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 61: Hoare triple {125597#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; {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 62: Hoare triple {125597#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); {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 63: Hoare triple {125597#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); {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 64: Hoare triple {125597#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {125597#false} ~skip~0 := 0; {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {125597#false} assume !false; {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 67: Hoare triple {125597#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); {125597#false} is VALID [2022-04-15 11:50:12,904 INFO L290 TraceCheckUtils]: 68: Hoare triple {125597#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {125597#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {125597#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 71: Hoare triple {125597#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 72: Hoare triple {125597#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {125597#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {125597#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {125597#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 76: Hoare triple {125597#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 77: Hoare triple {125597#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 78: Hoare triple {125597#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 79: Hoare triple {125597#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {125597#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 81: Hoare triple {125597#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 82: Hoare triple {125597#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,905 INFO L290 TraceCheckUtils]: 83: Hoare triple {125597#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 84: Hoare triple {125597#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 85: Hoare triple {125597#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 86: Hoare triple {125597#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 87: Hoare triple {125597#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 88: Hoare triple {125597#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 89: Hoare triple {125597#false} assume 8448 == #t~mem68;havoc #t~mem68; {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 90: Hoare triple {125597#false} assume !(~num1~0 > 0); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 91: Hoare triple {125597#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; {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 92: Hoare triple {125597#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); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 93: Hoare triple {125597#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 94: Hoare triple {125597#false} ~skip~0 := 0; {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 95: Hoare triple {125597#false} assume !false; {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 96: Hoare triple {125597#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); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 97: Hoare triple {125597#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,906 INFO L290 TraceCheckUtils]: 98: Hoare triple {125597#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 99: Hoare triple {125597#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 100: Hoare triple {125597#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 101: Hoare triple {125597#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 102: Hoare triple {125597#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 103: Hoare triple {125597#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 104: Hoare triple {125597#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 105: Hoare triple {125597#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 106: Hoare triple {125597#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 107: Hoare triple {125597#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 108: Hoare triple {125597#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 109: Hoare triple {125597#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 110: Hoare triple {125597#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 111: Hoare triple {125597#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,907 INFO L290 TraceCheckUtils]: 112: Hoare triple {125597#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 113: Hoare triple {125597#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 114: Hoare triple {125597#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 115: Hoare triple {125597#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 116: Hoare triple {125597#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 117: Hoare triple {125597#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 118: Hoare triple {125597#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 119: Hoare triple {125597#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 120: Hoare triple {125597#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 121: Hoare triple {125597#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 122: Hoare triple {125597#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 123: Hoare triple {125597#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 124: Hoare triple {125597#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 125: Hoare triple {125597#false} assume 8640 == #t~mem75;havoc #t~mem75; {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 126: Hoare triple {125597#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {125597#false} is VALID [2022-04-15 11:50:12,908 INFO L290 TraceCheckUtils]: 127: Hoare triple {125597#false} assume !(9 == ~blastFlag~0); {125597#false} is VALID [2022-04-15 11:50:12,909 INFO L290 TraceCheckUtils]: 128: Hoare triple {125597#false} assume !(12 == ~blastFlag~0); {125597#false} is VALID [2022-04-15 11:50:12,909 INFO L290 TraceCheckUtils]: 129: Hoare triple {125597#false} assume 15 == ~blastFlag~0; {125597#false} is VALID [2022-04-15 11:50:12,909 INFO L290 TraceCheckUtils]: 130: Hoare triple {125597#false} assume !false; {125597#false} is VALID [2022-04-15 11:50:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:50:12,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:12,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461356109] [2022-04-15 11:50:12,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461356109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:12,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:12,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:12,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:12,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526268998] [2022-04-15 11:50:12,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526268998] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:12,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:12,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:12,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504646191] [2022-04-15 11:50:12,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:12,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 11:50:12,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:12,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:12,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:12,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:12,969 INFO L87 Difference]: Start difference. First operand 1084 states and 1747 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:15,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:17,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:24,661 INFO L93 Difference]: Finished difference Result 2393 states and 3797 transitions. [2022-04-15 11:50:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 131 [2022-04-15 11:50:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-04-15 11:50:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-04-15 11:50:24,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 627 transitions. [2022-04-15 11:50:25,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:25,163 INFO L225 Difference]: With dead ends: 2393 [2022-04-15 11:50:25,163 INFO L226 Difference]: Without dead ends: 1335 [2022-04-15 11:50:25,164 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:25,164 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 154 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:25,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 410 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 505 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-04-15 11:50:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-04-15 11:50:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1030. [2022-04-15 11:50:25,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:25,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1335 states. Second operand has 1030 states, 1025 states have (on average 1.6097560975609757) internal successors, (1650), 1025 states have internal predecessors, (1650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:25,215 INFO L74 IsIncluded]: Start isIncluded. First operand 1335 states. Second operand has 1030 states, 1025 states have (on average 1.6097560975609757) internal successors, (1650), 1025 states have internal predecessors, (1650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:25,216 INFO L87 Difference]: Start difference. First operand 1335 states. Second operand has 1030 states, 1025 states have (on average 1.6097560975609757) internal successors, (1650), 1025 states have internal predecessors, (1650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:25,265 INFO L93 Difference]: Finished difference Result 1335 states and 2069 transitions. [2022-04-15 11:50:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2069 transitions. [2022-04-15 11:50:25,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:25,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:25,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 1030 states, 1025 states have (on average 1.6097560975609757) internal successors, (1650), 1025 states have internal predecessors, (1650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1335 states. [2022-04-15 11:50:25,275 INFO L87 Difference]: Start difference. First operand has 1030 states, 1025 states have (on average 1.6097560975609757) internal successors, (1650), 1025 states have internal predecessors, (1650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1335 states. [2022-04-15 11:50:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:25,323 INFO L93 Difference]: Finished difference Result 1335 states and 2069 transitions. [2022-04-15 11:50:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2069 transitions. [2022-04-15 11:50:25,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:25,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:25,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:25,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1025 states have (on average 1.6097560975609757) internal successors, (1650), 1025 states have internal predecessors, (1650), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1654 transitions. [2022-04-15 11:50:25,373 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1654 transitions. Word has length 131 [2022-04-15 11:50:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:25,373 INFO L478 AbstractCegarLoop]: Abstraction has 1030 states and 1654 transitions. [2022-04-15 11:50:25,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:25,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1030 states and 1654 transitions. [2022-04-15 11:50:28,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1654 edges. 1654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1654 transitions. [2022-04-15 11:50:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 11:50:28,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:28,407 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:28,407 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 11:50:28,407 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1030720699, now seen corresponding path program 1 times [2022-04-15 11:50:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:28,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933562192] [2022-04-15 11:50:28,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:28,470 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:28,470 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1030720699, now seen corresponding path program 2 times [2022-04-15 11:50:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:28,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310368349] [2022-04-15 11:50:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:28,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {135131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {135124#true} is VALID [2022-04-15 11:50:28,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {135124#true} assume true; {135124#true} is VALID [2022-04-15 11:50:28,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135124#true} {135124#true} #725#return; {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {135124#true} call ULTIMATE.init(); {135131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {135131#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {135124#true} assume true; {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135124#true} {135124#true} #725#return; {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {135124#true} call #t~ret161 := main(); {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {135124#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; {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {135124#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L272 TraceCheckUtils]: 7: Hoare triple {135124#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {135124#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); {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {135124#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; {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {135124#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; {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {135124#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {135124#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {135124#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {135124#true} assume !false; {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {135124#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {135124#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {135124#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {135124#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {135124#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {135124#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {135124#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {135124#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {135124#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {135124#true} assume 8464 == #t~mem55;havoc #t~mem55; {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {135124#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; {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {135124#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {135124#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); {135124#true} is VALID [2022-04-15 11:50:28,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {135124#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); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {135124#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {135124#true} ~skip~0 := 0; {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {135124#true} assume !false; {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {135124#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {135124#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {135124#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {135124#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {135124#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {135124#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {135124#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {135124#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {135124#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {135124#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {135124#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {135124#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {135124#true} assume 8496 == #t~mem58;havoc #t~mem58; {135124#true} is VALID [2022-04-15 11:50:28,642 INFO L290 TraceCheckUtils]: 45: Hoare triple {135124#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {135124#true} is VALID [2022-04-15 11:50:28,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {135124#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {135124#true} is VALID [2022-04-15 11:50:28,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {135124#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {135124#true} is VALID [2022-04-15 11:50:28,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {135124#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {135129#(= 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); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {135129#(= 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; {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,644 INFO L290 TraceCheckUtils]: 52: Hoare triple {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,645 INFO L290 TraceCheckUtils]: 54: Hoare triple {135129#(= 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); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,645 INFO L290 TraceCheckUtils]: 55: Hoare triple {135129#(= 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); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {135129#(= 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); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {135129#(= 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); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {135129#(= 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); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,647 INFO L290 TraceCheckUtils]: 59: Hoare triple {135129#(= 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); {135129#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:50:28,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {135129#(= 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); {135130#(= |ssl3_accept_#t~mem53| 8656)} is VALID [2022-04-15 11:50:28,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {135130#(= |ssl3_accept_#t~mem53| 8656)} assume 8481 == #t~mem53;havoc #t~mem53; {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 62: Hoare triple {135125#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; {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 63: Hoare triple {135125#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); {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {135125#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); {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 65: Hoare triple {135125#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 66: Hoare triple {135125#false} ~skip~0 := 0; {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 67: Hoare triple {135125#false} assume !false; {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 68: Hoare triple {135125#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); {135125#false} is VALID [2022-04-15 11:50:28,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {135125#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {135125#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 71: Hoare triple {135125#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {135125#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {135125#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {135125#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {135125#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {135125#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 77: Hoare triple {135125#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 78: Hoare triple {135125#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 79: Hoare triple {135125#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 80: Hoare triple {135125#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 81: Hoare triple {135125#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {135125#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {135125#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 84: Hoare triple {135125#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 85: Hoare triple {135125#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 86: Hoare triple {135125#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 87: Hoare triple {135125#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 88: Hoare triple {135125#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 89: Hoare triple {135125#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 90: Hoare triple {135125#false} assume 8448 == #t~mem68;havoc #t~mem68; {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 91: Hoare triple {135125#false} assume !(~num1~0 > 0); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 92: Hoare triple {135125#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; {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 93: Hoare triple {135125#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); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 94: Hoare triple {135125#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 95: Hoare triple {135125#false} ~skip~0 := 0; {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 96: Hoare triple {135125#false} assume !false; {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 97: Hoare triple {135125#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); {135125#false} is VALID [2022-04-15 11:50:28,660 INFO L290 TraceCheckUtils]: 98: Hoare triple {135125#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 99: Hoare triple {135125#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 100: Hoare triple {135125#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 101: Hoare triple {135125#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 102: Hoare triple {135125#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 103: Hoare triple {135125#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 104: Hoare triple {135125#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 105: Hoare triple {135125#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 106: Hoare triple {135125#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 107: Hoare triple {135125#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 108: Hoare triple {135125#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 109: Hoare triple {135125#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 110: Hoare triple {135125#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 111: Hoare triple {135125#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,661 INFO L290 TraceCheckUtils]: 112: Hoare triple {135125#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 113: Hoare triple {135125#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 114: Hoare triple {135125#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 115: Hoare triple {135125#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 116: Hoare triple {135125#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 117: Hoare triple {135125#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 118: Hoare triple {135125#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 119: Hoare triple {135125#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 120: Hoare triple {135125#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 121: Hoare triple {135125#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 122: Hoare triple {135125#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 123: Hoare triple {135125#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 124: Hoare triple {135125#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 125: Hoare triple {135125#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 126: Hoare triple {135125#false} assume 8640 == #t~mem75;havoc #t~mem75; {135125#false} is VALID [2022-04-15 11:50:28,662 INFO L290 TraceCheckUtils]: 127: Hoare triple {135125#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {135125#false} is VALID [2022-04-15 11:50:28,663 INFO L290 TraceCheckUtils]: 128: Hoare triple {135125#false} assume !(9 == ~blastFlag~0); {135125#false} is VALID [2022-04-15 11:50:28,663 INFO L290 TraceCheckUtils]: 129: Hoare triple {135125#false} assume !(12 == ~blastFlag~0); {135125#false} is VALID [2022-04-15 11:50:28,663 INFO L290 TraceCheckUtils]: 130: Hoare triple {135125#false} assume 15 == ~blastFlag~0; {135125#false} is VALID [2022-04-15 11:50:28,663 INFO L290 TraceCheckUtils]: 131: Hoare triple {135125#false} assume !false; {135125#false} is VALID [2022-04-15 11:50:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:50:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310368349] [2022-04-15 11:50:28,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310368349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:28,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:28,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:28,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:28,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933562192] [2022-04-15 11:50:28,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933562192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:28,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:28,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071740127] [2022-04-15 11:50:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:50:28,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:28,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:28,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:28,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:28,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:28,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:28,736 INFO L87 Difference]: Start difference. First operand 1030 states and 1654 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:32,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:38,115 INFO L93 Difference]: Finished difference Result 2325 states and 3700 transitions. [2022-04-15 11:50:38,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:38,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:50:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-15 11:50:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-04-15 11:50:38,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 581 transitions. [2022-04-15 11:50:38,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 581 edges. 581 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:38,571 INFO L225 Difference]: With dead ends: 2325 [2022-04-15 11:50:38,571 INFO L226 Difference]: Without dead ends: 1321 [2022-04-15 11:50:38,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:38,573 INFO L913 BasicCegarLoop]: 287 mSDtfsCounter, 106 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:38,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 699 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:50:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-04-15 11:50:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1087. [2022-04-15 11:50:38,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:38,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1321 states. Second operand has 1087 states, 1082 states have (on average 1.599815157116451) internal successors, (1731), 1082 states have internal predecessors, (1731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:38,630 INFO L74 IsIncluded]: Start isIncluded. First operand 1321 states. Second operand has 1087 states, 1082 states have (on average 1.599815157116451) internal successors, (1731), 1082 states have internal predecessors, (1731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:38,631 INFO L87 Difference]: Start difference. First operand 1321 states. Second operand has 1087 states, 1082 states have (on average 1.599815157116451) internal successors, (1731), 1082 states have internal predecessors, (1731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:38,685 INFO L93 Difference]: Finished difference Result 1321 states and 2077 transitions. [2022-04-15 11:50:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2077 transitions. [2022-04-15 11:50:38,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:38,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:38,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 1087 states, 1082 states have (on average 1.599815157116451) internal successors, (1731), 1082 states have internal predecessors, (1731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1321 states. [2022-04-15 11:50:38,689 INFO L87 Difference]: Start difference. First operand has 1087 states, 1082 states have (on average 1.599815157116451) internal successors, (1731), 1082 states have internal predecessors, (1731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1321 states. [2022-04-15 11:50:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:38,755 INFO L93 Difference]: Finished difference Result 1321 states and 2077 transitions. [2022-04-15 11:50:38,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 2077 transitions. [2022-04-15 11:50:38,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:38,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:38,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:38,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1082 states have (on average 1.599815157116451) internal successors, (1731), 1082 states have internal predecessors, (1731), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1735 transitions. [2022-04-15 11:50:38,842 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1735 transitions. Word has length 132 [2022-04-15 11:50:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:38,842 INFO L478 AbstractCegarLoop]: Abstraction has 1087 states and 1735 transitions. [2022-04-15 11:50:38,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:38,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1087 states and 1735 transitions. [2022-04-15 11:50:42,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1735 edges. 1734 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1735 transitions. [2022-04-15 11:50:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 11:50:42,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:42,653 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:42,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 11:50:42,653 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1811432023, now seen corresponding path program 1 times [2022-04-15 11:50:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:42,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997703341] [2022-04-15 11:50:42,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:42,721 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:42,722 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:42,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1811432023, now seen corresponding path program 2 times [2022-04-15 11:50:42,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:42,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817030290] [2022-04-15 11:50:42,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:42,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:42,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {144609#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {144602#true} is VALID [2022-04-15 11:50:42,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {144602#true} assume true; {144602#true} is VALID [2022-04-15 11:50:42,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144602#true} {144602#true} #725#return; {144602#true} is VALID [2022-04-15 11:50:42,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {144602#true} call ULTIMATE.init(); {144609#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:50:42,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {144609#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {144602#true} is VALID [2022-04-15 11:50:42,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {144602#true} assume true; {144602#true} is VALID [2022-04-15 11:50:42,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144602#true} {144602#true} #725#return; {144602#true} is VALID [2022-04-15 11:50:42,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {144602#true} call #t~ret161 := main(); {144602#true} is VALID [2022-04-15 11:50:42,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {144602#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; {144602#true} is VALID [2022-04-15 11:50:42,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {144602#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L272 TraceCheckUtils]: 7: Hoare triple {144602#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {144602#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); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {144602#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; {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {144602#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; {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {144602#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {144602#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {144602#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {144602#true} assume !false; {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {144602#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {144602#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {144602#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {144602#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {144602#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {144602#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {144602#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {144602#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {144602#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {144602#true} assume 8464 == #t~mem55;havoc #t~mem55; {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {144602#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; {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {144602#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {144602#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); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {144602#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); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {144602#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {144602#true} ~skip~0 := 0; {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {144602#true} assume !false; {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {144602#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {144602#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {144602#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {144602#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {144602#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {144602#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {144602#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 39: Hoare triple {144602#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 40: Hoare triple {144602#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {144602#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {144602#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {144602#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {144602#true} assume 8496 == #t~mem58;havoc #t~mem58; {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {144602#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {144602#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {144602#true} is VALID [2022-04-15 11:50:42,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {144602#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {144602#true} is VALID [2022-04-15 11:50:42,851 INFO L290 TraceCheckUtils]: 48: Hoare triple {144602#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,852 INFO L290 TraceCheckUtils]: 50: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,853 INFO L290 TraceCheckUtils]: 52: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,853 INFO L290 TraceCheckUtils]: 53: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,857 INFO L290 TraceCheckUtils]: 65: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,857 INFO L290 TraceCheckUtils]: 66: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,858 INFO L290 TraceCheckUtils]: 67: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,858 INFO L290 TraceCheckUtils]: 68: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,858 INFO L290 TraceCheckUtils]: 69: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,859 INFO L290 TraceCheckUtils]: 70: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,859 INFO L290 TraceCheckUtils]: 71: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,859 INFO L290 TraceCheckUtils]: 72: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,861 INFO L290 TraceCheckUtils]: 76: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,861 INFO L290 TraceCheckUtils]: 78: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,863 INFO L290 TraceCheckUtils]: 83: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,872 INFO L290 TraceCheckUtils]: 85: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 86: Hoare triple {144607#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {144608#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 87: Hoare triple {144608#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {144603#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 89: Hoare triple {144603#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 90: Hoare triple {144603#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); {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 91: Hoare triple {144603#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; {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 92: Hoare triple {144603#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 93: Hoare triple {144603#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); {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 94: Hoare triple {144603#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 95: Hoare triple {144603#false} ~skip~0 := 0; {144603#false} is VALID [2022-04-15 11:50:42,873 INFO L290 TraceCheckUtils]: 96: Hoare triple {144603#false} assume !false; {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 97: Hoare triple {144603#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); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 98: Hoare triple {144603#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 99: Hoare triple {144603#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 100: Hoare triple {144603#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 101: Hoare triple {144603#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 102: Hoare triple {144603#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 103: Hoare triple {144603#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 104: Hoare triple {144603#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 105: Hoare triple {144603#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 106: Hoare triple {144603#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 107: Hoare triple {144603#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 108: Hoare triple {144603#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 109: Hoare triple {144603#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 110: Hoare triple {144603#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,874 INFO L290 TraceCheckUtils]: 111: Hoare triple {144603#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 112: Hoare triple {144603#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 113: Hoare triple {144603#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 114: Hoare triple {144603#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 115: Hoare triple {144603#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 116: Hoare triple {144603#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 117: Hoare triple {144603#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 118: Hoare triple {144603#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 119: Hoare triple {144603#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 120: Hoare triple {144603#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 121: Hoare triple {144603#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 122: Hoare triple {144603#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 123: Hoare triple {144603#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 124: Hoare triple {144603#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 125: Hoare triple {144603#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {144603#false} is VALID [2022-04-15 11:50:42,875 INFO L290 TraceCheckUtils]: 126: Hoare triple {144603#false} assume 8640 == #t~mem75;havoc #t~mem75; {144603#false} is VALID [2022-04-15 11:50:42,876 INFO L290 TraceCheckUtils]: 127: Hoare triple {144603#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {144603#false} is VALID [2022-04-15 11:50:42,876 INFO L290 TraceCheckUtils]: 128: Hoare triple {144603#false} assume !(9 == ~blastFlag~0); {144603#false} is VALID [2022-04-15 11:50:42,876 INFO L290 TraceCheckUtils]: 129: Hoare triple {144603#false} assume !(12 == ~blastFlag~0); {144603#false} is VALID [2022-04-15 11:50:42,876 INFO L290 TraceCheckUtils]: 130: Hoare triple {144603#false} assume 15 == ~blastFlag~0; {144603#false} is VALID [2022-04-15 11:50:42,876 INFO L290 TraceCheckUtils]: 131: Hoare triple {144603#false} assume !false; {144603#false} is VALID [2022-04-15 11:50:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:50:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:42,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817030290] [2022-04-15 11:50:42,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817030290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:42,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:42,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:42,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:42,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997703341] [2022-04-15 11:50:42,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997703341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:42,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:42,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337164499] [2022-04-15 11:50:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:42,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:50:42,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:42,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:42,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:42,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:42,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:42,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:42,957 INFO L87 Difference]: Start difference. First operand 1087 states and 1735 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:47,483 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:50:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:53,897 INFO L93 Difference]: Finished difference Result 2519 states and 3974 transitions. [2022-04-15 11:50:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:50:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:50:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:50:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-04-15 11:50:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-04-15 11:50:53,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 627 transitions. [2022-04-15 11:50:54,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:54,445 INFO L225 Difference]: With dead ends: 2519 [2022-04-15 11:50:54,445 INFO L226 Difference]: Without dead ends: 1458 [2022-04-15 11:50:54,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:50:54,447 INFO L913 BasicCegarLoop]: 145 mSDtfsCounter, 126 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:50:54,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 411 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 505 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:50:54,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2022-04-15 11:50:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1216. [2022-04-15 11:50:54,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:50:54,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1458 states. Second operand has 1216 states, 1211 states have (on average 1.6077621800165154) internal successors, (1947), 1211 states have internal predecessors, (1947), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:54,532 INFO L74 IsIncluded]: Start isIncluded. First operand 1458 states. Second operand has 1216 states, 1211 states have (on average 1.6077621800165154) internal successors, (1947), 1211 states have internal predecessors, (1947), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:54,533 INFO L87 Difference]: Start difference. First operand 1458 states. Second operand has 1216 states, 1211 states have (on average 1.6077621800165154) internal successors, (1947), 1211 states have internal predecessors, (1947), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:54,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:54,593 INFO L93 Difference]: Finished difference Result 1458 states and 2270 transitions. [2022-04-15 11:50:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2270 transitions. [2022-04-15 11:50:54,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:54,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:54,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 1216 states, 1211 states have (on average 1.6077621800165154) internal successors, (1947), 1211 states have internal predecessors, (1947), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1458 states. [2022-04-15 11:50:54,596 INFO L87 Difference]: Start difference. First operand has 1216 states, 1211 states have (on average 1.6077621800165154) internal successors, (1947), 1211 states have internal predecessors, (1947), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1458 states. [2022-04-15 11:50:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:50:54,658 INFO L93 Difference]: Finished difference Result 1458 states and 2270 transitions. [2022-04-15 11:50:54,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2270 transitions. [2022-04-15 11:50:54,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:50:54,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:50:54,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:50:54,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:50:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 1211 states have (on average 1.6077621800165154) internal successors, (1947), 1211 states have internal predecessors, (1947), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1951 transitions. [2022-04-15 11:50:54,736 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1951 transitions. Word has length 132 [2022-04-15 11:50:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:50:54,737 INFO L478 AbstractCegarLoop]: Abstraction has 1216 states and 1951 transitions. [2022-04-15 11:50:54,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:54,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1216 states and 1951 transitions. [2022-04-15 11:50:58,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1951 edges. 1951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1951 transitions. [2022-04-15 11:50:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 11:50:58,244 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:50:58,244 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:50:58,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 11:50:58,244 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:50:58,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:50:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1385115651, now seen corresponding path program 1 times [2022-04-15 11:50:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:58,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1779854338] [2022-04-15 11:50:58,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:50:58,314 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:50:58,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:50:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1385115651, now seen corresponding path program 2 times [2022-04-15 11:50:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:50:58,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128007663] [2022-04-15 11:50:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:50:58,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:50:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:50:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:50:58,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {155007#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {155000#true} is VALID [2022-04-15 11:50:58,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {155000#true} assume true; {155000#true} is VALID [2022-04-15 11:50:58,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {155000#true} {155000#true} #725#return; {155000#true} is VALID [2022-04-15 11:50:58,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {155000#true} call ULTIMATE.init(); {155007#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:50:58,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {155007#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {155000#true} is VALID [2022-04-15 11:50:58,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {155000#true} assume true; {155000#true} is VALID [2022-04-15 11:50:58,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {155000#true} {155000#true} #725#return; {155000#true} is VALID [2022-04-15 11:50:58,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {155000#true} call #t~ret161 := main(); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {155000#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; {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {155000#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L272 TraceCheckUtils]: 7: Hoare triple {155000#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {155000#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); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {155000#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; {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {155000#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; {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {155000#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {155000#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {155000#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {155000#true} assume !false; {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {155000#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {155000#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {155000#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {155000#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {155000#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {155000#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {155000#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {155000#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {155000#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {155000#true} assume 8464 == #t~mem55;havoc #t~mem55; {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {155000#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; {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {155000#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {155000#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); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {155000#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); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 29: Hoare triple {155000#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {155000#true} ~skip~0 := 0; {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {155000#true} assume !false; {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 32: Hoare triple {155000#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {155000#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {155000#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {155000#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {155000#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 37: Hoare triple {155000#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {155000#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {155000#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {155000#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {155000#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {155000#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {155000#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {155000#true} assume 8496 == #t~mem58;havoc #t~mem58; {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {155000#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {155000#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {155000#true} is VALID [2022-04-15 11:50:58,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {155000#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {155000#true} is VALID [2022-04-15 11:50:58,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {155000#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {155005#(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; {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} ~skip~0 := 0; {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,462 INFO L290 TraceCheckUtils]: 59: Hoare triple {155005#(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); {155005#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-15 11:50:58,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {155005#(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); {155006#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-15 11:50:58,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {155006#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {155001#false} is VALID [2022-04-15 11:50:58,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {155001#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; {155001#false} is VALID [2022-04-15 11:50:58,463 INFO L290 TraceCheckUtils]: 63: Hoare triple {155001#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); {155001#false} is VALID [2022-04-15 11:50:58,463 INFO L290 TraceCheckUtils]: 64: Hoare triple {155001#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); {155001#false} is VALID [2022-04-15 11:50:58,463 INFO L290 TraceCheckUtils]: 65: Hoare triple {155001#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 66: Hoare triple {155001#false} ~skip~0 := 0; {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 67: Hoare triple {155001#false} assume !false; {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 68: Hoare triple {155001#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); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 69: Hoare triple {155001#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 70: Hoare triple {155001#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 71: Hoare triple {155001#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 72: Hoare triple {155001#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 73: Hoare triple {155001#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 74: Hoare triple {155001#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 75: Hoare triple {155001#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 76: Hoare triple {155001#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 77: Hoare triple {155001#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 78: Hoare triple {155001#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 79: Hoare triple {155001#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,464 INFO L290 TraceCheckUtils]: 80: Hoare triple {155001#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,465 INFO L290 TraceCheckUtils]: 81: Hoare triple {155001#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,465 INFO L290 TraceCheckUtils]: 82: Hoare triple {155001#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,465 INFO L290 TraceCheckUtils]: 83: Hoare triple {155001#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,465 INFO L290 TraceCheckUtils]: 84: Hoare triple {155001#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,465 INFO L290 TraceCheckUtils]: 85: Hoare triple {155001#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,465 INFO L290 TraceCheckUtils]: 86: Hoare triple {155001#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,475 INFO L290 TraceCheckUtils]: 87: Hoare triple {155001#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,475 INFO L290 TraceCheckUtils]: 88: Hoare triple {155001#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {155001#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,475 INFO L290 TraceCheckUtils]: 90: Hoare triple {155001#false} assume 8448 == #t~mem68;havoc #t~mem68; {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 91: Hoare triple {155001#false} assume !(~num1~0 > 0); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 92: Hoare triple {155001#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; {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {155001#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); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 94: Hoare triple {155001#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 95: Hoare triple {155001#false} ~skip~0 := 0; {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 96: Hoare triple {155001#false} assume !false; {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 97: Hoare triple {155001#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); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 98: Hoare triple {155001#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 99: Hoare triple {155001#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 100: Hoare triple {155001#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 101: Hoare triple {155001#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 102: Hoare triple {155001#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 103: Hoare triple {155001#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,476 INFO L290 TraceCheckUtils]: 104: Hoare triple {155001#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 105: Hoare triple {155001#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 106: Hoare triple {155001#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 107: Hoare triple {155001#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 108: Hoare triple {155001#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 109: Hoare triple {155001#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 110: Hoare triple {155001#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 111: Hoare triple {155001#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 112: Hoare triple {155001#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 113: Hoare triple {155001#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 114: Hoare triple {155001#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 115: Hoare triple {155001#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 116: Hoare triple {155001#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 117: Hoare triple {155001#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,477 INFO L290 TraceCheckUtils]: 118: Hoare triple {155001#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 119: Hoare triple {155001#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 120: Hoare triple {155001#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 121: Hoare triple {155001#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 122: Hoare triple {155001#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 123: Hoare triple {155001#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 124: Hoare triple {155001#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 125: Hoare triple {155001#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 126: Hoare triple {155001#false} assume 8640 == #t~mem75;havoc #t~mem75; {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 127: Hoare triple {155001#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 128: Hoare triple {155001#false} assume !(9 == ~blastFlag~0); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 129: Hoare triple {155001#false} assume !(12 == ~blastFlag~0); {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 130: Hoare triple {155001#false} assume 15 == ~blastFlag~0; {155001#false} is VALID [2022-04-15 11:50:58,478 INFO L290 TraceCheckUtils]: 131: Hoare triple {155001#false} assume !false; {155001#false} is VALID [2022-04-15 11:50:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:50:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:50:58,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128007663] [2022-04-15 11:50:58,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128007663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:58,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:58,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:58,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:50:58,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1779854338] [2022-04-15 11:50:58,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1779854338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:50:58,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:50:58,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:50:58,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309475130] [2022-04-15 11:50:58,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:50:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:50:58,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:50:58,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:50:58,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:50:58,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:50:58,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:50:58,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:50:58,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:50:58,553 INFO L87 Difference]: Start difference. First operand 1216 states and 1951 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:02,503 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-15 11:51:05,669 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-15 11:51:07,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:10,010 INFO L93 Difference]: Finished difference Result 2655 states and 4203 transitions. [2022-04-15 11:51:10,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-15 11:51:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-04-15 11:51:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2022-04-15 11:51:10,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 627 transitions. [2022-04-15 11:51:10,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 627 edges. 627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:10,515 INFO L225 Difference]: With dead ends: 2655 [2022-04-15 11:51:10,515 INFO L226 Difference]: Without dead ends: 1465 [2022-04-15 11:51:10,516 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:10,516 INFO L913 BasicCegarLoop]: 137 mSDtfsCounter, 153 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:10,517 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 394 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 11:51:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-04-15 11:51:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1159. [2022-04-15 11:51:10,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:10,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1465 states. Second operand has 1159 states, 1154 states have (on average 1.60051993067591) internal successors, (1847), 1154 states have internal predecessors, (1847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:10,597 INFO L74 IsIncluded]: Start isIncluded. First operand 1465 states. Second operand has 1159 states, 1154 states have (on average 1.60051993067591) internal successors, (1847), 1154 states have internal predecessors, (1847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:10,598 INFO L87 Difference]: Start difference. First operand 1465 states. Second operand has 1159 states, 1154 states have (on average 1.60051993067591) internal successors, (1847), 1154 states have internal predecessors, (1847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:10,658 INFO L93 Difference]: Finished difference Result 1465 states and 2267 transitions. [2022-04-15 11:51:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2267 transitions. [2022-04-15 11:51:10,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:10,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:10,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 1159 states, 1154 states have (on average 1.60051993067591) internal successors, (1847), 1154 states have internal predecessors, (1847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1465 states. [2022-04-15 11:51:10,661 INFO L87 Difference]: Start difference. First operand has 1159 states, 1154 states have (on average 1.60051993067591) internal successors, (1847), 1154 states have internal predecessors, (1847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1465 states. [2022-04-15 11:51:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:10,730 INFO L93 Difference]: Finished difference Result 1465 states and 2267 transitions. [2022-04-15 11:51:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2267 transitions. [2022-04-15 11:51:10,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:10,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:10,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:10,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1154 states have (on average 1.60051993067591) internal successors, (1847), 1154 states have internal predecessors, (1847), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1851 transitions. [2022-04-15 11:51:10,796 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1851 transitions. Word has length 132 [2022-04-15 11:51:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:10,797 INFO L478 AbstractCegarLoop]: Abstraction has 1159 states and 1851 transitions. [2022-04-15 11:51:10,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:10,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1159 states and 1851 transitions. [2022-04-15 11:51:13,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1851 edges. 1851 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:13,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1851 transitions. [2022-04-15 11:51:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:51:13,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:13,828 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:13,828 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 11:51:13,828 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:13,828 INFO L85 PathProgramCache]: Analyzing trace with hash 932945139, now seen corresponding path program 1 times [2022-04-15 11:51:13,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:13,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373751474] [2022-04-15 11:51:13,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:13,901 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:13,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:13,901 INFO L85 PathProgramCache]: Analyzing trace with hash 932945139, now seen corresponding path program 2 times [2022-04-15 11:51:13,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:13,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915980172] [2022-04-15 11:51:13,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:13,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:14,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {165577#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165570#true} is VALID [2022-04-15 11:51:14,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {165570#true} assume true; {165570#true} is VALID [2022-04-15 11:51:14,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165570#true} {165570#true} #725#return; {165570#true} is VALID [2022-04-15 11:51:14,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {165570#true} call ULTIMATE.init(); {165577#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:51:14,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {165577#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {165570#true} is VALID [2022-04-15 11:51:14,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {165570#true} assume true; {165570#true} is VALID [2022-04-15 11:51:14,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165570#true} {165570#true} #725#return; {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {165570#true} call #t~ret161 := main(); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {165570#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; {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {165570#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L272 TraceCheckUtils]: 7: Hoare triple {165570#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {165570#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); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {165570#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; {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {165570#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; {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {165570#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {165570#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {165570#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {165570#true} assume !false; {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {165570#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {165570#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {165570#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {165570#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {165570#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {165570#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {165570#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {165570#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {165570#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {165570#true} assume 8464 == #t~mem55;havoc #t~mem55; {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {165570#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; {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {165570#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {165570#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); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {165570#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); {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {165570#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {165570#true} ~skip~0 := 0; {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {165570#true} assume !false; {165570#true} is VALID [2022-04-15 11:51:14,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {165570#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {165570#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {165570#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {165570#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {165570#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {165570#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {165570#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {165570#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {165570#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {165570#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {165570#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {165570#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {165570#true} assume 8496 == #t~mem58;havoc #t~mem58; {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {165570#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {165570#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {165570#true} is VALID [2022-04-15 11:51:14,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {165570#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {165570#true} is VALID [2022-04-15 11:51:14,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {165570#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {165575#(= 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; {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,046 INFO L290 TraceCheckUtils]: 62: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,048 INFO L290 TraceCheckUtils]: 65: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,048 INFO L290 TraceCheckUtils]: 66: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,048 INFO L290 TraceCheckUtils]: 67: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,049 INFO L290 TraceCheckUtils]: 68: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,049 INFO L290 TraceCheckUtils]: 69: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,049 INFO L290 TraceCheckUtils]: 70: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,050 INFO L290 TraceCheckUtils]: 72: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,050 INFO L290 TraceCheckUtils]: 73: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,051 INFO L290 TraceCheckUtils]: 74: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,051 INFO L290 TraceCheckUtils]: 75: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,051 INFO L290 TraceCheckUtils]: 76: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,052 INFO L290 TraceCheckUtils]: 78: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,052 INFO L290 TraceCheckUtils]: 79: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,053 INFO L290 TraceCheckUtils]: 81: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,053 INFO L290 TraceCheckUtils]: 82: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,054 INFO L290 TraceCheckUtils]: 83: Hoare triple {165575#(= 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); {165575#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:51:14,054 INFO L290 TraceCheckUtils]: 84: Hoare triple {165575#(= 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); {165576#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-15 11:51:14,054 INFO L290 TraceCheckUtils]: 85: Hoare triple {165576#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,054 INFO L290 TraceCheckUtils]: 86: Hoare triple {165571#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 87: Hoare triple {165571#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 88: Hoare triple {165571#false} assume 8673 == #t~mem80;havoc #t~mem80; {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 89: Hoare triple {165571#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 90: Hoare triple {165571#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 91: Hoare triple {165571#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); {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 92: Hoare triple {165571#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; {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 93: Hoare triple {165571#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 94: Hoare triple {165571#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); {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 95: Hoare triple {165571#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 96: Hoare triple {165571#false} ~skip~0 := 0; {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 97: Hoare triple {165571#false} assume !false; {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 98: Hoare triple {165571#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); {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {165571#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,055 INFO L290 TraceCheckUtils]: 100: Hoare triple {165571#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 101: Hoare triple {165571#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {165571#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 103: Hoare triple {165571#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 104: Hoare triple {165571#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {165571#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 106: Hoare triple {165571#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 107: Hoare triple {165571#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 108: Hoare triple {165571#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 109: Hoare triple {165571#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {165571#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 111: Hoare triple {165571#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {165571#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 113: Hoare triple {165571#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 114: Hoare triple {165571#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 115: Hoare triple {165571#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,056 INFO L290 TraceCheckUtils]: 116: Hoare triple {165571#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 117: Hoare triple {165571#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 118: Hoare triple {165571#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 119: Hoare triple {165571#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 120: Hoare triple {165571#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 121: Hoare triple {165571#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 122: Hoare triple {165571#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 123: Hoare triple {165571#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 124: Hoare triple {165571#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 125: Hoare triple {165571#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 126: Hoare triple {165571#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 127: Hoare triple {165571#false} assume 8640 == #t~mem75;havoc #t~mem75; {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 128: Hoare triple {165571#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {165571#false} is VALID [2022-04-15 11:51:14,057 INFO L290 TraceCheckUtils]: 129: Hoare triple {165571#false} assume !(9 == ~blastFlag~0); {165571#false} is VALID [2022-04-15 11:51:14,058 INFO L290 TraceCheckUtils]: 130: Hoare triple {165571#false} assume !(12 == ~blastFlag~0); {165571#false} is VALID [2022-04-15 11:51:14,058 INFO L290 TraceCheckUtils]: 131: Hoare triple {165571#false} assume 15 == ~blastFlag~0; {165571#false} is VALID [2022-04-15 11:51:14,058 INFO L290 TraceCheckUtils]: 132: Hoare triple {165571#false} assume !false; {165571#false} is VALID [2022-04-15 11:51:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:51:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:14,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915980172] [2022-04-15 11:51:14,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915980172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:14,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:14,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:14,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:14,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373751474] [2022-04-15 11:51:14,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373751474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:14,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:14,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880761519] [2022-04-15 11:51:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:14,059 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-15 11:51:14,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:14,059 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-15 11:51:14,149 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-15 11:51:14,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:14,149 INFO L87 Difference]: Start difference. First operand 1159 states and 1851 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-15 11:51:20,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:23,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:26,710 INFO L93 Difference]: Finished difference Result 2562 states and 4063 transitions. [2022-04-15 11:51:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:26,711 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-15 11:51:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:26,711 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-15 11:51:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-15 11:51:26,713 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-15 11:51:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-04-15 11:51:26,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 569 transitions. [2022-04-15 11:51:27,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:27,156 INFO L225 Difference]: With dead ends: 2562 [2022-04-15 11:51:27,156 INFO L226 Difference]: Without dead ends: 1429 [2022-04-15 11:51:27,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:27,158 INFO L913 BasicCegarLoop]: 280 mSDtfsCounter, 71 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:27,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 685 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 614 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:51:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2022-04-15 11:51:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1288. [2022-04-15 11:51:27,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:27,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1429 states. Second operand has 1288 states, 1283 states have (on average 1.6009353078721746) internal successors, (2054), 1283 states have internal predecessors, (2054), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:27,249 INFO L74 IsIncluded]: Start isIncluded. First operand 1429 states. Second operand has 1288 states, 1283 states have (on average 1.6009353078721746) internal successors, (2054), 1283 states have internal predecessors, (2054), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:27,250 INFO L87 Difference]: Start difference. First operand 1429 states. Second operand has 1288 states, 1283 states have (on average 1.6009353078721746) internal successors, (2054), 1283 states have internal predecessors, (2054), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:27,307 INFO L93 Difference]: Finished difference Result 1429 states and 2242 transitions. [2022-04-15 11:51:27,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2242 transitions. [2022-04-15 11:51:27,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:27,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:27,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 1288 states, 1283 states have (on average 1.6009353078721746) internal successors, (2054), 1283 states have internal predecessors, (2054), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1429 states. [2022-04-15 11:51:27,309 INFO L87 Difference]: Start difference. First operand has 1288 states, 1283 states have (on average 1.6009353078721746) internal successors, (2054), 1283 states have internal predecessors, (2054), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1429 states. [2022-04-15 11:51:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:27,366 INFO L93 Difference]: Finished difference Result 1429 states and 2242 transitions. [2022-04-15 11:51:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2242 transitions. [2022-04-15 11:51:27,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:27,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:27,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:27,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1283 states have (on average 1.6009353078721746) internal successors, (2054), 1283 states have internal predecessors, (2054), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 2058 transitions. [2022-04-15 11:51:27,451 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 2058 transitions. Word has length 133 [2022-04-15 11:51:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:27,452 INFO L478 AbstractCegarLoop]: Abstraction has 1288 states and 2058 transitions. [2022-04-15 11:51:27,452 INFO L479 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-15 11:51:27,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1288 states and 2058 transitions. [2022-04-15 11:51:31,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2058 edges. 2058 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 2058 transitions. [2022-04-15 11:51:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 11:51:31,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:31,226 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:31,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 11:51:31,227 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1485539339, now seen corresponding path program 1 times [2022-04-15 11:51:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:31,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160518903] [2022-04-15 11:51:31,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:31,297 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:31,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:31,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1485539339, now seen corresponding path program 2 times [2022-04-15 11:51:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:31,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014782435] [2022-04-15 11:51:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:31,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:31,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {176147#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {176140#true} is VALID [2022-04-15 11:51:31,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {176140#true} assume true; {176140#true} is VALID [2022-04-15 11:51:31,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176140#true} {176140#true} #725#return; {176140#true} is VALID [2022-04-15 11:51:31,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {176140#true} call ULTIMATE.init(); {176147#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:51:31,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {176147#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {176140#true} assume true; {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176140#true} {176140#true} #725#return; {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {176140#true} call #t~ret161 := main(); {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {176140#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; {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {176140#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {176140#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {176140#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); {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {176140#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; {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {176140#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; {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {176140#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {176140#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {176140#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {176140#true} is VALID [2022-04-15 11:51:31,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {176140#true} assume !false; {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {176140#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {176140#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {176140#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {176140#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {176140#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {176140#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {176140#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {176140#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {176140#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {176140#true} assume 8464 == #t~mem55;havoc #t~mem55; {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {176140#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; {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {176140#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {176140#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); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {176140#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); {176140#true} is VALID [2022-04-15 11:51:31,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {176140#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {176140#true} ~skip~0 := 0; {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {176140#true} assume !false; {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {176140#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 33: Hoare triple {176140#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {176140#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {176140#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 36: Hoare triple {176140#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {176140#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {176140#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 39: Hoare triple {176140#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {176140#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {176140#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {176140#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {176140#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {176140#true} assume 8496 == #t~mem58;havoc #t~mem58; {176140#true} is VALID [2022-04-15 11:51:31,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {176140#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {176140#true} is VALID [2022-04-15 11:51:31,443 INFO L290 TraceCheckUtils]: 46: Hoare triple {176140#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {176140#true} is VALID [2022-04-15 11:51:31,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {176140#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {176140#true} is VALID [2022-04-15 11:51:31,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {176140#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,444 INFO L290 TraceCheckUtils]: 49: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,446 INFO L290 TraceCheckUtils]: 55: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,447 INFO L290 TraceCheckUtils]: 56: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,447 INFO L290 TraceCheckUtils]: 57: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,447 INFO L290 TraceCheckUtils]: 58: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,448 INFO L290 TraceCheckUtils]: 59: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,448 INFO L290 TraceCheckUtils]: 60: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,448 INFO L290 TraceCheckUtils]: 61: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,450 INFO L290 TraceCheckUtils]: 65: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,450 INFO L290 TraceCheckUtils]: 66: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,451 INFO L290 TraceCheckUtils]: 67: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,451 INFO L290 TraceCheckUtils]: 68: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,451 INFO L290 TraceCheckUtils]: 69: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,452 INFO L290 TraceCheckUtils]: 70: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,452 INFO L290 TraceCheckUtils]: 71: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,452 INFO L290 TraceCheckUtils]: 72: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,453 INFO L290 TraceCheckUtils]: 74: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,453 INFO L290 TraceCheckUtils]: 75: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,456 INFO L290 TraceCheckUtils]: 81: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,456 INFO L290 TraceCheckUtils]: 82: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,456 INFO L290 TraceCheckUtils]: 83: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,457 INFO L290 TraceCheckUtils]: 85: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,457 INFO L290 TraceCheckUtils]: 86: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:31,458 INFO L290 TraceCheckUtils]: 87: Hoare triple {176145#(not (= 8673 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {176146#(not (= |ssl3_accept_#t~mem80| 8673))} is VALID [2022-04-15 11:51:31,458 INFO L290 TraceCheckUtils]: 88: Hoare triple {176146#(not (= |ssl3_accept_#t~mem80| 8673))} assume 8673 == #t~mem80;havoc #t~mem80; {176141#false} is VALID [2022-04-15 11:51:31,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {176141#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {176141#false} is VALID [2022-04-15 11:51:31,458 INFO L290 TraceCheckUtils]: 90: Hoare triple {176141#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {176141#false} is VALID [2022-04-15 11:51:31,458 INFO L290 TraceCheckUtils]: 91: Hoare triple {176141#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); {176141#false} is VALID [2022-04-15 11:51:31,458 INFO L290 TraceCheckUtils]: 92: Hoare triple {176141#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; {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 93: Hoare triple {176141#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 94: Hoare triple {176141#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); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 95: Hoare triple {176141#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 96: Hoare triple {176141#false} ~skip~0 := 0; {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 97: Hoare triple {176141#false} assume !false; {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 98: Hoare triple {176141#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); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 99: Hoare triple {176141#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 100: Hoare triple {176141#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 101: Hoare triple {176141#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 102: Hoare triple {176141#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 103: Hoare triple {176141#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 104: Hoare triple {176141#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,459 INFO L290 TraceCheckUtils]: 105: Hoare triple {176141#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 106: Hoare triple {176141#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 107: Hoare triple {176141#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 108: Hoare triple {176141#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 109: Hoare triple {176141#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 110: Hoare triple {176141#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 111: Hoare triple {176141#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 112: Hoare triple {176141#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 113: Hoare triple {176141#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 114: Hoare triple {176141#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 115: Hoare triple {176141#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 116: Hoare triple {176141#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 117: Hoare triple {176141#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 118: Hoare triple {176141#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,460 INFO L290 TraceCheckUtils]: 119: Hoare triple {176141#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 120: Hoare triple {176141#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 121: Hoare triple {176141#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 122: Hoare triple {176141#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 123: Hoare triple {176141#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 124: Hoare triple {176141#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 125: Hoare triple {176141#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 126: Hoare triple {176141#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 127: Hoare triple {176141#false} assume 8640 == #t~mem75;havoc #t~mem75; {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 128: Hoare triple {176141#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 129: Hoare triple {176141#false} assume !(9 == ~blastFlag~0); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 130: Hoare triple {176141#false} assume !(12 == ~blastFlag~0); {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 131: Hoare triple {176141#false} assume 15 == ~blastFlag~0; {176141#false} is VALID [2022-04-15 11:51:31,461 INFO L290 TraceCheckUtils]: 132: Hoare triple {176141#false} assume !false; {176141#false} is VALID [2022-04-15 11:51:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 11:51:31,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014782435] [2022-04-15 11:51:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014782435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:31,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:31,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:31,462 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:31,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1160518903] [2022-04-15 11:51:31,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1160518903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:31,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:31,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:31,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170213763] [2022-04-15 11:51:31,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:31,463 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-15 11:51:31,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:31,463 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-15 11:51:31,547 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-15 11:51:31,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:31,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:31,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:31,548 INFO L87 Difference]: Start difference. First operand 1288 states and 2058 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-15 11:51:39,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:41,616 INFO L93 Difference]: Finished difference Result 2799 states and 4418 transitions. [2022-04-15 11:51:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:41,616 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-15 11:51:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:41,617 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-15 11:51:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2022-04-15 11:51:41,619 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-15 11:51:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2022-04-15 11:51:41,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 626 transitions. [2022-04-15 11:51:42,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 626 edges. 626 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:42,119 INFO L225 Difference]: With dead ends: 2799 [2022-04-15 11:51:42,119 INFO L226 Difference]: Without dead ends: 1531 [2022-04-15 11:51:42,121 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:42,122 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 126 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:42,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 402 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:51:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-04-15 11:51:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1294. [2022-04-15 11:51:42,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:42,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1531 states. Second operand has 1294 states, 1289 states have (on average 1.6004654771140419) internal successors, (2063), 1289 states have internal predecessors, (2063), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,218 INFO L74 IsIncluded]: Start isIncluded. First operand 1531 states. Second operand has 1294 states, 1289 states have (on average 1.6004654771140419) internal successors, (2063), 1289 states have internal predecessors, (2063), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,219 INFO L87 Difference]: Start difference. First operand 1531 states. Second operand has 1294 states, 1289 states have (on average 1.6004654771140419) internal successors, (2063), 1289 states have internal predecessors, (2063), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:42,283 INFO L93 Difference]: Finished difference Result 1531 states and 2381 transitions. [2022-04-15 11:51:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2381 transitions. [2022-04-15 11:51:42,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:42,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:42,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 1294 states, 1289 states have (on average 1.6004654771140419) internal successors, (2063), 1289 states have internal predecessors, (2063), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1531 states. [2022-04-15 11:51:42,286 INFO L87 Difference]: Start difference. First operand has 1294 states, 1289 states have (on average 1.6004654771140419) internal successors, (2063), 1289 states have internal predecessors, (2063), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1531 states. [2022-04-15 11:51:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:42,349 INFO L93 Difference]: Finished difference Result 1531 states and 2381 transitions. [2022-04-15 11:51:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2381 transitions. [2022-04-15 11:51:42,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:42,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:42,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:42,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1289 states have (on average 1.6004654771140419) internal successors, (2063), 1289 states have internal predecessors, (2063), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2067 transitions. [2022-04-15 11:51:42,422 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2067 transitions. Word has length 133 [2022-04-15 11:51:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:42,422 INFO L478 AbstractCegarLoop]: Abstraction has 1294 states and 2067 transitions. [2022-04-15 11:51:42,423 INFO L479 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-15 11:51:42,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1294 states and 2067 transitions. [2022-04-15 11:51:45,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2067 edges. 2067 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2067 transitions. [2022-04-15 11:51:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:51:45,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:51:45,699 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:51:45,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 11:51:45,700 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:51:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:51:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash 533807610, now seen corresponding path program 1 times [2022-04-15 11:51:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:45,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232482871] [2022-04-15 11:51:45,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:51:45,771 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:51:45,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:51:45,772 INFO L85 PathProgramCache]: Analyzing trace with hash 533807610, now seen corresponding path program 2 times [2022-04-15 11:51:45,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:51:45,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387834285] [2022-04-15 11:51:45,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:51:45,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:51:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:51:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:51:45,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {187407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {187400#true} is VALID [2022-04-15 11:51:45,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {187400#true} assume true; {187400#true} is VALID [2022-04-15 11:51:45,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {187400#true} {187400#true} #725#return; {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {187400#true} call ULTIMATE.init(); {187407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {187407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {187400#true} assume true; {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {187400#true} {187400#true} #725#return; {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {187400#true} call #t~ret161 := main(); {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {187400#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; {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {187400#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L272 TraceCheckUtils]: 7: Hoare triple {187400#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {187400#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); {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {187400#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; {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {187400#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; {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {187400#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {187400#true} is VALID [2022-04-15 11:51:45,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {187400#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {187400#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {187400#true} assume !false; {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {187400#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {187400#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {187400#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {187400#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {187400#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {187400#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {187400#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {187400#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {187400#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {187400#true} assume 8464 == #t~mem55;havoc #t~mem55; {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {187400#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; {187400#true} is VALID [2022-04-15 11:51:45,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {187400#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {187400#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); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {187400#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); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {187400#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {187400#true} ~skip~0 := 0; {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {187400#true} assume !false; {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {187400#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {187400#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {187400#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {187400#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 36: Hoare triple {187400#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {187400#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {187400#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {187400#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {187400#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {187400#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {187400#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {187400#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {187400#true} assume 8496 == #t~mem58;havoc #t~mem58; {187400#true} is VALID [2022-04-15 11:51:45,903 INFO L290 TraceCheckUtils]: 45: Hoare triple {187400#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {187400#true} is VALID [2022-04-15 11:51:45,903 INFO L290 TraceCheckUtils]: 46: Hoare triple {187400#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {187400#true} is VALID [2022-04-15 11:51:45,903 INFO L290 TraceCheckUtils]: 47: Hoare triple {187400#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {187400#true} is VALID [2022-04-15 11:51:45,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {187400#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:45,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:45,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {187405#(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); {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:45,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {187405#(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; {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:45,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:45,906 INFO L290 TraceCheckUtils]: 53: Hoare triple {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {187405#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:51:45,906 INFO L290 TraceCheckUtils]: 54: Hoare triple {187405#(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); {187406#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-15 11:51:45,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {187406#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {187401#false} is VALID [2022-04-15 11:51:45,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {187401#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {187401#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 58: Hoare triple {187401#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {187401#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {187401#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 63: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 64: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 65: Hoare triple {187401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 66: Hoare triple {187401#false} ~skip~0 := 0; {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 67: Hoare triple {187401#false} assume !false; {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 68: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 69: Hoare triple {187401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 70: Hoare triple {187401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,907 INFO L290 TraceCheckUtils]: 71: Hoare triple {187401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 72: Hoare triple {187401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 73: Hoare triple {187401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 74: Hoare triple {187401#false} assume 8480 == #t~mem52;havoc #t~mem52; {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 75: Hoare triple {187401#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; {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 76: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 77: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 78: Hoare triple {187401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 79: Hoare triple {187401#false} ~skip~0 := 0; {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 80: Hoare triple {187401#false} assume !false; {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 81: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 82: Hoare triple {187401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 83: Hoare triple {187401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 84: Hoare triple {187401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 85: Hoare triple {187401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,908 INFO L290 TraceCheckUtils]: 86: Hoare triple {187401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 87: Hoare triple {187401#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 88: Hoare triple {187401#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 89: Hoare triple {187401#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 90: Hoare triple {187401#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 91: Hoare triple {187401#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 92: Hoare triple {187401#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 93: Hoare triple {187401#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 94: Hoare triple {187401#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 95: Hoare triple {187401#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 96: Hoare triple {187401#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 97: Hoare triple {187401#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 98: Hoare triple {187401#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 99: Hoare triple {187401#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,909 INFO L290 TraceCheckUtils]: 100: Hoare triple {187401#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 101: Hoare triple {187401#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 102: Hoare triple {187401#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 103: Hoare triple {187401#false} assume 8448 == #t~mem68;havoc #t~mem68; {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 104: Hoare triple {187401#false} assume !(~num1~0 > 0); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 105: Hoare triple {187401#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; {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 106: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 107: Hoare triple {187401#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 108: Hoare triple {187401#false} ~skip~0 := 0; {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 109: Hoare triple {187401#false} assume !false; {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 110: Hoare triple {187401#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); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 111: Hoare triple {187401#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 112: Hoare triple {187401#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 113: Hoare triple {187401#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 114: Hoare triple {187401#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,910 INFO L290 TraceCheckUtils]: 115: Hoare triple {187401#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 116: Hoare triple {187401#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 117: Hoare triple {187401#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 118: Hoare triple {187401#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 119: Hoare triple {187401#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 120: Hoare triple {187401#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 121: Hoare triple {187401#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 122: Hoare triple {187401#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 123: Hoare triple {187401#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 124: Hoare triple {187401#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 125: Hoare triple {187401#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 126: Hoare triple {187401#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 127: Hoare triple {187401#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 128: Hoare triple {187401#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,911 INFO L290 TraceCheckUtils]: 129: Hoare triple {187401#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 130: Hoare triple {187401#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 131: Hoare triple {187401#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 132: Hoare triple {187401#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 133: Hoare triple {187401#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 134: Hoare triple {187401#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 135: Hoare triple {187401#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 136: Hoare triple {187401#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 137: Hoare triple {187401#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 138: Hoare triple {187401#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 139: Hoare triple {187401#false} assume 8640 == #t~mem75;havoc #t~mem75; {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 140: Hoare triple {187401#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 141: Hoare triple {187401#false} assume !(9 == ~blastFlag~0); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 142: Hoare triple {187401#false} assume !(12 == ~blastFlag~0); {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 143: Hoare triple {187401#false} assume 15 == ~blastFlag~0; {187401#false} is VALID [2022-04-15 11:51:45,912 INFO L290 TraceCheckUtils]: 144: Hoare triple {187401#false} assume !false; {187401#false} is VALID [2022-04-15 11:51:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:51:45,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:51:45,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387834285] [2022-04-15 11:51:45,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387834285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:45,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:45,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:45,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:51:45,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232482871] [2022-04-15 11:51:45,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232482871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:51:45,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:51:45,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:51:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285175162] [2022-04-15 11:51:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:51:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:51:45,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:51:45,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:45,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:45,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:51:45,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:51:45,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:51:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:51:45,976 INFO L87 Difference]: Start difference. First operand 1294 states and 2067 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:50,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:51:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:55,932 INFO L93 Difference]: Finished difference Result 2391 states and 3764 transitions. [2022-04-15 11:51:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:51:55,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 145 [2022-04-15 11:51:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:51:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2022-04-15 11:51:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2022-04-15 11:51:55,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 623 transitions. [2022-04-15 11:51:56,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:51:56,412 INFO L225 Difference]: With dead ends: 2391 [2022-04-15 11:51:56,412 INFO L226 Difference]: Without dead ends: 1511 [2022-04-15 11:51:56,413 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:51:56,413 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 156 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:51:56,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 406 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:51:56,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-04-15 11:51:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1294. [2022-04-15 11:51:56,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:51:56,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1511 states. Second operand has 1294 states, 1289 states have (on average 1.582622187742436) internal successors, (2040), 1289 states have internal predecessors, (2040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:56,502 INFO L74 IsIncluded]: Start isIncluded. First operand 1511 states. Second operand has 1294 states, 1289 states have (on average 1.582622187742436) internal successors, (2040), 1289 states have internal predecessors, (2040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:56,511 INFO L87 Difference]: Start difference. First operand 1511 states. Second operand has 1294 states, 1289 states have (on average 1.582622187742436) internal successors, (2040), 1289 states have internal predecessors, (2040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:56,572 INFO L93 Difference]: Finished difference Result 1511 states and 2334 transitions. [2022-04-15 11:51:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2334 transitions. [2022-04-15 11:51:56,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:56,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:56,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 1294 states, 1289 states have (on average 1.582622187742436) internal successors, (2040), 1289 states have internal predecessors, (2040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1511 states. [2022-04-15 11:51:56,574 INFO L87 Difference]: Start difference. First operand has 1294 states, 1289 states have (on average 1.582622187742436) internal successors, (2040), 1289 states have internal predecessors, (2040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1511 states. [2022-04-15 11:51:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:51:56,635 INFO L93 Difference]: Finished difference Result 1511 states and 2334 transitions. [2022-04-15 11:51:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2334 transitions. [2022-04-15 11:51:56,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:51:56,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:51:56,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:51:56,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:51:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1289 states have (on average 1.582622187742436) internal successors, (2040), 1289 states have internal predecessors, (2040), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2044 transitions. [2022-04-15 11:51:56,709 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2044 transitions. Word has length 145 [2022-04-15 11:51:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:51:56,709 INFO L478 AbstractCegarLoop]: Abstraction has 1294 states and 2044 transitions. [2022-04-15 11:51:56,709 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:51:56,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1294 states and 2044 transitions. [2022-04-15 11:52:00,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2044 edges. 2044 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2044 transitions. [2022-04-15 11:52:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:52:00,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:00,455 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:52:00,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 11:52:00,455 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:00,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:00,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1306093761, now seen corresponding path program 1 times [2022-04-15 11:52:00,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:00,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127416759] [2022-04-15 11:52:00,544 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:00,545 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:00,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1306093761, now seen corresponding path program 2 times [2022-04-15 11:52:00,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:00,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549511336] [2022-04-15 11:52:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:00,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:00,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {197811#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {197804#true} is VALID [2022-04-15 11:52:00,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {197804#true} assume true; {197804#true} is VALID [2022-04-15 11:52:00,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197804#true} {197804#true} #725#return; {197804#true} is VALID [2022-04-15 11:52:00,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {197804#true} call ULTIMATE.init(); {197811#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:52:00,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {197811#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {197804#true} is VALID [2022-04-15 11:52:00,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {197804#true} assume true; {197804#true} is VALID [2022-04-15 11:52:00,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197804#true} {197804#true} #725#return; {197804#true} is VALID [2022-04-15 11:52:00,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {197804#true} call #t~ret161 := main(); {197804#true} is VALID [2022-04-15 11:52:00,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {197804#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; {197804#true} is VALID [2022-04-15 11:52:00,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {197804#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,671 INFO L272 TraceCheckUtils]: 7: Hoare triple {197804#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {197804#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); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {197804#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; {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {197804#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; {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {197804#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {197804#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {197804#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {197804#true} assume !false; {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {197804#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {197804#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {197804#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {197804#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {197804#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {197804#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {197804#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {197804#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {197804#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {197804#true} assume 8464 == #t~mem55;havoc #t~mem55; {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {197804#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; {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {197804#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {197804#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); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {197804#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); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {197804#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {197804#true} ~skip~0 := 0; {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {197804#true} assume !false; {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {197804#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {197804#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {197804#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {197804#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {197804#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {197804#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {197804#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {197804#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 40: Hoare triple {197804#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 41: Hoare triple {197804#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {197804#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 43: Hoare triple {197804#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {197804#true} assume 8496 == #t~mem58;havoc #t~mem58; {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {197804#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {197804#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {197804#true} is VALID [2022-04-15 11:52:00,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {197804#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {197804#true} is VALID [2022-04-15 11:52:00,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {197804#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,676 INFO L290 TraceCheckUtils]: 49: Hoare triple {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,676 INFO L290 TraceCheckUtils]: 50: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,677 INFO L290 TraceCheckUtils]: 51: Hoare triple {197809#(= 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; {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,677 INFO L290 TraceCheckUtils]: 52: Hoare triple {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,677 INFO L290 TraceCheckUtils]: 53: Hoare triple {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,678 INFO L290 TraceCheckUtils]: 54: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,679 INFO L290 TraceCheckUtils]: 57: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,679 INFO L290 TraceCheckUtils]: 58: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,680 INFO L290 TraceCheckUtils]: 59: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,681 INFO L290 TraceCheckUtils]: 62: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,681 INFO L290 TraceCheckUtils]: 63: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,682 INFO L290 TraceCheckUtils]: 64: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,682 INFO L290 TraceCheckUtils]: 65: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,682 INFO L290 TraceCheckUtils]: 66: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,683 INFO L290 TraceCheckUtils]: 67: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {197809#(= 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); {197809#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:52:00,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {197809#(= 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); {197810#(= |ssl3_accept_#t~mem66| 8656)} is VALID [2022-04-15 11:52:00,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {197810#(= |ssl3_accept_#t~mem66| 8656)} assume 8560 == #t~mem66;havoc #t~mem66; {197805#false} is VALID [2022-04-15 11:52:00,685 INFO L290 TraceCheckUtils]: 75: Hoare triple {197805#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {197805#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); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 77: Hoare triple {197805#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); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 78: Hoare triple {197805#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 79: Hoare triple {197805#false} ~skip~0 := 0; {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {197805#false} assume !false; {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 81: Hoare triple {197805#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); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 82: Hoare triple {197805#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 83: Hoare triple {197805#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 84: Hoare triple {197805#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 85: Hoare triple {197805#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 86: Hoare triple {197805#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 87: Hoare triple {197805#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 88: Hoare triple {197805#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,686 INFO L290 TraceCheckUtils]: 89: Hoare triple {197805#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 90: Hoare triple {197805#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 91: Hoare triple {197805#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 92: Hoare triple {197805#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 93: Hoare triple {197805#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 94: Hoare triple {197805#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 95: Hoare triple {197805#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 96: Hoare triple {197805#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 97: Hoare triple {197805#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 98: Hoare triple {197805#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 99: Hoare triple {197805#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 100: Hoare triple {197805#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 101: Hoare triple {197805#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 102: Hoare triple {197805#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,687 INFO L290 TraceCheckUtils]: 103: Hoare triple {197805#false} assume 8448 == #t~mem68;havoc #t~mem68; {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 104: Hoare triple {197805#false} assume !(~num1~0 > 0); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 105: Hoare triple {197805#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; {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 106: Hoare triple {197805#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); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 107: Hoare triple {197805#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 108: Hoare triple {197805#false} ~skip~0 := 0; {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 109: Hoare triple {197805#false} assume !false; {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 110: Hoare triple {197805#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); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 111: Hoare triple {197805#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 112: Hoare triple {197805#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 113: Hoare triple {197805#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 114: Hoare triple {197805#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 115: Hoare triple {197805#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 116: Hoare triple {197805#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,688 INFO L290 TraceCheckUtils]: 117: Hoare triple {197805#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 118: Hoare triple {197805#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 119: Hoare triple {197805#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 120: Hoare triple {197805#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 121: Hoare triple {197805#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 122: Hoare triple {197805#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 123: Hoare triple {197805#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 124: Hoare triple {197805#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 125: Hoare triple {197805#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 126: Hoare triple {197805#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 127: Hoare triple {197805#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 128: Hoare triple {197805#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 129: Hoare triple {197805#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,689 INFO L290 TraceCheckUtils]: 130: Hoare triple {197805#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 131: Hoare triple {197805#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 132: Hoare triple {197805#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 133: Hoare triple {197805#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 134: Hoare triple {197805#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 135: Hoare triple {197805#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 136: Hoare triple {197805#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 137: Hoare triple {197805#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 138: Hoare triple {197805#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 139: Hoare triple {197805#false} assume 8640 == #t~mem75;havoc #t~mem75; {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 140: Hoare triple {197805#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 141: Hoare triple {197805#false} assume !(9 == ~blastFlag~0); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 142: Hoare triple {197805#false} assume !(12 == ~blastFlag~0); {197805#false} is VALID [2022-04-15 11:52:00,690 INFO L290 TraceCheckUtils]: 143: Hoare triple {197805#false} assume 15 == ~blastFlag~0; {197805#false} is VALID [2022-04-15 11:52:00,691 INFO L290 TraceCheckUtils]: 144: Hoare triple {197805#false} assume !false; {197805#false} is VALID [2022-04-15 11:52:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:52:00,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:00,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549511336] [2022-04-15 11:52:00,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549511336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:00,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:00,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:00,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:00,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127416759] [2022-04-15 11:52:00,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127416759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:00,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:00,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:00,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218819864] [2022-04-15 11:52:00,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:00,692 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 145 [2022-04-15 11:52:00,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:00,692 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-15 11:52:00,762 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-15 11:52:00,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:00,763 INFO L87 Difference]: Start difference. First operand 1294 states and 2044 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-15 11:52:07,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:13,282 INFO L93 Difference]: Finished difference Result 2683 states and 4215 transitions. [2022-04-15 11:52:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:13,283 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 145 [2022-04-15 11:52:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:13,283 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-15 11:52:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-15 11:52:13,285 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-15 11:52:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-15 11:52:13,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-15 11:52:13,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 566 edges. 566 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:13,723 INFO L225 Difference]: With dead ends: 2683 [2022-04-15 11:52:13,724 INFO L226 Difference]: Without dead ends: 1415 [2022-04-15 11:52:13,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:13,726 INFO L913 BasicCegarLoop]: 279 mSDtfsCounter, 80 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:13,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 683 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 11:52:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-04-15 11:52:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1294. [2022-04-15 11:52:13,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:13,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1415 states. Second operand has 1294 states, 1289 states have (on average 1.5802948021722265) internal successors, (2037), 1289 states have internal predecessors, (2037), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:13,836 INFO L74 IsIncluded]: Start isIncluded. First operand 1415 states. Second operand has 1294 states, 1289 states have (on average 1.5802948021722265) internal successors, (2037), 1289 states have internal predecessors, (2037), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:13,836 INFO L87 Difference]: Start difference. First operand 1415 states. Second operand has 1294 states, 1289 states have (on average 1.5802948021722265) internal successors, (2037), 1289 states have internal predecessors, (2037), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:13,896 INFO L93 Difference]: Finished difference Result 1415 states and 2201 transitions. [2022-04-15 11:52:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2201 transitions. [2022-04-15 11:52:13,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:13,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:13,898 INFO L74 IsIncluded]: Start isIncluded. First operand has 1294 states, 1289 states have (on average 1.5802948021722265) internal successors, (2037), 1289 states have internal predecessors, (2037), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1415 states. [2022-04-15 11:52:13,899 INFO L87 Difference]: Start difference. First operand has 1294 states, 1289 states have (on average 1.5802948021722265) internal successors, (2037), 1289 states have internal predecessors, (2037), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1415 states. [2022-04-15 11:52:13,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:13,953 INFO L93 Difference]: Finished difference Result 1415 states and 2201 transitions. [2022-04-15 11:52:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2201 transitions. [2022-04-15 11:52:13,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:13,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:13,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:13,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1289 states have (on average 1.5802948021722265) internal successors, (2037), 1289 states have internal predecessors, (2037), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 2041 transitions. [2022-04-15 11:52:14,037 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 2041 transitions. Word has length 145 [2022-04-15 11:52:14,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:14,038 INFO L478 AbstractCegarLoop]: Abstraction has 1294 states and 2041 transitions. [2022-04-15 11:52:14,038 INFO L479 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-15 11:52:14,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1294 states and 2041 transitions. [2022-04-15 11:52:17,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2041 edges. 2041 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 2041 transitions. [2022-04-15 11:52:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 11:52:17,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:17,296 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:52:17,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 11:52:17,296 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 294977345, now seen corresponding path program 1 times [2022-04-15 11:52:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:17,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944206326] [2022-04-15 11:52:17,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:17,367 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:17,367 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash 294977345, now seen corresponding path program 2 times [2022-04-15 11:52:17,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:17,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353521091] [2022-04-15 11:52:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:17,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:17,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:17,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {208607#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {208600#true} is VALID [2022-04-15 11:52:17,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {208600#true} assume true; {208600#true} is VALID [2022-04-15 11:52:17,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208600#true} {208600#true} #725#return; {208600#true} is VALID [2022-04-15 11:52:17,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {208600#true} call ULTIMATE.init(); {208607#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:52:17,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {208607#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {208600#true} is VALID [2022-04-15 11:52:17,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {208600#true} assume true; {208600#true} is VALID [2022-04-15 11:52:17,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208600#true} {208600#true} #725#return; {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {208600#true} call #t~ret161 := main(); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {208600#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; {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {208600#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L272 TraceCheckUtils]: 7: Hoare triple {208600#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {208600#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); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {208600#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; {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {208600#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; {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {208600#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {208600#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {208600#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {208600#true} assume !false; {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {208600#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {208600#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {208600#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {208600#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {208600#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {208600#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {208600#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {208600#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {208600#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {208600#true} assume 8464 == #t~mem55;havoc #t~mem55; {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {208600#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; {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {208600#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {208600#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); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {208600#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); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {208600#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {208600#true} ~skip~0 := 0; {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {208600#true} assume !false; {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {208600#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {208600#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {208600#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {208600#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {208600#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {208600#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {208600#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {208600#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {208600#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {208600#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {208600#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {208600#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {208600#true} assume 8496 == #t~mem58;havoc #t~mem58; {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {208600#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {208600#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {208600#true} is VALID [2022-04-15 11:52:17,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {208600#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {208600#true} is VALID [2022-04-15 11:52:17,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {208600#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,513 INFO L290 TraceCheckUtils]: 49: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,514 INFO L290 TraceCheckUtils]: 52: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,515 INFO L290 TraceCheckUtils]: 55: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,517 INFO L290 TraceCheckUtils]: 62: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,517 INFO L290 TraceCheckUtils]: 63: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,518 INFO L290 TraceCheckUtils]: 64: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,518 INFO L290 TraceCheckUtils]: 65: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,519 INFO L290 TraceCheckUtils]: 69: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,520 INFO L290 TraceCheckUtils]: 70: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,520 INFO L290 TraceCheckUtils]: 71: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 73: Hoare triple {208605#(not (= 8560 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208606#(not (= 8560 |ssl3_accept_#t~mem66|))} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 74: Hoare triple {208606#(not (= 8560 |ssl3_accept_#t~mem66|))} assume 8560 == #t~mem66;havoc #t~mem66; {208601#false} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 75: Hoare triple {208601#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {208601#false} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 76: Hoare triple {208601#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); {208601#false} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 77: Hoare triple {208601#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); {208601#false} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 78: Hoare triple {208601#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208601#false} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 79: Hoare triple {208601#false} ~skip~0 := 0; {208601#false} is VALID [2022-04-15 11:52:17,521 INFO L290 TraceCheckUtils]: 80: Hoare triple {208601#false} assume !false; {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 81: Hoare triple {208601#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); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 82: Hoare triple {208601#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 83: Hoare triple {208601#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 84: Hoare triple {208601#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 85: Hoare triple {208601#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 86: Hoare triple {208601#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 87: Hoare triple {208601#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 88: Hoare triple {208601#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 89: Hoare triple {208601#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 90: Hoare triple {208601#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 91: Hoare triple {208601#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 92: Hoare triple {208601#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 93: Hoare triple {208601#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,522 INFO L290 TraceCheckUtils]: 94: Hoare triple {208601#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 95: Hoare triple {208601#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 96: Hoare triple {208601#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 97: Hoare triple {208601#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 98: Hoare triple {208601#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 99: Hoare triple {208601#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {208601#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 101: Hoare triple {208601#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 102: Hoare triple {208601#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 103: Hoare triple {208601#false} assume 8448 == #t~mem68;havoc #t~mem68; {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {208601#false} assume !(~num1~0 > 0); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 105: Hoare triple {208601#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; {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 106: Hoare triple {208601#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); {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 107: Hoare triple {208601#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 108: Hoare triple {208601#false} ~skip~0 := 0; {208601#false} is VALID [2022-04-15 11:52:17,523 INFO L290 TraceCheckUtils]: 109: Hoare triple {208601#false} assume !false; {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 110: Hoare triple {208601#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); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 111: Hoare triple {208601#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 112: Hoare triple {208601#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 113: Hoare triple {208601#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 114: Hoare triple {208601#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 115: Hoare triple {208601#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 116: Hoare triple {208601#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 117: Hoare triple {208601#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 118: Hoare triple {208601#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 119: Hoare triple {208601#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 120: Hoare triple {208601#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 121: Hoare triple {208601#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 122: Hoare triple {208601#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,524 INFO L290 TraceCheckUtils]: 123: Hoare triple {208601#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 124: Hoare triple {208601#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 125: Hoare triple {208601#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 126: Hoare triple {208601#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 127: Hoare triple {208601#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 128: Hoare triple {208601#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 129: Hoare triple {208601#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 130: Hoare triple {208601#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 131: Hoare triple {208601#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 132: Hoare triple {208601#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 133: Hoare triple {208601#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 134: Hoare triple {208601#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 135: Hoare triple {208601#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 136: Hoare triple {208601#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,525 INFO L290 TraceCheckUtils]: 137: Hoare triple {208601#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L290 TraceCheckUtils]: 138: Hoare triple {208601#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L290 TraceCheckUtils]: 139: Hoare triple {208601#false} assume 8640 == #t~mem75;havoc #t~mem75; {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L290 TraceCheckUtils]: 140: Hoare triple {208601#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L290 TraceCheckUtils]: 141: Hoare triple {208601#false} assume !(9 == ~blastFlag~0); {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L290 TraceCheckUtils]: 142: Hoare triple {208601#false} assume !(12 == ~blastFlag~0); {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L290 TraceCheckUtils]: 143: Hoare triple {208601#false} assume 15 == ~blastFlag~0; {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L290 TraceCheckUtils]: 144: Hoare triple {208601#false} assume !false; {208601#false} is VALID [2022-04-15 11:52:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:52:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:17,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353521091] [2022-04-15 11:52:17,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353521091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:17,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:17,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:17,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:17,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944206326] [2022-04-15 11:52:17,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944206326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:17,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:17,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660614894] [2022-04-15 11:52:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:17,527 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 145 [2022-04-15 11:52:17,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:17,528 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-15 11:52:17,595 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-15 11:52:17,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:17,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:17,595 INFO L87 Difference]: Start difference. First operand 1294 states and 2041 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-15 11:52:20,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:24,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:28,561 INFO L93 Difference]: Finished difference Result 2905 states and 4543 transitions. [2022-04-15 11:52:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:28,562 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 145 [2022-04-15 11:52:28,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:28,562 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-15 11:52:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-15 11:52:28,565 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-15 11:52:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-15 11:52:28,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 622 transitions. [2022-04-15 11:52:28,982 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-15 11:52:29,108 INFO L225 Difference]: With dead ends: 2905 [2022-04-15 11:52:29,108 INFO L226 Difference]: Without dead ends: 1637 [2022-04-15 11:52:29,109 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:29,110 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 136 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:29,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 406 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 11:52:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2022-04-15 11:52:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1384. [2022-04-15 11:52:29,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:29,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1637 states. Second operand has 1384 states, 1379 states have (on average 1.5728788977519943) internal successors, (2169), 1379 states have internal predecessors, (2169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:29,222 INFO L74 IsIncluded]: Start isIncluded. First operand 1637 states. Second operand has 1384 states, 1379 states have (on average 1.5728788977519943) internal successors, (2169), 1379 states have internal predecessors, (2169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:29,223 INFO L87 Difference]: Start difference. First operand 1637 states. Second operand has 1384 states, 1379 states have (on average 1.5728788977519943) internal successors, (2169), 1379 states have internal predecessors, (2169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:29,307 INFO L93 Difference]: Finished difference Result 1637 states and 2517 transitions. [2022-04-15 11:52:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2517 transitions. [2022-04-15 11:52:29,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:29,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:29,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1379 states have (on average 1.5728788977519943) internal successors, (2169), 1379 states have internal predecessors, (2169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1637 states. [2022-04-15 11:52:29,310 INFO L87 Difference]: Start difference. First operand has 1384 states, 1379 states have (on average 1.5728788977519943) internal successors, (2169), 1379 states have internal predecessors, (2169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1637 states. [2022-04-15 11:52:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:29,388 INFO L93 Difference]: Finished difference Result 1637 states and 2517 transitions. [2022-04-15 11:52:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2517 transitions. [2022-04-15 11:52:29,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:29,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:29,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:29,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1379 states have (on average 1.5728788977519943) internal successors, (2169), 1379 states have internal predecessors, (2169), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2173 transitions. [2022-04-15 11:52:29,478 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2173 transitions. Word has length 145 [2022-04-15 11:52:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:29,478 INFO L478 AbstractCegarLoop]: Abstraction has 1384 states and 2173 transitions. [2022-04-15 11:52:29,478 INFO L479 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-15 11:52:29,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1384 states and 2173 transitions. [2022-04-15 11:52:32,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2173 edges. 2173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2173 transitions. [2022-04-15 11:52:32,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-04-15 11:52:32,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:32,973 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:52:32,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 11:52:32,973 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:32,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:32,973 INFO L85 PathProgramCache]: Analyzing trace with hash 174189256, now seen corresponding path program 1 times [2022-04-15 11:52:32,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:32,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893518005] [2022-04-15 11:52:33,047 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:33,047 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:33,047 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:33,047 INFO L85 PathProgramCache]: Analyzing trace with hash 174189256, now seen corresponding path program 2 times [2022-04-15 11:52:33,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:33,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799598840] [2022-04-15 11:52:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:33,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:33,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:33,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {220471#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {220464#true} is VALID [2022-04-15 11:52:33,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {220464#true} assume true; {220464#true} is VALID [2022-04-15 11:52:33,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220464#true} {220464#true} #725#return; {220464#true} is VALID [2022-04-15 11:52:33,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {220464#true} call ULTIMATE.init(); {220471#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:52:33,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {220471#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {220464#true} is VALID [2022-04-15 11:52:33,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {220464#true} assume true; {220464#true} is VALID [2022-04-15 11:52:33,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220464#true} {220464#true} #725#return; {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {220464#true} call #t~ret161 := main(); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {220464#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; {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {220464#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L272 TraceCheckUtils]: 7: Hoare triple {220464#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {220464#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); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {220464#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; {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {220464#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; {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {220464#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {220464#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {220464#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {220464#true} assume !false; {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {220464#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {220464#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {220464#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {220464#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {220464#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {220464#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {220464#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {220464#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {220464#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {220464#true} assume 8464 == #t~mem55;havoc #t~mem55; {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {220464#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; {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {220464#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {220464#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); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {220464#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); {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {220464#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {220464#true} ~skip~0 := 0; {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {220464#true} assume !false; {220464#true} is VALID [2022-04-15 11:52:33,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {220464#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 33: Hoare triple {220464#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 34: Hoare triple {220464#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {220464#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {220464#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {220464#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {220464#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {220464#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 40: Hoare triple {220464#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {220464#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {220464#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {220464#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {220464#true} assume 8496 == #t~mem58;havoc #t~mem58; {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {220464#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {220464#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220464#true} is VALID [2022-04-15 11:52:33,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {220464#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {220464#true} is VALID [2022-04-15 11:52:33,183 INFO L290 TraceCheckUtils]: 48: Hoare triple {220464#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {220469#(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; {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,189 INFO L290 TraceCheckUtils]: 62: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,189 INFO L290 TraceCheckUtils]: 64: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,190 INFO L290 TraceCheckUtils]: 65: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,190 INFO L290 TraceCheckUtils]: 66: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,190 INFO L290 TraceCheckUtils]: 67: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,191 INFO L290 TraceCheckUtils]: 68: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,191 INFO L290 TraceCheckUtils]: 69: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,191 INFO L290 TraceCheckUtils]: 70: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,192 INFO L290 TraceCheckUtils]: 71: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,192 INFO L290 TraceCheckUtils]: 72: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,192 INFO L290 TraceCheckUtils]: 73: Hoare triple {220469#(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); {220469#(not (= 8561 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 74: Hoare triple {220469#(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); {220470#(not (= |ssl3_accept_#t~mem67| 8561))} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 75: Hoare triple {220470#(not (= |ssl3_accept_#t~mem67| 8561))} assume 8561 == #t~mem67;havoc #t~mem67; {220465#false} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {220465#false} assume -2147483648 <= #t~nondet130 && #t~nondet130 <= 2147483647;~ret~0 := #t~nondet130;havoc #t~nondet130; {220465#false} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {220465#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); {220465#false} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {220465#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); {220465#false} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 79: Hoare triple {220465#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220465#false} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 80: Hoare triple {220465#false} ~skip~0 := 0; {220465#false} is VALID [2022-04-15 11:52:33,193 INFO L290 TraceCheckUtils]: 81: Hoare triple {220465#false} assume !false; {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 82: Hoare triple {220465#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); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 83: Hoare triple {220465#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 84: Hoare triple {220465#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 85: Hoare triple {220465#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 86: Hoare triple {220465#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 87: Hoare triple {220465#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 88: Hoare triple {220465#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 89: Hoare triple {220465#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 90: Hoare triple {220465#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 91: Hoare triple {220465#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 92: Hoare triple {220465#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 93: Hoare triple {220465#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 94: Hoare triple {220465#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,194 INFO L290 TraceCheckUtils]: 95: Hoare triple {220465#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 96: Hoare triple {220465#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 97: Hoare triple {220465#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 98: Hoare triple {220465#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 99: Hoare triple {220465#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 100: Hoare triple {220465#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 101: Hoare triple {220465#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 102: Hoare triple {220465#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 103: Hoare triple {220465#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 104: Hoare triple {220465#false} assume 8448 == #t~mem68;havoc #t~mem68; {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 105: Hoare triple {220465#false} assume !(~num1~0 > 0); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 106: Hoare triple {220465#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; {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 107: Hoare triple {220465#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); {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 108: Hoare triple {220465#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 109: Hoare triple {220465#false} ~skip~0 := 0; {220465#false} is VALID [2022-04-15 11:52:33,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {220465#false} assume !false; {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 111: Hoare triple {220465#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); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 112: Hoare triple {220465#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 113: Hoare triple {220465#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 114: Hoare triple {220465#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 115: Hoare triple {220465#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 116: Hoare triple {220465#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 117: Hoare triple {220465#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 118: Hoare triple {220465#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 119: Hoare triple {220465#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 120: Hoare triple {220465#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 121: Hoare triple {220465#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 122: Hoare triple {220465#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 123: Hoare triple {220465#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 124: Hoare triple {220465#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,196 INFO L290 TraceCheckUtils]: 125: Hoare triple {220465#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 126: Hoare triple {220465#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 127: Hoare triple {220465#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 128: Hoare triple {220465#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 129: Hoare triple {220465#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 130: Hoare triple {220465#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 131: Hoare triple {220465#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 132: Hoare triple {220465#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 133: Hoare triple {220465#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 134: Hoare triple {220465#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 135: Hoare triple {220465#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 136: Hoare triple {220465#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 137: Hoare triple {220465#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 138: Hoare triple {220465#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 139: Hoare triple {220465#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {220465#false} is VALID [2022-04-15 11:52:33,197 INFO L290 TraceCheckUtils]: 140: Hoare triple {220465#false} assume 8640 == #t~mem75;havoc #t~mem75; {220465#false} is VALID [2022-04-15 11:52:33,198 INFO L290 TraceCheckUtils]: 141: Hoare triple {220465#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {220465#false} is VALID [2022-04-15 11:52:33,198 INFO L290 TraceCheckUtils]: 142: Hoare triple {220465#false} assume !(9 == ~blastFlag~0); {220465#false} is VALID [2022-04-15 11:52:33,198 INFO L290 TraceCheckUtils]: 143: Hoare triple {220465#false} assume !(12 == ~blastFlag~0); {220465#false} is VALID [2022-04-15 11:52:33,198 INFO L290 TraceCheckUtils]: 144: Hoare triple {220465#false} assume 15 == ~blastFlag~0; {220465#false} is VALID [2022-04-15 11:52:33,198 INFO L290 TraceCheckUtils]: 145: Hoare triple {220465#false} assume !false; {220465#false} is VALID [2022-04-15 11:52:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:52:33,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:33,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799598840] [2022-04-15 11:52:33,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799598840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:33,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:33,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:33,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:33,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893518005] [2022-04-15 11:52:33,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893518005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:33,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:33,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274156776] [2022-04-15 11:52:33,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:33,200 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-15 11:52:33,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:33,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:33,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:33,290 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:33,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:33,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:33,290 INFO L87 Difference]: Start difference. First operand 1384 states and 2173 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:37,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:39,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:42,681 INFO L93 Difference]: Finished difference Result 2959 states and 4603 transitions. [2022-04-15 11:52:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:42,681 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-15 11:52:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-15 11:52:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 622 transitions. [2022-04-15 11:52:42,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 622 transitions. [2022-04-15 11:52:43,069 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-15 11:52:43,190 INFO L225 Difference]: With dead ends: 2959 [2022-04-15 11:52:43,191 INFO L226 Difference]: Without dead ends: 1601 [2022-04-15 11:52:43,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:43,192 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 135 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:43,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 406 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 496 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:52:43,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-04-15 11:52:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1384. [2022-04-15 11:52:43,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:43,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1601 states. Second operand has 1384 states, 1379 states have (on average 1.557650471356055) internal successors, (2148), 1379 states have internal predecessors, (2148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:43,331 INFO L74 IsIncluded]: Start isIncluded. First operand 1601 states. Second operand has 1384 states, 1379 states have (on average 1.557650471356055) internal successors, (2148), 1379 states have internal predecessors, (2148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:43,331 INFO L87 Difference]: Start difference. First operand 1601 states. Second operand has 1384 states, 1379 states have (on average 1.557650471356055) internal successors, (2148), 1379 states have internal predecessors, (2148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:43,413 INFO L93 Difference]: Finished difference Result 1601 states and 2442 transitions. [2022-04-15 11:52:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2442 transitions. [2022-04-15 11:52:43,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:43,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:43,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1379 states have (on average 1.557650471356055) internal successors, (2148), 1379 states have internal predecessors, (2148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1601 states. [2022-04-15 11:52:43,415 INFO L87 Difference]: Start difference. First operand has 1384 states, 1379 states have (on average 1.557650471356055) internal successors, (2148), 1379 states have internal predecessors, (2148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1601 states. [2022-04-15 11:52:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:43,496 INFO L93 Difference]: Finished difference Result 1601 states and 2442 transitions. [2022-04-15 11:52:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2442 transitions. [2022-04-15 11:52:43,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:43,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:43,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:43,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1379 states have (on average 1.557650471356055) internal successors, (2148), 1379 states have internal predecessors, (2148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2152 transitions. [2022-04-15 11:52:43,599 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2152 transitions. Word has length 146 [2022-04-15 11:52:43,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:43,599 INFO L478 AbstractCegarLoop]: Abstraction has 1384 states and 2152 transitions. [2022-04-15 11:52:43,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:43,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1384 states and 2152 transitions. [2022-04-15 11:52:47,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2152 edges. 2152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2152 transitions. [2022-04-15 11:52:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 11:52:47,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:52:47,076 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:52:47,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 11:52:47,076 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:52:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:52:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash -259671117, now seen corresponding path program 1 times [2022-04-15 11:52:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:47,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [323731893] [2022-04-15 11:52:47,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:52:47,146 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:52:47,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:52:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash -259671117, now seen corresponding path program 2 times [2022-04-15 11:52:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:52:47,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676662143] [2022-04-15 11:52:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:52:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:52:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:52:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:52:47,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {232371#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {232364#true} is VALID [2022-04-15 11:52:47,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {232364#true} assume true; {232364#true} is VALID [2022-04-15 11:52:47,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232364#true} {232364#true} #725#return; {232364#true} is VALID [2022-04-15 11:52:47,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {232364#true} call ULTIMATE.init(); {232371#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:52:47,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {232371#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {232364#true} is VALID [2022-04-15 11:52:47,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {232364#true} assume true; {232364#true} is VALID [2022-04-15 11:52:47,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232364#true} {232364#true} #725#return; {232364#true} is VALID [2022-04-15 11:52:47,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {232364#true} call #t~ret161 := main(); {232364#true} is VALID [2022-04-15 11:52:47,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {232364#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; {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {232364#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L272 TraceCheckUtils]: 7: Hoare triple {232364#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {232364#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); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {232364#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; {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {232364#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; {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {232364#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {232364#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {232364#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {232364#true} assume !false; {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {232364#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {232364#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {232364#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {232364#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {232364#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {232364#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {232364#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {232364#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {232364#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {232364#true} assume 8464 == #t~mem55;havoc #t~mem55; {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {232364#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; {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {232364#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {232364#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); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {232364#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); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {232364#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {232364#true} ~skip~0 := 0; {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {232364#true} assume !false; {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {232364#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {232364#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {232364#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,290 INFO L290 TraceCheckUtils]: 35: Hoare triple {232364#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {232364#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {232364#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {232364#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {232364#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {232364#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 41: Hoare triple {232364#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 42: Hoare triple {232364#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 43: Hoare triple {232364#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {232364#true} assume 8496 == #t~mem58;havoc #t~mem58; {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {232364#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {232364#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {232364#true} is VALID [2022-04-15 11:52:47,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {232364#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {232364#true} is VALID [2022-04-15 11:52:47,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {232364#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {232369#(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); {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {232369#(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; {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {232369#(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); {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {232369#(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); {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {232369#(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); {232369#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:52:47,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {232369#(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); {232370#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {232370#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {232365#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {232365#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {232365#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {232365#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {232365#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {232365#false} ~skip~0 := 0; {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 69: Hoare triple {232365#false} assume !false; {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 70: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,296 INFO L290 TraceCheckUtils]: 71: Hoare triple {232365#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 72: Hoare triple {232365#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 73: Hoare triple {232365#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 74: Hoare triple {232365#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 75: Hoare triple {232365#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 76: Hoare triple {232365#false} assume 8480 == #t~mem52;havoc #t~mem52; {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 77: Hoare triple {232365#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; {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 78: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 79: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {232365#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {232365#false} ~skip~0 := 0; {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {232365#false} assume !false; {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 83: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 84: Hoare triple {232365#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 85: Hoare triple {232365#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {232365#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 87: Hoare triple {232365#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {232365#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 89: Hoare triple {232365#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 90: Hoare triple {232365#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 91: Hoare triple {232365#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 92: Hoare triple {232365#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 93: Hoare triple {232365#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 94: Hoare triple {232365#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 95: Hoare triple {232365#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 96: Hoare triple {232365#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 97: Hoare triple {232365#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 98: Hoare triple {232365#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 99: Hoare triple {232365#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,298 INFO L290 TraceCheckUtils]: 100: Hoare triple {232365#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,299 INFO L290 TraceCheckUtils]: 101: Hoare triple {232365#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,299 INFO L290 TraceCheckUtils]: 102: Hoare triple {232365#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 103: Hoare triple {232365#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 104: Hoare triple {232365#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 105: Hoare triple {232365#false} assume 8448 == #t~mem68;havoc #t~mem68; {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 106: Hoare triple {232365#false} assume !(~num1~0 > 0); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 107: Hoare triple {232365#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; {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 108: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 109: Hoare triple {232365#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 110: Hoare triple {232365#false} ~skip~0 := 0; {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 111: Hoare triple {232365#false} assume !false; {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 112: Hoare triple {232365#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); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 113: Hoare triple {232365#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 114: Hoare triple {232365#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,332 INFO L290 TraceCheckUtils]: 115: Hoare triple {232365#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 116: Hoare triple {232365#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 117: Hoare triple {232365#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 118: Hoare triple {232365#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 119: Hoare triple {232365#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 120: Hoare triple {232365#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 121: Hoare triple {232365#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 122: Hoare triple {232365#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 123: Hoare triple {232365#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 124: Hoare triple {232365#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 125: Hoare triple {232365#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 126: Hoare triple {232365#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 127: Hoare triple {232365#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 128: Hoare triple {232365#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 129: Hoare triple {232365#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,333 INFO L290 TraceCheckUtils]: 130: Hoare triple {232365#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 131: Hoare triple {232365#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 132: Hoare triple {232365#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 133: Hoare triple {232365#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 134: Hoare triple {232365#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 135: Hoare triple {232365#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 136: Hoare triple {232365#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 137: Hoare triple {232365#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 138: Hoare triple {232365#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 139: Hoare triple {232365#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 140: Hoare triple {232365#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 141: Hoare triple {232365#false} assume 8640 == #t~mem75;havoc #t~mem75; {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 142: Hoare triple {232365#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 143: Hoare triple {232365#false} assume !(9 == ~blastFlag~0); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 144: Hoare triple {232365#false} assume !(12 == ~blastFlag~0); {232365#false} is VALID [2022-04-15 11:52:47,334 INFO L290 TraceCheckUtils]: 145: Hoare triple {232365#false} assume 15 == ~blastFlag~0; {232365#false} is VALID [2022-04-15 11:52:47,335 INFO L290 TraceCheckUtils]: 146: Hoare triple {232365#false} assume !false; {232365#false} is VALID [2022-04-15 11:52:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:52:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:52:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676662143] [2022-04-15 11:52:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676662143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:47,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:47,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:47,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:52:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [323731893] [2022-04-15 11:52:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [323731893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:52:47,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:52:47,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:52:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403061316] [2022-04-15 11:52:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:52:47,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 11:52:47,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:52:47,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:47,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:47,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:52:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:52:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:52:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:52:47,398 INFO L87 Difference]: Start difference. First operand 1384 states and 2152 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:53,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:52:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:55,943 INFO L93 Difference]: Finished difference Result 2541 states and 3905 transitions. [2022-04-15 11:52:55,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:52:55,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 147 [2022-04-15 11:52:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:52:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-15 11:52:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2022-04-15 11:52:55,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 621 transitions. [2022-04-15 11:52:56,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 621 edges. 621 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:52:56,446 INFO L225 Difference]: With dead ends: 2541 [2022-04-15 11:52:56,447 INFO L226 Difference]: Without dead ends: 1601 [2022-04-15 11:52:56,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:52:56,448 INFO L913 BasicCegarLoop]: 143 mSDtfsCounter, 151 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-15 11:52:56,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 406 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-15 11:52:56,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-04-15 11:52:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1384. [2022-04-15 11:52:56,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:52:56,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1601 states. Second operand has 1384 states, 1379 states have (on average 1.5380710659898478) internal successors, (2121), 1379 states have internal predecessors, (2121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:56,569 INFO L74 IsIncluded]: Start isIncluded. First operand 1601 states. Second operand has 1384 states, 1379 states have (on average 1.5380710659898478) internal successors, (2121), 1379 states have internal predecessors, (2121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:56,570 INFO L87 Difference]: Start difference. First operand 1601 states. Second operand has 1384 states, 1379 states have (on average 1.5380710659898478) internal successors, (2121), 1379 states have internal predecessors, (2121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:56,648 INFO L93 Difference]: Finished difference Result 1601 states and 2415 transitions. [2022-04-15 11:52:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2415 transitions. [2022-04-15 11:52:56,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:56,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:56,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1379 states have (on average 1.5380710659898478) internal successors, (2121), 1379 states have internal predecessors, (2121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1601 states. [2022-04-15 11:52:56,651 INFO L87 Difference]: Start difference. First operand has 1384 states, 1379 states have (on average 1.5380710659898478) internal successors, (2121), 1379 states have internal predecessors, (2121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1601 states. [2022-04-15 11:52:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:52:56,730 INFO L93 Difference]: Finished difference Result 1601 states and 2415 transitions. [2022-04-15 11:52:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2415 transitions. [2022-04-15 11:52:56,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:52:56,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:52:56,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:52:56,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:52:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1379 states have (on average 1.5380710659898478) internal successors, (2121), 1379 states have internal predecessors, (2121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2125 transitions. [2022-04-15 11:52:56,821 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2125 transitions. Word has length 147 [2022-04-15 11:52:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:52:56,821 INFO L478 AbstractCegarLoop]: Abstraction has 1384 states and 2125 transitions. [2022-04-15 11:52:56,822 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:52:56,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1384 states and 2125 transitions. [2022-04-15 11:53:00,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2125 edges. 2125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2125 transitions. [2022-04-15 11:53:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-04-15 11:53:00,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:00,468 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:53:00,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 11:53:00,468 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:00,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1994763260, now seen corresponding path program 1 times [2022-04-15 11:53:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:00,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61352852] [2022-04-15 11:53:00,549 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:00,549 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:00,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1994763260, now seen corresponding path program 2 times [2022-04-15 11:53:00,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:00,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001419391] [2022-04-15 11:53:00,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:00,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {243435#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {243428#true} is VALID [2022-04-15 11:53:00,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {243428#true} assume true; {243428#true} is VALID [2022-04-15 11:53:00,695 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {243428#true} {243428#true} #725#return; {243428#true} is VALID [2022-04-15 11:53:00,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {243428#true} call ULTIMATE.init(); {243435#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:53:00,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {243435#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {243428#true} is VALID [2022-04-15 11:53:00,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {243428#true} assume true; {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243428#true} {243428#true} #725#return; {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {243428#true} call #t~ret161 := main(); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {243428#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; {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {243428#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L272 TraceCheckUtils]: 7: Hoare triple {243428#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {243428#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); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {243428#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; {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {243428#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; {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {243428#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {243428#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {243428#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {243428#true} assume !false; {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {243428#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {243428#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {243428#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {243428#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {243428#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {243428#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {243428#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {243428#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {243428#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 24: Hoare triple {243428#true} assume 8464 == #t~mem55;havoc #t~mem55; {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {243428#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; {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {243428#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {243428#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); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {243428#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); {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {243428#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {243428#true} ~skip~0 := 0; {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {243428#true} assume !false; {243428#true} is VALID [2022-04-15 11:53:00,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {243428#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {243428#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {243428#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {243428#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {243428#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {243428#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {243428#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {243428#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {243428#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {243428#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {243428#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {243428#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {243428#true} assume 8496 == #t~mem58;havoc #t~mem58; {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {243428#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {243428#true} is VALID [2022-04-15 11:53:00,699 INFO L290 TraceCheckUtils]: 46: Hoare triple {243428#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {243428#true} is VALID [2022-04-15 11:53:00,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {243428#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {243428#true} is VALID [2022-04-15 11:53:00,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {243428#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {243433#(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); {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,702 INFO L290 TraceCheckUtils]: 51: Hoare triple {243433#(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; {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {243433#(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); {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,703 INFO L290 TraceCheckUtils]: 55: Hoare triple {243433#(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); {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {243433#(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); {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,703 INFO L290 TraceCheckUtils]: 57: Hoare triple {243433#(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); {243433#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:00,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {243433#(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); {243434#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-15 11:53:00,704 INFO L290 TraceCheckUtils]: 59: Hoare triple {243434#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {243429#false} is VALID [2022-04-15 11:53:00,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {243429#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {243429#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {243429#false} is VALID [2022-04-15 11:53:00,704 INFO L290 TraceCheckUtils]: 62: Hoare triple {243429#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,704 INFO L290 TraceCheckUtils]: 63: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 64: Hoare triple {243429#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 66: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {243429#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {243429#false} ~skip~0 := 0; {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 70: Hoare triple {243429#false} assume !false; {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 71: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {243429#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 73: Hoare triple {243429#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {243429#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {243429#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 76: Hoare triple {243429#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 77: Hoare triple {243429#false} assume 8480 == #t~mem52;havoc #t~mem52; {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {243429#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; {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 79: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 81: Hoare triple {243429#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 82: Hoare triple {243429#false} ~skip~0 := 0; {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 83: Hoare triple {243429#false} assume !false; {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 84: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 85: Hoare triple {243429#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 86: Hoare triple {243429#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 87: Hoare triple {243429#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 88: Hoare triple {243429#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 89: Hoare triple {243429#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,706 INFO L290 TraceCheckUtils]: 90: Hoare triple {243429#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 91: Hoare triple {243429#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 92: Hoare triple {243429#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 93: Hoare triple {243429#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 94: Hoare triple {243429#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 95: Hoare triple {243429#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 96: Hoare triple {243429#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 97: Hoare triple {243429#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 98: Hoare triple {243429#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 99: Hoare triple {243429#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,707 INFO L290 TraceCheckUtils]: 100: Hoare triple {243429#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 101: Hoare triple {243429#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 102: Hoare triple {243429#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 103: Hoare triple {243429#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 104: Hoare triple {243429#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 105: Hoare triple {243429#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 106: Hoare triple {243429#false} assume 8448 == #t~mem68;havoc #t~mem68; {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 107: Hoare triple {243429#false} assume !(~num1~0 > 0); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 108: Hoare triple {243429#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; {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 109: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,708 INFO L290 TraceCheckUtils]: 110: Hoare triple {243429#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 111: Hoare triple {243429#false} ~skip~0 := 0; {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 112: Hoare triple {243429#false} assume !false; {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 113: Hoare triple {243429#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); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 114: Hoare triple {243429#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 115: Hoare triple {243429#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 116: Hoare triple {243429#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 117: Hoare triple {243429#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 118: Hoare triple {243429#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 119: Hoare triple {243429#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 120: Hoare triple {243429#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 121: Hoare triple {243429#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 122: Hoare triple {243429#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,709 INFO L290 TraceCheckUtils]: 123: Hoare triple {243429#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 124: Hoare triple {243429#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 125: Hoare triple {243429#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 126: Hoare triple {243429#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 127: Hoare triple {243429#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 128: Hoare triple {243429#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 129: Hoare triple {243429#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 130: Hoare triple {243429#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 131: Hoare triple {243429#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 132: Hoare triple {243429#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 133: Hoare triple {243429#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 134: Hoare triple {243429#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 135: Hoare triple {243429#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 136: Hoare triple {243429#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 137: Hoare triple {243429#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,710 INFO L290 TraceCheckUtils]: 138: Hoare triple {243429#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 139: Hoare triple {243429#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 140: Hoare triple {243429#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 141: Hoare triple {243429#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 142: Hoare triple {243429#false} assume 8640 == #t~mem75;havoc #t~mem75; {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 143: Hoare triple {243429#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 144: Hoare triple {243429#false} assume !(9 == ~blastFlag~0); {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 145: Hoare triple {243429#false} assume !(12 == ~blastFlag~0); {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 146: Hoare triple {243429#false} assume 15 == ~blastFlag~0; {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L290 TraceCheckUtils]: 147: Hoare triple {243429#false} assume !false; {243429#false} is VALID [2022-04-15 11:53:00,711 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 11:53:00,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001419391] [2022-04-15 11:53:00,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001419391] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:00,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:00,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:00,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:00,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61352852] [2022-04-15 11:53:00,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61352852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:00,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:00,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:00,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657692071] [2022-04-15 11:53:00,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:00,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 11:53:00,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:00,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:00,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:00,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:00,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:00,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:00,788 INFO L87 Difference]: Start difference. First operand 1384 states and 2125 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:05,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:53:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:09,471 INFO L93 Difference]: Finished difference Result 2521 states and 3834 transitions. [2022-04-15 11:53:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 148 [2022-04-15 11:53:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-15 11:53:09,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2022-04-15 11:53:09,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 607 transitions. [2022-04-15 11:53:09,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:09,996 INFO L225 Difference]: With dead ends: 2521 [2022-04-15 11:53:09,996 INFO L226 Difference]: Without dead ends: 1581 [2022-04-15 11:53:09,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:53:09,998 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 142 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:09,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 426 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 11:53:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2022-04-15 11:53:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1384. [2022-04-15 11:53:10,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:10,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1581 states. Second operand has 1384 states, 1379 states have (on average 1.5184916606236403) internal successors, (2094), 1379 states have internal predecessors, (2094), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:10,123 INFO L74 IsIncluded]: Start isIncluded. First operand 1581 states. Second operand has 1384 states, 1379 states have (on average 1.5184916606236403) internal successors, (2094), 1379 states have internal predecessors, (2094), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:10,124 INFO L87 Difference]: Start difference. First operand 1581 states. Second operand has 1384 states, 1379 states have (on average 1.5184916606236403) internal successors, (2094), 1379 states have internal predecessors, (2094), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:10,200 INFO L93 Difference]: Finished difference Result 1581 states and 2362 transitions. [2022-04-15 11:53:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2362 transitions. [2022-04-15 11:53:10,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:10,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:10,202 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1379 states have (on average 1.5184916606236403) internal successors, (2094), 1379 states have internal predecessors, (2094), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1581 states. [2022-04-15 11:53:10,203 INFO L87 Difference]: Start difference. First operand has 1384 states, 1379 states have (on average 1.5184916606236403) internal successors, (2094), 1379 states have internal predecessors, (2094), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1581 states. [2022-04-15 11:53:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:10,284 INFO L93 Difference]: Finished difference Result 1581 states and 2362 transitions. [2022-04-15 11:53:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2362 transitions. [2022-04-15 11:53:10,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:10,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:10,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:10,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1379 states have (on average 1.5184916606236403) internal successors, (2094), 1379 states have internal predecessors, (2094), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2098 transitions. [2022-04-15 11:53:10,372 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2098 transitions. Word has length 148 [2022-04-15 11:53:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:10,372 INFO L478 AbstractCegarLoop]: Abstraction has 1384 states and 2098 transitions. [2022-04-15 11:53:10,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:10,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1384 states and 2098 transitions. [2022-04-15 11:53:14,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2098 edges. 2098 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2098 transitions. [2022-04-15 11:53:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 11:53:14,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:14,501 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:53:14,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 11:53:14,501 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -474765180, now seen corresponding path program 1 times [2022-04-15 11:53:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:14,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1605357931] [2022-04-15 11:53:14,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:14,620 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:14,620 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:14,620 INFO L85 PathProgramCache]: Analyzing trace with hash -474765180, now seen corresponding path program 2 times [2022-04-15 11:53:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:14,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460919066] [2022-04-15 11:53:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:14,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {254419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {254412#true} is VALID [2022-04-15 11:53:14,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {254412#true} assume true; {254412#true} is VALID [2022-04-15 11:53:14,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {254412#true} {254412#true} #725#return; {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {254412#true} call ULTIMATE.init(); {254419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {254419#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {254412#true} assume true; {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {254412#true} {254412#true} #725#return; {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {254412#true} call #t~ret161 := main(); {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {254412#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; {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {254412#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L272 TraceCheckUtils]: 7: Hoare triple {254412#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {254412#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); {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {254412#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; {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {254412#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; {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {254412#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {254412#true} is VALID [2022-04-15 11:53:14,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {254412#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {254412#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {254412#true} assume !false; {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 15: Hoare triple {254412#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 16: Hoare triple {254412#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {254412#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {254412#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {254412#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {254412#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {254412#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {254412#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {254412#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {254412#true} assume 8464 == #t~mem55;havoc #t~mem55; {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {254412#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; {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {254412#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {254412#true} is VALID [2022-04-15 11:53:14,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {254412#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); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {254412#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); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {254412#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {254412#true} ~skip~0 := 0; {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 31: Hoare triple {254412#true} assume !false; {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {254412#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {254412#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 34: Hoare triple {254412#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 35: Hoare triple {254412#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {254412#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 37: Hoare triple {254412#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {254412#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {254412#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {254412#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {254412#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {254412#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {254412#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {254412#true} assume 8496 == #t~mem58;havoc #t~mem58; {254412#true} is VALID [2022-04-15 11:53:14,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {254412#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {254412#true} is VALID [2022-04-15 11:53:14,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {254412#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {254412#true} is VALID [2022-04-15 11:53:14,771 INFO L290 TraceCheckUtils]: 47: Hoare triple {254412#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {254412#true} is VALID [2022-04-15 11:53:14,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {254412#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,778 INFO L290 TraceCheckUtils]: 66: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,778 INFO L290 TraceCheckUtils]: 67: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {254417#(not (= 8544 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {254418#(not (= |ssl3_accept_#t~mem64| 8544))} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {254418#(not (= |ssl3_accept_#t~mem64| 8544))} assume 8544 == #t~mem64;havoc #t~mem64; {254413#false} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {254413#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 74: Hoare triple {254413#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); {254413#false} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 75: Hoare triple {254413#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {254413#false} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 76: Hoare triple {254413#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); {254413#false} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 77: Hoare triple {254413#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; {254413#false} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 78: Hoare triple {254413#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; {254413#false} is VALID [2022-04-15 11:53:14,780 INFO L290 TraceCheckUtils]: 79: Hoare triple {254413#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 80: Hoare triple {254413#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); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 81: Hoare triple {254413#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); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 82: Hoare triple {254413#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 83: Hoare triple {254413#false} ~skip~0 := 0; {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 84: Hoare triple {254413#false} assume !false; {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 85: Hoare triple {254413#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); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 86: Hoare triple {254413#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 87: Hoare triple {254413#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {254413#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 89: Hoare triple {254413#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 90: Hoare triple {254413#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 91: Hoare triple {254413#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 92: Hoare triple {254413#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,781 INFO L290 TraceCheckUtils]: 93: Hoare triple {254413#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 94: Hoare triple {254413#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 95: Hoare triple {254413#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 96: Hoare triple {254413#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 97: Hoare triple {254413#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 98: Hoare triple {254413#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 99: Hoare triple {254413#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 100: Hoare triple {254413#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 101: Hoare triple {254413#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 102: Hoare triple {254413#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 103: Hoare triple {254413#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 104: Hoare triple {254413#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 105: Hoare triple {254413#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 106: Hoare triple {254413#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 107: Hoare triple {254413#false} assume 8448 == #t~mem68;havoc #t~mem68; {254413#false} is VALID [2022-04-15 11:53:14,782 INFO L290 TraceCheckUtils]: 108: Hoare triple {254413#false} assume !(~num1~0 > 0); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 109: Hoare triple {254413#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; {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 110: Hoare triple {254413#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); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 111: Hoare triple {254413#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 112: Hoare triple {254413#false} ~skip~0 := 0; {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 113: Hoare triple {254413#false} assume !false; {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 114: Hoare triple {254413#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); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 115: Hoare triple {254413#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 116: Hoare triple {254413#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 117: Hoare triple {254413#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 118: Hoare triple {254413#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 119: Hoare triple {254413#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 120: Hoare triple {254413#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 121: Hoare triple {254413#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,783 INFO L290 TraceCheckUtils]: 122: Hoare triple {254413#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 123: Hoare triple {254413#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 124: Hoare triple {254413#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 125: Hoare triple {254413#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 126: Hoare triple {254413#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 127: Hoare triple {254413#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 128: Hoare triple {254413#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 129: Hoare triple {254413#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 130: Hoare triple {254413#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 131: Hoare triple {254413#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 132: Hoare triple {254413#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 133: Hoare triple {254413#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 134: Hoare triple {254413#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 135: Hoare triple {254413#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 136: Hoare triple {254413#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,784 INFO L290 TraceCheckUtils]: 137: Hoare triple {254413#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 138: Hoare triple {254413#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 139: Hoare triple {254413#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 140: Hoare triple {254413#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 141: Hoare triple {254413#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 142: Hoare triple {254413#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 143: Hoare triple {254413#false} assume 8640 == #t~mem75;havoc #t~mem75; {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 144: Hoare triple {254413#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 145: Hoare triple {254413#false} assume !(9 == ~blastFlag~0); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 146: Hoare triple {254413#false} assume !(12 == ~blastFlag~0); {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 147: Hoare triple {254413#false} assume 15 == ~blastFlag~0; {254413#false} is VALID [2022-04-15 11:53:14,785 INFO L290 TraceCheckUtils]: 148: Hoare triple {254413#false} assume !false; {254413#false} is VALID [2022-04-15 11:53:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:53:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:14,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460919066] [2022-04-15 11:53:14,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460919066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:14,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:14,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:14,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:14,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1605357931] [2022-04-15 11:53:14,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1605357931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:14,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:14,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52195756] [2022-04-15 11:53:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:14,787 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-15 11:53:14,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:14,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:14,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:14,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:14,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:14,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:14,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:14,854 INFO L87 Difference]: Start difference. First operand 1384 states and 2098 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:18,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:53:23,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:23,047 INFO L93 Difference]: Finished difference Result 3065 states and 4621 transitions. [2022-04-15 11:53:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:23,047 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-15 11:53:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:53:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:53:23,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-15 11:53:23,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:23,574 INFO L225 Difference]: With dead ends: 3065 [2022-04-15 11:53:23,574 INFO L226 Difference]: Without dead ends: 1707 [2022-04-15 11:53:23,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:53:23,576 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 128 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:23,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 426 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 11:53:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-04-15 11:53:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1468. [2022-04-15 11:53:23,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:23,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1707 states. Second operand has 1468 states, 1463 states have (on average 1.5051264524948735) internal successors, (2202), 1463 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:23,741 INFO L74 IsIncluded]: Start isIncluded. First operand 1707 states. Second operand has 1468 states, 1463 states have (on average 1.5051264524948735) internal successors, (2202), 1463 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:23,742 INFO L87 Difference]: Start difference. First operand 1707 states. Second operand has 1468 states, 1463 states have (on average 1.5051264524948735) internal successors, (2202), 1463 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:23,866 INFO L93 Difference]: Finished difference Result 1707 states and 2530 transitions. [2022-04-15 11:53:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2530 transitions. [2022-04-15 11:53:23,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:23,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:23,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 1468 states, 1463 states have (on average 1.5051264524948735) internal successors, (2202), 1463 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1707 states. [2022-04-15 11:53:23,871 INFO L87 Difference]: Start difference. First operand has 1468 states, 1463 states have (on average 1.5051264524948735) internal successors, (2202), 1463 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1707 states. [2022-04-15 11:53:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:23,990 INFO L93 Difference]: Finished difference Result 1707 states and 2530 transitions. [2022-04-15 11:53:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2530 transitions. [2022-04-15 11:53:23,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:23,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:23,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:23,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1463 states have (on average 1.5051264524948735) internal successors, (2202), 1463 states have internal predecessors, (2202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2206 transitions. [2022-04-15 11:53:24,132 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2206 transitions. Word has length 149 [2022-04-15 11:53:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:24,132 INFO L478 AbstractCegarLoop]: Abstraction has 1468 states and 2206 transitions. [2022-04-15 11:53:24,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:24,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1468 states and 2206 transitions. [2022-04-15 11:53:28,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2206 edges. 2206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2206 transitions. [2022-04-15 11:53:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-15 11:53:28,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:28,063 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:53:28,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 11:53:28,063 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash -222472467, now seen corresponding path program 1 times [2022-04-15 11:53:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:28,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643485572] [2022-04-15 11:53:28,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:28,168 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:28,168 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash -222472467, now seen corresponding path program 2 times [2022-04-15 11:53:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:28,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049446107] [2022-04-15 11:53:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:28,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {266911#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {266904#true} is VALID [2022-04-15 11:53:28,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {266904#true} assume true; {266904#true} is VALID [2022-04-15 11:53:28,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266904#true} {266904#true} #725#return; {266904#true} is VALID [2022-04-15 11:53:28,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {266904#true} call ULTIMATE.init(); {266911#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:53:28,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {266911#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {266904#true} is VALID [2022-04-15 11:53:28,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {266904#true} assume true; {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266904#true} {266904#true} #725#return; {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {266904#true} call #t~ret161 := main(); {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {266904#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; {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {266904#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L272 TraceCheckUtils]: 7: Hoare triple {266904#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {266904#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); {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {266904#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; {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {266904#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; {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {266904#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {266904#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {266904#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {266904#true} assume !false; {266904#true} is VALID [2022-04-15 11:53:28,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {266904#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {266904#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {266904#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {266904#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {266904#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {266904#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {266904#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {266904#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {266904#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {266904#true} assume 8464 == #t~mem55;havoc #t~mem55; {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {266904#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; {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {266904#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {266904#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); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {266904#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); {266904#true} is VALID [2022-04-15 11:53:28,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {266904#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {266904#true} ~skip~0 := 0; {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {266904#true} assume !false; {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {266904#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {266904#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {266904#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {266904#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {266904#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {266904#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {266904#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {266904#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {266904#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {266904#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {266904#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {266904#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {266904#true} assume 8496 == #t~mem58;havoc #t~mem58; {266904#true} is VALID [2022-04-15 11:53:28,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {266904#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {266904#true} is VALID [2022-04-15 11:53:28,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {266904#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {266904#true} is VALID [2022-04-15 11:53:28,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {266904#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {266904#true} is VALID [2022-04-15 11:53:28,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {266904#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,308 INFO L290 TraceCheckUtils]: 53: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,313 INFO L290 TraceCheckUtils]: 64: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:28,316 INFO L290 TraceCheckUtils]: 72: Hoare triple {266909#(not (= 8545 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {266910#(not (= |ssl3_accept_#t~mem65| 8545))} is VALID [2022-04-15 11:53:28,316 INFO L290 TraceCheckUtils]: 73: Hoare triple {266910#(not (= |ssl3_accept_#t~mem65| 8545))} assume 8545 == #t~mem65;havoc #t~mem65; {266905#false} is VALID [2022-04-15 11:53:28,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {266905#false} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {266905#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); {266905#false} is VALID [2022-04-15 11:53:28,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {266905#false} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {266905#false} is VALID [2022-04-15 11:53:28,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {266905#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); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {266905#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; {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {266905#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; {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {266905#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 81: Hoare triple {266905#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); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 82: Hoare triple {266905#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); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 83: Hoare triple {266905#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 84: Hoare triple {266905#false} ~skip~0 := 0; {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 85: Hoare triple {266905#false} assume !false; {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 86: Hoare triple {266905#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); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 87: Hoare triple {266905#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 88: Hoare triple {266905#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {266905#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {266905#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,317 INFO L290 TraceCheckUtils]: 91: Hoare triple {266905#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 92: Hoare triple {266905#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 93: Hoare triple {266905#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 94: Hoare triple {266905#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 95: Hoare triple {266905#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 96: Hoare triple {266905#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 97: Hoare triple {266905#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 98: Hoare triple {266905#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 99: Hoare triple {266905#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 100: Hoare triple {266905#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 101: Hoare triple {266905#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 102: Hoare triple {266905#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 103: Hoare triple {266905#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 104: Hoare triple {266905#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,318 INFO L290 TraceCheckUtils]: 105: Hoare triple {266905#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,319 INFO L290 TraceCheckUtils]: 106: Hoare triple {266905#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,319 INFO L290 TraceCheckUtils]: 107: Hoare triple {266905#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,319 INFO L290 TraceCheckUtils]: 108: Hoare triple {266905#false} assume 8448 == #t~mem68;havoc #t~mem68; {266905#false} is VALID [2022-04-15 11:53:28,319 INFO L290 TraceCheckUtils]: 109: Hoare triple {266905#false} assume !(~num1~0 > 0); {266905#false} is VALID [2022-04-15 11:53:28,319 INFO L290 TraceCheckUtils]: 110: Hoare triple {266905#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; {266905#false} is VALID [2022-04-15 11:53:28,319 INFO L290 TraceCheckUtils]: 111: Hoare triple {266905#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); {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 112: Hoare triple {266905#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 113: Hoare triple {266905#false} ~skip~0 := 0; {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 114: Hoare triple {266905#false} assume !false; {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 115: Hoare triple {266905#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); {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 116: Hoare triple {266905#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 117: Hoare triple {266905#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 118: Hoare triple {266905#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,320 INFO L290 TraceCheckUtils]: 119: Hoare triple {266905#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,335 INFO L290 TraceCheckUtils]: 120: Hoare triple {266905#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 121: Hoare triple {266905#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 122: Hoare triple {266905#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 123: Hoare triple {266905#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 124: Hoare triple {266905#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 125: Hoare triple {266905#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 126: Hoare triple {266905#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 127: Hoare triple {266905#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 128: Hoare triple {266905#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 129: Hoare triple {266905#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 130: Hoare triple {266905#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 131: Hoare triple {266905#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 132: Hoare triple {266905#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 133: Hoare triple {266905#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,336 INFO L290 TraceCheckUtils]: 134: Hoare triple {266905#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 135: Hoare triple {266905#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 136: Hoare triple {266905#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 137: Hoare triple {266905#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 138: Hoare triple {266905#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 139: Hoare triple {266905#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 140: Hoare triple {266905#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 141: Hoare triple {266905#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 142: Hoare triple {266905#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 143: Hoare triple {266905#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 144: Hoare triple {266905#false} assume 8640 == #t~mem75;havoc #t~mem75; {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 145: Hoare triple {266905#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 146: Hoare triple {266905#false} assume !(9 == ~blastFlag~0); {266905#false} is VALID [2022-04-15 11:53:28,337 INFO L290 TraceCheckUtils]: 147: Hoare triple {266905#false} assume !(12 == ~blastFlag~0); {266905#false} is VALID [2022-04-15 11:53:28,338 INFO L290 TraceCheckUtils]: 148: Hoare triple {266905#false} assume 15 == ~blastFlag~0; {266905#false} is VALID [2022-04-15 11:53:28,338 INFO L290 TraceCheckUtils]: 149: Hoare triple {266905#false} assume !false; {266905#false} is VALID [2022-04-15 11:53:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 11:53:28,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:28,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049446107] [2022-04-15 11:53:28,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049446107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:28,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:28,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:28,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:28,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643485572] [2022-04-15 11:53:28,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643485572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:28,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:28,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557227121] [2022-04-15 11:53:28,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:28,339 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-15 11:53:28,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:28,339 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-15 11:53:28,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:28,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:28,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:28,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:28,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:28,410 INFO L87 Difference]: Start difference. First operand 1468 states and 2206 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-15 11:53:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:38,818 INFO L93 Difference]: Finished difference Result 3107 states and 4645 transitions. [2022-04-15 11:53:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:38,818 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-15 11:53:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:38,818 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-15 11:53:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:53:38,821 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-15 11:53:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2022-04-15 11:53:38,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 606 transitions. [2022-04-15 11:53:39,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 606 edges. 606 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:39,382 INFO L225 Difference]: With dead ends: 3107 [2022-04-15 11:53:39,382 INFO L226 Difference]: Without dead ends: 1665 [2022-04-15 11:53:39,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:53:39,384 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 127 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:39,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 402 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 11:53:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2022-04-15 11:53:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1468. [2022-04-15 11:53:39,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:39,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1665 states. Second operand has 1468 states, 1463 states have (on average 1.4887218045112782) internal successors, (2178), 1463 states have internal predecessors, (2178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:39,539 INFO L74 IsIncluded]: Start isIncluded. First operand 1665 states. Second operand has 1468 states, 1463 states have (on average 1.4887218045112782) internal successors, (2178), 1463 states have internal predecessors, (2178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:39,540 INFO L87 Difference]: Start difference. First operand 1665 states. Second operand has 1468 states, 1463 states have (on average 1.4887218045112782) internal successors, (2178), 1463 states have internal predecessors, (2178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:39,623 INFO L93 Difference]: Finished difference Result 1665 states and 2446 transitions. [2022-04-15 11:53:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2446 transitions. [2022-04-15 11:53:39,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:39,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:39,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 1468 states, 1463 states have (on average 1.4887218045112782) internal successors, (2178), 1463 states have internal predecessors, (2178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1665 states. [2022-04-15 11:53:39,626 INFO L87 Difference]: Start difference. First operand has 1468 states, 1463 states have (on average 1.4887218045112782) internal successors, (2178), 1463 states have internal predecessors, (2178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1665 states. [2022-04-15 11:53:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:39,720 INFO L93 Difference]: Finished difference Result 1665 states and 2446 transitions. [2022-04-15 11:53:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2446 transitions. [2022-04-15 11:53:39,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:39,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:39,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:39,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1463 states have (on average 1.4887218045112782) internal successors, (2178), 1463 states have internal predecessors, (2178), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2182 transitions. [2022-04-15 11:53:39,819 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2182 transitions. Word has length 150 [2022-04-15 11:53:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:39,820 INFO L478 AbstractCegarLoop]: Abstraction has 1468 states and 2182 transitions. [2022-04-15 11:53:39,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:39,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1468 states and 2182 transitions. [2022-04-15 11:53:43,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2182 edges. 2182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2182 transitions. [2022-04-15 11:53:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 11:53:43,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:43,640 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:53:43,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 11:53:43,640 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:43,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1712055703, now seen corresponding path program 1 times [2022-04-15 11:53:43,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:43,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546811485] [2022-04-15 11:53:43,723 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:43,723 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:43,723 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1712055703, now seen corresponding path program 2 times [2022-04-15 11:53:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909420020] [2022-04-15 11:53:43,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:43,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {279403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {279396#true} is VALID [2022-04-15 11:53:43,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {279396#true} assume true; {279396#true} is VALID [2022-04-15 11:53:43,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279396#true} {279396#true} #725#return; {279396#true} is VALID [2022-04-15 11:53:43,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {279396#true} call ULTIMATE.init(); {279403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:53:43,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {279403#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {279396#true} is VALID [2022-04-15 11:53:43,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {279396#true} assume true; {279396#true} is VALID [2022-04-15 11:53:43,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279396#true} {279396#true} #725#return; {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {279396#true} call #t~ret161 := main(); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {279396#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; {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {279396#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L272 TraceCheckUtils]: 7: Hoare triple {279396#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {279396#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); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {279396#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; {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {279396#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; {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {279396#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {279396#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {279396#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {279396#true} assume !false; {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {279396#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {279396#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {279396#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {279396#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {279396#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {279396#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {279396#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {279396#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {279396#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {279396#true} assume 8464 == #t~mem55;havoc #t~mem55; {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {279396#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; {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {279396#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 27: Hoare triple {279396#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); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {279396#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); {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {279396#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {279396#true} ~skip~0 := 0; {279396#true} is VALID [2022-04-15 11:53:43,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {279396#true} assume !false; {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {279396#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {279396#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {279396#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {279396#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {279396#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {279396#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {279396#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {279396#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {279396#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 41: Hoare triple {279396#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {279396#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {279396#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {279396#true} assume 8496 == #t~mem58;havoc #t~mem58; {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 45: Hoare triple {279396#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {279396#true} is VALID [2022-04-15 11:53:43,861 INFO L290 TraceCheckUtils]: 46: Hoare triple {279396#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {279396#true} is VALID [2022-04-15 11:53:43,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {279396#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {279396#true} is VALID [2022-04-15 11:53:43,862 INFO L290 TraceCheckUtils]: 48: Hoare triple {279396#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,863 INFO L290 TraceCheckUtils]: 49: Hoare triple {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,863 INFO L290 TraceCheckUtils]: 50: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {279401#(= 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; {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,865 INFO L290 TraceCheckUtils]: 54: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,867 INFO L290 TraceCheckUtils]: 59: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,867 INFO L290 TraceCheckUtils]: 60: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,867 INFO L290 TraceCheckUtils]: 61: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,868 INFO L290 TraceCheckUtils]: 62: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,868 INFO L290 TraceCheckUtils]: 63: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,869 INFO L290 TraceCheckUtils]: 65: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,869 INFO L290 TraceCheckUtils]: 66: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,869 INFO L290 TraceCheckUtils]: 67: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,870 INFO L290 TraceCheckUtils]: 68: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,870 INFO L290 TraceCheckUtils]: 69: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,870 INFO L290 TraceCheckUtils]: 70: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,871 INFO L290 TraceCheckUtils]: 71: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,871 INFO L290 TraceCheckUtils]: 72: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,871 INFO L290 TraceCheckUtils]: 73: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,872 INFO L290 TraceCheckUtils]: 74: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,872 INFO L290 TraceCheckUtils]: 75: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,872 INFO L290 TraceCheckUtils]: 76: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,873 INFO L290 TraceCheckUtils]: 77: Hoare triple {279401#(= 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); {279401#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:53:43,873 INFO L290 TraceCheckUtils]: 78: Hoare triple {279401#(= 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); {279402#(= |ssl3_accept_#t~mem71| 8656)} is VALID [2022-04-15 11:53:43,873 INFO L290 TraceCheckUtils]: 79: Hoare triple {279402#(= |ssl3_accept_#t~mem71| 8656)} assume 8592 == #t~mem71;havoc #t~mem71; {279397#false} is VALID [2022-04-15 11:53:43,873 INFO L290 TraceCheckUtils]: 80: Hoare triple {279397#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {279397#false} is VALID [2022-04-15 11:53:43,873 INFO L290 TraceCheckUtils]: 81: Hoare triple {279397#false} assume !(7 == ~blastFlag~0); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 82: Hoare triple {279397#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {279397#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); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 84: Hoare triple {279397#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 85: Hoare triple {279397#false} ~skip~0 := 0; {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 86: Hoare triple {279397#false} assume !false; {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 87: Hoare triple {279397#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); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 88: Hoare triple {279397#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 89: Hoare triple {279397#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 90: Hoare triple {279397#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 91: Hoare triple {279397#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 92: Hoare triple {279397#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 93: Hoare triple {279397#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 94: Hoare triple {279397#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 95: Hoare triple {279397#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,874 INFO L290 TraceCheckUtils]: 96: Hoare triple {279397#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 97: Hoare triple {279397#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 98: Hoare triple {279397#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 99: Hoare triple {279397#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 100: Hoare triple {279397#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 101: Hoare triple {279397#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 102: Hoare triple {279397#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 103: Hoare triple {279397#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 104: Hoare triple {279397#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 105: Hoare triple {279397#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 106: Hoare triple {279397#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 107: Hoare triple {279397#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 108: Hoare triple {279397#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 109: Hoare triple {279397#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,875 INFO L290 TraceCheckUtils]: 110: Hoare triple {279397#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 111: Hoare triple {279397#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 112: Hoare triple {279397#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 113: Hoare triple {279397#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 114: Hoare triple {279397#false} assume 8608 == #t~mem73;havoc #t~mem73; {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 115: Hoare triple {279397#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 116: Hoare triple {279397#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 117: Hoare triple {279397#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); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 118: Hoare triple {279397#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); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 119: Hoare triple {279397#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 120: Hoare triple {279397#false} ~skip~0 := 0; {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 121: Hoare triple {279397#false} assume !false; {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 122: Hoare triple {279397#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); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 123: Hoare triple {279397#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 124: Hoare triple {279397#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,876 INFO L290 TraceCheckUtils]: 125: Hoare triple {279397#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 126: Hoare triple {279397#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 127: Hoare triple {279397#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 128: Hoare triple {279397#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 129: Hoare triple {279397#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 130: Hoare triple {279397#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 131: Hoare triple {279397#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 132: Hoare triple {279397#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 133: Hoare triple {279397#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 134: Hoare triple {279397#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 135: Hoare triple {279397#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 136: Hoare triple {279397#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 137: Hoare triple {279397#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 138: Hoare triple {279397#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 139: Hoare triple {279397#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,877 INFO L290 TraceCheckUtils]: 140: Hoare triple {279397#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 141: Hoare triple {279397#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 142: Hoare triple {279397#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 143: Hoare triple {279397#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 144: Hoare triple {279397#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 145: Hoare triple {279397#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 146: Hoare triple {279397#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 147: Hoare triple {279397#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 148: Hoare triple {279397#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 149: Hoare triple {279397#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 150: Hoare triple {279397#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 151: Hoare triple {279397#false} assume 8640 == #t~mem75;havoc #t~mem75; {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 152: Hoare triple {279397#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 153: Hoare triple {279397#false} assume !(9 == ~blastFlag~0); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 154: Hoare triple {279397#false} assume !(12 == ~blastFlag~0); {279397#false} is VALID [2022-04-15 11:53:43,878 INFO L290 TraceCheckUtils]: 155: Hoare triple {279397#false} assume 15 == ~blastFlag~0; {279397#false} is VALID [2022-04-15 11:53:43,879 INFO L290 TraceCheckUtils]: 156: Hoare triple {279397#false} assume !false; {279397#false} is VALID [2022-04-15 11:53:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:53:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:43,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909420020] [2022-04-15 11:53:43,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909420020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:43,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:43,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:43,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:43,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546811485] [2022-04-15 11:53:43,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546811485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:43,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:43,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979930884] [2022-04-15 11:53:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:43,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 11:53:43,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:43,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:43,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:43,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:43,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:43,952 INFO L87 Difference]: Start difference. First operand 1468 states and 2182 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:46,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:53:48,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:53:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:53,504 INFO L93 Difference]: Finished difference Result 2981 states and 4422 transitions. [2022-04-15 11:53:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:53:53,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 11:53:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:53:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2022-04-15 11:53:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2022-04-15 11:53:53,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 532 transitions. [2022-04-15 11:53:53,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:54,018 INFO L225 Difference]: With dead ends: 2981 [2022-04-15 11:53:54,018 INFO L226 Difference]: Without dead ends: 1539 [2022-04-15 11:53:54,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:53:54,021 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 52 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-15 11:53:54,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 651 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 533 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2022-04-15 11:53:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2022-04-15 11:53:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1468. [2022-04-15 11:53:54,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:53:54,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1539 states. Second operand has 1468 states, 1463 states have (on average 1.4866712235133288) internal successors, (2175), 1463 states have internal predecessors, (2175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:54,206 INFO L74 IsIncluded]: Start isIncluded. First operand 1539 states. Second operand has 1468 states, 1463 states have (on average 1.4866712235133288) internal successors, (2175), 1463 states have internal predecessors, (2175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:54,207 INFO L87 Difference]: Start difference. First operand 1539 states. Second operand has 1468 states, 1463 states have (on average 1.4866712235133288) internal successors, (2175), 1463 states have internal predecessors, (2175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:54,278 INFO L93 Difference]: Finished difference Result 1539 states and 2268 transitions. [2022-04-15 11:53:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2268 transitions. [2022-04-15 11:53:54,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:54,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:54,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 1468 states, 1463 states have (on average 1.4866712235133288) internal successors, (2175), 1463 states have internal predecessors, (2175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1539 states. [2022-04-15 11:53:54,280 INFO L87 Difference]: Start difference. First operand has 1468 states, 1463 states have (on average 1.4866712235133288) internal successors, (2175), 1463 states have internal predecessors, (2175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1539 states. [2022-04-15 11:53:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:53:54,354 INFO L93 Difference]: Finished difference Result 1539 states and 2268 transitions. [2022-04-15 11:53:54,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2268 transitions. [2022-04-15 11:53:54,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:53:54,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:53:54,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:53:54,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:53:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1463 states have (on average 1.4866712235133288) internal successors, (2175), 1463 states have internal predecessors, (2175), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2179 transitions. [2022-04-15 11:53:54,466 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2179 transitions. Word has length 157 [2022-04-15 11:53:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:53:54,466 INFO L478 AbstractCegarLoop]: Abstraction has 1468 states and 2179 transitions. [2022-04-15 11:53:54,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:54,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1468 states and 2179 transitions. [2022-04-15 11:53:58,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2179 edges. 2179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:58,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2179 transitions. [2022-04-15 11:53:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-04-15 11:53:58,417 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:53:58,418 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:53:58,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 11:53:58,418 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:53:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:53:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash 673471129, now seen corresponding path program 1 times [2022-04-15 11:53:58,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:58,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1023844384] [2022-04-15 11:53:58,518 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:53:58,519 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:53:58,519 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:53:58,519 INFO L85 PathProgramCache]: Analyzing trace with hash 673471129, now seen corresponding path program 2 times [2022-04-15 11:53:58,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:53:58,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578690720] [2022-04-15 11:53:58,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:53:58,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:53:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:53:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:53:58,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {291391#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {291384#true} is VALID [2022-04-15 11:53:58,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {291384#true} assume true; {291384#true} is VALID [2022-04-15 11:53:58,646 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {291384#true} {291384#true} #725#return; {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {291384#true} call ULTIMATE.init(); {291391#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:53:58,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {291391#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {291384#true} assume true; {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {291384#true} {291384#true} #725#return; {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {291384#true} call #t~ret161 := main(); {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {291384#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; {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {291384#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L272 TraceCheckUtils]: 7: Hoare triple {291384#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {291384#true} is VALID [2022-04-15 11:53:58,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {291384#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); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {291384#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; {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {291384#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; {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {291384#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {291384#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {291384#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {291384#true} assume !false; {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {291384#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {291384#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {291384#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {291384#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {291384#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {291384#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {291384#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {291384#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {291384#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {291384#true} assume 8464 == #t~mem55;havoc #t~mem55; {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {291384#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; {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {291384#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {291384#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); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {291384#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); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {291384#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {291384#true} ~skip~0 := 0; {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {291384#true} assume !false; {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {291384#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {291384#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {291384#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {291384#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {291384#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {291384#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,649 INFO L290 TraceCheckUtils]: 38: Hoare triple {291384#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {291384#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {291384#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {291384#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {291384#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 43: Hoare triple {291384#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 44: Hoare triple {291384#true} assume 8496 == #t~mem58;havoc #t~mem58; {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 45: Hoare triple {291384#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 46: Hoare triple {291384#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {291384#true} is VALID [2022-04-15 11:53:58,650 INFO L290 TraceCheckUtils]: 47: Hoare triple {291384#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {291384#true} is VALID [2022-04-15 11:53:58,651 INFO L290 TraceCheckUtils]: 48: Hoare triple {291384#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,651 INFO L290 TraceCheckUtils]: 49: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,652 INFO L290 TraceCheckUtils]: 51: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,652 INFO L290 TraceCheckUtils]: 52: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,653 INFO L290 TraceCheckUtils]: 53: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,653 INFO L290 TraceCheckUtils]: 54: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,654 INFO L290 TraceCheckUtils]: 56: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,655 INFO L290 TraceCheckUtils]: 61: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,656 INFO L290 TraceCheckUtils]: 62: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,656 INFO L290 TraceCheckUtils]: 63: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,657 INFO L290 TraceCheckUtils]: 65: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,657 INFO L290 TraceCheckUtils]: 66: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,658 INFO L290 TraceCheckUtils]: 69: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,658 INFO L290 TraceCheckUtils]: 71: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,660 INFO L290 TraceCheckUtils]: 75: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 77: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {291389#(not (= 8592 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {291390#(not (= |ssl3_accept_#t~mem71| 8592))} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 79: Hoare triple {291390#(not (= |ssl3_accept_#t~mem71| 8592))} assume 8592 == #t~mem71;havoc #t~mem71; {291385#false} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 80: Hoare triple {291385#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {291385#false} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 81: Hoare triple {291385#false} assume !(7 == ~blastFlag~0); {291385#false} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {291385#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 83: Hoare triple {291385#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); {291385#false} is VALID [2022-04-15 11:53:58,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {291385#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 85: Hoare triple {291385#false} ~skip~0 := 0; {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {291385#false} assume !false; {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {291385#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); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {291385#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {291385#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 90: Hoare triple {291385#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 91: Hoare triple {291385#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 92: Hoare triple {291385#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 93: Hoare triple {291385#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 94: Hoare triple {291385#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 95: Hoare triple {291385#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {291385#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {291385#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 98: Hoare triple {291385#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,662 INFO L290 TraceCheckUtils]: 99: Hoare triple {291385#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 100: Hoare triple {291385#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 101: Hoare triple {291385#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 102: Hoare triple {291385#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 103: Hoare triple {291385#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 104: Hoare triple {291385#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 105: Hoare triple {291385#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 106: Hoare triple {291385#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 107: Hoare triple {291385#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 108: Hoare triple {291385#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 109: Hoare triple {291385#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 110: Hoare triple {291385#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 111: Hoare triple {291385#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 112: Hoare triple {291385#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,663 INFO L290 TraceCheckUtils]: 113: Hoare triple {291385#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 114: Hoare triple {291385#false} assume 8608 == #t~mem73;havoc #t~mem73; {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 115: Hoare triple {291385#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 116: Hoare triple {291385#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 117: Hoare triple {291385#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); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 118: Hoare triple {291385#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); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 119: Hoare triple {291385#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 120: Hoare triple {291385#false} ~skip~0 := 0; {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 121: Hoare triple {291385#false} assume !false; {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 122: Hoare triple {291385#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); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 123: Hoare triple {291385#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 124: Hoare triple {291385#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 125: Hoare triple {291385#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 126: Hoare triple {291385#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,664 INFO L290 TraceCheckUtils]: 127: Hoare triple {291385#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 128: Hoare triple {291385#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 129: Hoare triple {291385#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 130: Hoare triple {291385#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 131: Hoare triple {291385#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 132: Hoare triple {291385#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 133: Hoare triple {291385#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 134: Hoare triple {291385#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 135: Hoare triple {291385#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 136: Hoare triple {291385#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 137: Hoare triple {291385#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 138: Hoare triple {291385#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 139: Hoare triple {291385#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 140: Hoare triple {291385#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,665 INFO L290 TraceCheckUtils]: 141: Hoare triple {291385#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 142: Hoare triple {291385#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 143: Hoare triple {291385#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 144: Hoare triple {291385#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 145: Hoare triple {291385#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 146: Hoare triple {291385#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 147: Hoare triple {291385#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 148: Hoare triple {291385#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 149: Hoare triple {291385#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 150: Hoare triple {291385#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 151: Hoare triple {291385#false} assume 8640 == #t~mem75;havoc #t~mem75; {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 152: Hoare triple {291385#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 153: Hoare triple {291385#false} assume !(9 == ~blastFlag~0); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 154: Hoare triple {291385#false} assume !(12 == ~blastFlag~0); {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 155: Hoare triple {291385#false} assume 15 == ~blastFlag~0; {291385#false} is VALID [2022-04-15 11:53:58,666 INFO L290 TraceCheckUtils]: 156: Hoare triple {291385#false} assume !false; {291385#false} is VALID [2022-04-15 11:53:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:53:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:53:58,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578690720] [2022-04-15 11:53:58,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578690720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:58,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:58,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:58,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:53:58,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1023844384] [2022-04-15 11:53:58,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1023844384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:53:58,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:53:58,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:53:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831562235] [2022-04-15 11:53:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:53:58,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 11:53:58,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:53:58,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:53:58,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:53:58,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:53:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:53:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:53:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:53:58,742 INFO L87 Difference]: Start difference. First operand 1468 states and 2179 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:10,344 INFO L93 Difference]: Finished difference Result 3233 states and 4777 transitions. [2022-04-15 11:54:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:54:10,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 157 [2022-04-15 11:54:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:54:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-15 11:54:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2022-04-15 11:54:10,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 605 transitions. [2022-04-15 11:54:10,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 605 edges. 605 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:10,983 INFO L225 Difference]: With dead ends: 3233 [2022-04-15 11:54:10,983 INFO L226 Difference]: Without dead ends: 1791 [2022-04-15 11:54:10,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:54:10,985 INFO L913 BasicCegarLoop]: 141 mSDtfsCounter, 120 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:54:10,986 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 402 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 11:54:10,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2022-04-15 11:54:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1573. [2022-04-15 11:54:11,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:54:11,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1791 states. Second operand has 1573 states, 1568 states have (on average 1.4808673469387754) internal successors, (2322), 1568 states have internal predecessors, (2322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:11,223 INFO L74 IsIncluded]: Start isIncluded. First operand 1791 states. Second operand has 1573 states, 1568 states have (on average 1.4808673469387754) internal successors, (2322), 1568 states have internal predecessors, (2322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:11,224 INFO L87 Difference]: Start difference. First operand 1791 states. Second operand has 1573 states, 1568 states have (on average 1.4808673469387754) internal successors, (2322), 1568 states have internal predecessors, (2322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:11,385 INFO L93 Difference]: Finished difference Result 1791 states and 2617 transitions. [2022-04-15 11:54:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2617 transitions. [2022-04-15 11:54:11,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:11,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:11,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 1573 states, 1568 states have (on average 1.4808673469387754) internal successors, (2322), 1568 states have internal predecessors, (2322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1791 states. [2022-04-15 11:54:11,390 INFO L87 Difference]: Start difference. First operand has 1573 states, 1568 states have (on average 1.4808673469387754) internal successors, (2322), 1568 states have internal predecessors, (2322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1791 states. [2022-04-15 11:54:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:11,520 INFO L93 Difference]: Finished difference Result 1791 states and 2617 transitions. [2022-04-15 11:54:11,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2617 transitions. [2022-04-15 11:54:11,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:11,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:11,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:54:11,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:54:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1568 states have (on average 1.4808673469387754) internal successors, (2322), 1568 states have internal predecessors, (2322), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2326 transitions. [2022-04-15 11:54:11,644 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2326 transitions. Word has length 157 [2022-04-15 11:54:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:54:11,644 INFO L478 AbstractCegarLoop]: Abstraction has 1573 states and 2326 transitions. [2022-04-15 11:54:11,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:11,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1573 states and 2326 transitions. [2022-04-15 11:54:15,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2326 edges. 2326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2326 transitions. [2022-04-15 11:54:15,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-15 11:54:15,674 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:54:15,674 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:54:15,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 11:54:15,675 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:54:15,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:54:15,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1620380421, now seen corresponding path program 1 times [2022-04-15 11:54:15,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:15,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945809622] [2022-04-15 11:54:15,765 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:54:15,765 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:54:15,765 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:54:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1620380421, now seen corresponding path program 2 times [2022-04-15 11:54:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:54:15,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136761547] [2022-04-15 11:54:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:54:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:54:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:15,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:54:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:15,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {304597#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {304590#true} is VALID [2022-04-15 11:54:15,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {304590#true} assume true; {304590#true} is VALID [2022-04-15 11:54:15,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {304590#true} {304590#true} #725#return; {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {304590#true} call ULTIMATE.init(); {304597#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:54:15,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {304597#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {304590#true} assume true; {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {304590#true} {304590#true} #725#return; {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {304590#true} call #t~ret161 := main(); {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {304590#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; {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {304590#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L272 TraceCheckUtils]: 7: Hoare triple {304590#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {304590#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); {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {304590#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; {304590#true} is VALID [2022-04-15 11:54:15,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {304590#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; {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {304590#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {304590#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {304590#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {304590#true} assume !false; {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {304590#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {304590#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {304590#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {304590#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {304590#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {304590#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {304590#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {304590#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {304590#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {304590#true} assume 8464 == #t~mem55;havoc #t~mem55; {304590#true} is VALID [2022-04-15 11:54:15,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {304590#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; {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {304590#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {304590#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); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {304590#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); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {304590#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {304590#true} ~skip~0 := 0; {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {304590#true} assume !false; {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {304590#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {304590#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {304590#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {304590#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {304590#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {304590#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {304590#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {304590#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {304590#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {304590#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {304590#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {304590#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,902 INFO L290 TraceCheckUtils]: 44: Hoare triple {304590#true} assume 8496 == #t~mem58;havoc #t~mem58; {304590#true} is VALID [2022-04-15 11:54:15,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {304590#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {304590#true} is VALID [2022-04-15 11:54:15,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {304590#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {304590#true} is VALID [2022-04-15 11:54:15,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {304590#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {304590#true} is VALID [2022-04-15 11:54:15,903 INFO L290 TraceCheckUtils]: 48: Hoare triple {304590#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,903 INFO L290 TraceCheckUtils]: 49: Hoare triple {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,904 INFO L290 TraceCheckUtils]: 50: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {304595#(= 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; {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,906 INFO L290 TraceCheckUtils]: 57: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,906 INFO L290 TraceCheckUtils]: 58: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,908 INFO L290 TraceCheckUtils]: 62: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,908 INFO L290 TraceCheckUtils]: 63: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,909 INFO L290 TraceCheckUtils]: 67: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,910 INFO L290 TraceCheckUtils]: 69: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,910 INFO L290 TraceCheckUtils]: 70: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,911 INFO L290 TraceCheckUtils]: 72: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,912 INFO L290 TraceCheckUtils]: 76: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,912 INFO L290 TraceCheckUtils]: 77: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {304595#(= 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); {304595#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:54:15,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {304595#(= 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); {304596#(= |ssl3_accept_#t~mem72| 8656)} is VALID [2022-04-15 11:54:15,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {304596#(= |ssl3_accept_#t~mem72| 8656)} assume 8593 == #t~mem72;havoc #t~mem72; {304591#false} is VALID [2022-04-15 11:54:15,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {304591#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {304591#false} is VALID [2022-04-15 11:54:15,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {304591#false} assume !(7 == ~blastFlag~0); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 83: Hoare triple {304591#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 84: Hoare triple {304591#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); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 85: Hoare triple {304591#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 86: Hoare triple {304591#false} ~skip~0 := 0; {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 87: Hoare triple {304591#false} assume !false; {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 88: Hoare triple {304591#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); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {304591#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 90: Hoare triple {304591#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 91: Hoare triple {304591#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 92: Hoare triple {304591#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 93: Hoare triple {304591#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 94: Hoare triple {304591#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {304591#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 96: Hoare triple {304591#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,914 INFO L290 TraceCheckUtils]: 97: Hoare triple {304591#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 98: Hoare triple {304591#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 99: Hoare triple {304591#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 100: Hoare triple {304591#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 101: Hoare triple {304591#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {304591#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 103: Hoare triple {304591#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 104: Hoare triple {304591#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 105: Hoare triple {304591#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 106: Hoare triple {304591#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 107: Hoare triple {304591#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 108: Hoare triple {304591#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 109: Hoare triple {304591#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 110: Hoare triple {304591#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 111: Hoare triple {304591#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,915 INFO L290 TraceCheckUtils]: 112: Hoare triple {304591#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 113: Hoare triple {304591#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 114: Hoare triple {304591#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 115: Hoare triple {304591#false} assume 8608 == #t~mem73;havoc #t~mem73; {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 116: Hoare triple {304591#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 117: Hoare triple {304591#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 118: Hoare triple {304591#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); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 119: Hoare triple {304591#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); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 120: Hoare triple {304591#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 121: Hoare triple {304591#false} ~skip~0 := 0; {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 122: Hoare triple {304591#false} assume !false; {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 123: Hoare triple {304591#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); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 124: Hoare triple {304591#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 125: Hoare triple {304591#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,916 INFO L290 TraceCheckUtils]: 126: Hoare triple {304591#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 127: Hoare triple {304591#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 128: Hoare triple {304591#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 129: Hoare triple {304591#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 130: Hoare triple {304591#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 131: Hoare triple {304591#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 132: Hoare triple {304591#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 133: Hoare triple {304591#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 134: Hoare triple {304591#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 135: Hoare triple {304591#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 136: Hoare triple {304591#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 137: Hoare triple {304591#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 138: Hoare triple {304591#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 139: Hoare triple {304591#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 140: Hoare triple {304591#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,917 INFO L290 TraceCheckUtils]: 141: Hoare triple {304591#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 142: Hoare triple {304591#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 143: Hoare triple {304591#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 144: Hoare triple {304591#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 145: Hoare triple {304591#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 146: Hoare triple {304591#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 147: Hoare triple {304591#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 148: Hoare triple {304591#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 149: Hoare triple {304591#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 150: Hoare triple {304591#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 151: Hoare triple {304591#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 152: Hoare triple {304591#false} assume 8640 == #t~mem75;havoc #t~mem75; {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 153: Hoare triple {304591#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 154: Hoare triple {304591#false} assume !(9 == ~blastFlag~0); {304591#false} is VALID [2022-04-15 11:54:15,918 INFO L290 TraceCheckUtils]: 155: Hoare triple {304591#false} assume !(12 == ~blastFlag~0); {304591#false} is VALID [2022-04-15 11:54:15,919 INFO L290 TraceCheckUtils]: 156: Hoare triple {304591#false} assume 15 == ~blastFlag~0; {304591#false} is VALID [2022-04-15 11:54:15,919 INFO L290 TraceCheckUtils]: 157: Hoare triple {304591#false} assume !false; {304591#false} is VALID [2022-04-15 11:54:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-15 11:54:15,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:54:15,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136761547] [2022-04-15 11:54:15,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136761547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:15,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:15,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:15,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:54:15,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945809622] [2022-04-15 11:54:15,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945809622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:15,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44592055] [2022-04-15 11:54:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:54:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-04-15 11:54:15,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:54:15,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:15,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:15,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:54:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:15,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:54:15,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:54:15,992 INFO L87 Difference]: Start difference. First operand 1573 states and 2326 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:19,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:54:23,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:54:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:27,833 INFO L93 Difference]: Finished difference Result 3182 states and 4700 transitions. [2022-04-15 11:54:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:54:27,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-04-15 11:54:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:54:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-04-15 11:54:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-04-15 11:54:27,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 527 transitions. [2022-04-15 11:54:28,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 527 edges. 527 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:28,291 INFO L225 Difference]: With dead ends: 3182 [2022-04-15 11:54:28,291 INFO L226 Difference]: Without dead ends: 1635 [2022-04-15 11:54:28,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:54:28,293 INFO L913 BasicCegarLoop]: 259 mSDtfsCounter, 47 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:54:28,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 643 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 11:54:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2022-04-15 11:54:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1573. [2022-04-15 11:54:28,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:54:28,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1635 states. Second operand has 1573 states, 1568 states have (on average 1.478954081632653) internal successors, (2319), 1568 states have internal predecessors, (2319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,474 INFO L74 IsIncluded]: Start isIncluded. First operand 1635 states. Second operand has 1573 states, 1568 states have (on average 1.478954081632653) internal successors, (2319), 1568 states have internal predecessors, (2319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,475 INFO L87 Difference]: Start difference. First operand 1635 states. Second operand has 1573 states, 1568 states have (on average 1.478954081632653) internal successors, (2319), 1568 states have internal predecessors, (2319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:28,569 INFO L93 Difference]: Finished difference Result 1635 states and 2402 transitions. [2022-04-15 11:54:28,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2402 transitions. [2022-04-15 11:54:28,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:28,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:28,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 1573 states, 1568 states have (on average 1.478954081632653) internal successors, (2319), 1568 states have internal predecessors, (2319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1635 states. [2022-04-15 11:54:28,572 INFO L87 Difference]: Start difference. First operand has 1573 states, 1568 states have (on average 1.478954081632653) internal successors, (2319), 1568 states have internal predecessors, (2319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1635 states. [2022-04-15 11:54:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:28,662 INFO L93 Difference]: Finished difference Result 1635 states and 2402 transitions. [2022-04-15 11:54:28,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2402 transitions. [2022-04-15 11:54:28,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:28,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:28,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:54:28,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:54:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1568 states have (on average 1.478954081632653) internal successors, (2319), 1568 states have internal predecessors, (2319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2323 transitions. [2022-04-15 11:54:28,800 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2323 transitions. Word has length 158 [2022-04-15 11:54:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:54:28,800 INFO L478 AbstractCegarLoop]: Abstraction has 1573 states and 2323 transitions. [2022-04-15 11:54:28,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:28,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1573 states and 2323 transitions. [2022-04-15 11:54:33,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2323 edges. 2323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2323 transitions. [2022-04-15 11:54:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-15 11:54:33,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:54:33,057 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:54:33,057 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 11:54:33,057 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:54:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:54:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 543236153, now seen corresponding path program 1 times [2022-04-15 11:54:33,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:33,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1659193075] [2022-04-15 11:54:33,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:54:33,146 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:54:33,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:54:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash 543236153, now seen corresponding path program 2 times [2022-04-15 11:54:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:54:33,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416479459] [2022-04-15 11:54:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:54:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:54:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:33,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:54:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:33,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {317389#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {317382#true} is VALID [2022-04-15 11:54:33,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {317382#true} assume true; {317382#true} is VALID [2022-04-15 11:54:33,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {317382#true} {317382#true} #725#return; {317382#true} is VALID [2022-04-15 11:54:33,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {317382#true} call ULTIMATE.init(); {317389#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:54:33,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {317389#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {317382#true} is VALID [2022-04-15 11:54:33,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {317382#true} assume true; {317382#true} is VALID [2022-04-15 11:54:33,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {317382#true} {317382#true} #725#return; {317382#true} is VALID [2022-04-15 11:54:33,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {317382#true} call #t~ret161 := main(); {317382#true} is VALID [2022-04-15 11:54:33,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {317382#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; {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {317382#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L272 TraceCheckUtils]: 7: Hoare triple {317382#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {317382#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); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {317382#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; {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {317382#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; {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {317382#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {317382#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {317382#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {317382#true} assume !false; {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {317382#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {317382#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {317382#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {317382#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {317382#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {317382#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {317382#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {317382#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {317382#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {317382#true} assume 8464 == #t~mem55;havoc #t~mem55; {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {317382#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; {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {317382#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {317382#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); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {317382#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); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {317382#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {317382#true} ~skip~0 := 0; {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {317382#true} assume !false; {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {317382#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {317382#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {317382#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {317382#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {317382#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {317382#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {317382#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {317382#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 40: Hoare triple {317382#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 41: Hoare triple {317382#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 42: Hoare triple {317382#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 43: Hoare triple {317382#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 44: Hoare triple {317382#true} assume 8496 == #t~mem58;havoc #t~mem58; {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {317382#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {317382#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {317382#true} is VALID [2022-04-15 11:54:33,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {317382#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {317382#true} is VALID [2022-04-15 11:54:33,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {317382#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {317387#(= (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; {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,310 INFO L290 TraceCheckUtils]: 52: Hoare triple {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,310 INFO L290 TraceCheckUtils]: 53: Hoare triple {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,310 INFO L290 TraceCheckUtils]: 54: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,311 INFO L290 TraceCheckUtils]: 55: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,311 INFO L290 TraceCheckUtils]: 56: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,311 INFO L290 TraceCheckUtils]: 57: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,312 INFO L290 TraceCheckUtils]: 58: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,312 INFO L290 TraceCheckUtils]: 59: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,312 INFO L290 TraceCheckUtils]: 60: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,313 INFO L290 TraceCheckUtils]: 61: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,313 INFO L290 TraceCheckUtils]: 62: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,313 INFO L290 TraceCheckUtils]: 63: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 66: Hoare triple {317387#(= (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); {317387#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 67: Hoare triple {317387#(= (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); {317388#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 68: Hoare triple {317388#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {317383#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 70: Hoare triple {317383#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {317383#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {317383#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {317383#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {317383#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {317383#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {317383#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 77: Hoare triple {317383#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 78: Hoare triple {317383#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 79: Hoare triple {317383#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 80: Hoare triple {317383#false} assume 8593 == #t~mem72;havoc #t~mem72; {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 81: Hoare triple {317383#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 82: Hoare triple {317383#false} assume !(7 == ~blastFlag~0); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 83: Hoare triple {317383#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 84: Hoare triple {317383#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); {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {317383#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 86: Hoare triple {317383#false} ~skip~0 := 0; {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {317383#false} assume !false; {317383#false} is VALID [2022-04-15 11:54:33,316 INFO L290 TraceCheckUtils]: 88: Hoare triple {317383#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); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {317383#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {317383#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 91: Hoare triple {317383#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 92: Hoare triple {317383#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 93: Hoare triple {317383#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 94: Hoare triple {317383#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 95: Hoare triple {317383#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 96: Hoare triple {317383#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 97: Hoare triple {317383#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 98: Hoare triple {317383#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 99: Hoare triple {317383#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 100: Hoare triple {317383#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 101: Hoare triple {317383#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 102: Hoare triple {317383#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,317 INFO L290 TraceCheckUtils]: 103: Hoare triple {317383#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 104: Hoare triple {317383#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 105: Hoare triple {317383#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 106: Hoare triple {317383#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 107: Hoare triple {317383#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 108: Hoare triple {317383#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 109: Hoare triple {317383#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 110: Hoare triple {317383#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 111: Hoare triple {317383#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 112: Hoare triple {317383#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 113: Hoare triple {317383#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 114: Hoare triple {317383#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 115: Hoare triple {317383#false} assume 8608 == #t~mem73;havoc #t~mem73; {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 116: Hoare triple {317383#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 117: Hoare triple {317383#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {317383#false} is VALID [2022-04-15 11:54:33,318 INFO L290 TraceCheckUtils]: 118: Hoare triple {317383#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); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 119: Hoare triple {317383#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); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 120: Hoare triple {317383#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 121: Hoare triple {317383#false} ~skip~0 := 0; {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 122: Hoare triple {317383#false} assume !false; {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 123: Hoare triple {317383#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); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 124: Hoare triple {317383#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 125: Hoare triple {317383#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 126: Hoare triple {317383#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 127: Hoare triple {317383#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 128: Hoare triple {317383#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 129: Hoare triple {317383#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 130: Hoare triple {317383#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 131: Hoare triple {317383#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 132: Hoare triple {317383#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,319 INFO L290 TraceCheckUtils]: 133: Hoare triple {317383#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 134: Hoare triple {317383#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 135: Hoare triple {317383#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 136: Hoare triple {317383#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 137: Hoare triple {317383#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 138: Hoare triple {317383#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 139: Hoare triple {317383#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 140: Hoare triple {317383#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 141: Hoare triple {317383#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 142: Hoare triple {317383#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 143: Hoare triple {317383#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 144: Hoare triple {317383#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 145: Hoare triple {317383#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 146: Hoare triple {317383#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 147: Hoare triple {317383#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,320 INFO L290 TraceCheckUtils]: 148: Hoare triple {317383#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 149: Hoare triple {317383#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 150: Hoare triple {317383#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 151: Hoare triple {317383#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 152: Hoare triple {317383#false} assume 8640 == #t~mem75;havoc #t~mem75; {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 153: Hoare triple {317383#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 154: Hoare triple {317383#false} assume !(9 == ~blastFlag~0); {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 155: Hoare triple {317383#false} assume !(12 == ~blastFlag~0); {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 156: Hoare triple {317383#false} assume 15 == ~blastFlag~0; {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L290 TraceCheckUtils]: 157: Hoare triple {317383#false} assume !false; {317383#false} is VALID [2022-04-15 11:54:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-15 11:54:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:54:33,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416479459] [2022-04-15 11:54:33,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416479459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:33,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:33,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:33,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:54:33,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1659193075] [2022-04-15 11:54:33,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1659193075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:33,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:33,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:33,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322679015] [2022-04-15 11:54:33,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:54:33,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-04-15 11:54:33,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:54:33,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:33,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:33,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:54:33,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:33,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:54:33,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:54:33,392 INFO L87 Difference]: Start difference. First operand 1573 states and 2323 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:36,439 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:54:39,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:54:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:42,625 INFO L93 Difference]: Finished difference Result 3227 states and 4767 transitions. [2022-04-15 11:54:42,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:54:42,625 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-04-15 11:54:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:54:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-15 11:54:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 490 transitions. [2022-04-15 11:54:42,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 490 transitions. [2022-04-15 11:54:42,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-15 11:54:43,039 INFO L225 Difference]: With dead ends: 3227 [2022-04-15 11:54:43,039 INFO L226 Difference]: Without dead ends: 1680 [2022-04-15 11:54:43,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:54:43,041 INFO L913 BasicCegarLoop]: 250 mSDtfsCounter, 28 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:54:43,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 625 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 11:54:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2022-04-15 11:54:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1645. [2022-04-15 11:54:43,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:54:43,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1680 states. Second operand has 1645 states, 1640 states have (on average 1.4780487804878049) internal successors, (2424), 1640 states have internal predecessors, (2424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:43,226 INFO L74 IsIncluded]: Start isIncluded. First operand 1680 states. Second operand has 1645 states, 1640 states have (on average 1.4780487804878049) internal successors, (2424), 1640 states have internal predecessors, (2424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:43,227 INFO L87 Difference]: Start difference. First operand 1680 states. Second operand has 1645 states, 1640 states have (on average 1.4780487804878049) internal successors, (2424), 1640 states have internal predecessors, (2424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:43,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:43,324 INFO L93 Difference]: Finished difference Result 1680 states and 2472 transitions. [2022-04-15 11:54:43,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2472 transitions. [2022-04-15 11:54:43,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:43,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:43,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 1645 states, 1640 states have (on average 1.4780487804878049) internal successors, (2424), 1640 states have internal predecessors, (2424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1680 states. [2022-04-15 11:54:43,328 INFO L87 Difference]: Start difference. First operand has 1645 states, 1640 states have (on average 1.4780487804878049) internal successors, (2424), 1640 states have internal predecessors, (2424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1680 states. [2022-04-15 11:54:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:43,415 INFO L93 Difference]: Finished difference Result 1680 states and 2472 transitions. [2022-04-15 11:54:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2472 transitions. [2022-04-15 11:54:43,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:43,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:43,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:54:43,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:54:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1640 states have (on average 1.4780487804878049) internal successors, (2424), 1640 states have internal predecessors, (2424), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2428 transitions. [2022-04-15 11:54:43,569 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2428 transitions. Word has length 158 [2022-04-15 11:54:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:54:43,569 INFO L478 AbstractCegarLoop]: Abstraction has 1645 states and 2428 transitions. [2022-04-15 11:54:43,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:43,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1645 states and 2428 transitions. [2022-04-15 11:54:48,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2428 edges. 2428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2428 transitions. [2022-04-15 11:54:48,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-04-15 11:54:48,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:54:48,379 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:54:48,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 11:54:48,380 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:54:48,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:54:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash 789410257, now seen corresponding path program 1 times [2022-04-15 11:54:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:48,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [775557873] [2022-04-15 11:54:48,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:54:48,471 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:54:48,471 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:54:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash 789410257, now seen corresponding path program 2 times [2022-04-15 11:54:48,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:54:48,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749746327] [2022-04-15 11:54:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:54:48,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:54:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:54:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:48,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {330505#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {330498#true} is VALID [2022-04-15 11:54:48,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {330498#true} assume true; {330498#true} is VALID [2022-04-15 11:54:48,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {330498#true} {330498#true} #725#return; {330498#true} is VALID [2022-04-15 11:54:48,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {330498#true} call ULTIMATE.init(); {330505#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:54:48,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {330505#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {330498#true} is VALID [2022-04-15 11:54:48,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {330498#true} assume true; {330498#true} is VALID [2022-04-15 11:54:48,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330498#true} {330498#true} #725#return; {330498#true} is VALID [2022-04-15 11:54:48,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {330498#true} call #t~ret161 := main(); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {330498#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; {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {330498#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L272 TraceCheckUtils]: 7: Hoare triple {330498#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {330498#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); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {330498#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; {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {330498#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; {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {330498#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {330498#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {330498#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {330498#true} assume !false; {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {330498#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {330498#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {330498#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {330498#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {330498#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {330498#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {330498#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {330498#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {330498#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {330498#true} assume 8464 == #t~mem55;havoc #t~mem55; {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {330498#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; {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {330498#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {330498#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); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {330498#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); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {330498#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {330498#true} ~skip~0 := 0; {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {330498#true} assume !false; {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {330498#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,615 INFO L290 TraceCheckUtils]: 33: Hoare triple {330498#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 34: Hoare triple {330498#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 35: Hoare triple {330498#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 36: Hoare triple {330498#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {330498#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {330498#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {330498#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {330498#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {330498#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {330498#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {330498#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {330498#true} assume 8496 == #t~mem58;havoc #t~mem58; {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {330498#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {330498#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {330498#true} is VALID [2022-04-15 11:54:48,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {330498#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {330498#true} is VALID [2022-04-15 11:54:48,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {330498#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,618 INFO L290 TraceCheckUtils]: 50: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,620 INFO L290 TraceCheckUtils]: 54: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,621 INFO L290 TraceCheckUtils]: 59: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:54:48,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {330503#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {330504#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-15 11:54:48,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {330504#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 63: Hoare triple {330499#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {330499#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); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {330499#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {330499#false} ~skip~0 := 0; {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 67: Hoare triple {330499#false} assume !false; {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {330499#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); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {330499#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {330499#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 71: Hoare triple {330499#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 72: Hoare triple {330499#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 73: Hoare triple {330499#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 74: Hoare triple {330499#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {330499#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,623 INFO L290 TraceCheckUtils]: 76: Hoare triple {330499#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 77: Hoare triple {330499#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 78: Hoare triple {330499#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 79: Hoare triple {330499#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 80: Hoare triple {330499#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {330499#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 82: Hoare triple {330499#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 83: Hoare triple {330499#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 84: Hoare triple {330499#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 85: Hoare triple {330499#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 86: Hoare triple {330499#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 87: Hoare triple {330499#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {330499#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {330499#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 90: Hoare triple {330499#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,624 INFO L290 TraceCheckUtils]: 91: Hoare triple {330499#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 92: Hoare triple {330499#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 93: Hoare triple {330499#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 94: Hoare triple {330499#false} assume 8593 == #t~mem72;havoc #t~mem72; {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 95: Hoare triple {330499#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {330499#false} assume !(7 == ~blastFlag~0); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 97: Hoare triple {330499#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 98: Hoare triple {330499#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); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 99: Hoare triple {330499#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 100: Hoare triple {330499#false} ~skip~0 := 0; {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 101: Hoare triple {330499#false} assume !false; {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 102: Hoare triple {330499#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); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 103: Hoare triple {330499#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 104: Hoare triple {330499#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,625 INFO L290 TraceCheckUtils]: 105: Hoare triple {330499#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 106: Hoare triple {330499#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 107: Hoare triple {330499#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 108: Hoare triple {330499#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 109: Hoare triple {330499#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 110: Hoare triple {330499#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 111: Hoare triple {330499#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 112: Hoare triple {330499#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 113: Hoare triple {330499#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 114: Hoare triple {330499#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 115: Hoare triple {330499#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 116: Hoare triple {330499#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 117: Hoare triple {330499#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 118: Hoare triple {330499#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 119: Hoare triple {330499#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,626 INFO L290 TraceCheckUtils]: 120: Hoare triple {330499#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 121: Hoare triple {330499#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 122: Hoare triple {330499#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 123: Hoare triple {330499#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 124: Hoare triple {330499#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 125: Hoare triple {330499#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 126: Hoare triple {330499#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 127: Hoare triple {330499#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 128: Hoare triple {330499#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 129: Hoare triple {330499#false} assume 8608 == #t~mem73;havoc #t~mem73; {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 130: Hoare triple {330499#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 131: Hoare triple {330499#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 132: Hoare triple {330499#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); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 133: Hoare triple {330499#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); {330499#false} is VALID [2022-04-15 11:54:48,627 INFO L290 TraceCheckUtils]: 134: Hoare triple {330499#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 135: Hoare triple {330499#false} ~skip~0 := 0; {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 136: Hoare triple {330499#false} assume !false; {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 137: Hoare triple {330499#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); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 138: Hoare triple {330499#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 139: Hoare triple {330499#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 140: Hoare triple {330499#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 141: Hoare triple {330499#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 142: Hoare triple {330499#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 143: Hoare triple {330499#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 144: Hoare triple {330499#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 145: Hoare triple {330499#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 146: Hoare triple {330499#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 147: Hoare triple {330499#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,628 INFO L290 TraceCheckUtils]: 148: Hoare triple {330499#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 149: Hoare triple {330499#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 150: Hoare triple {330499#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 151: Hoare triple {330499#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 152: Hoare triple {330499#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 153: Hoare triple {330499#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 154: Hoare triple {330499#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 155: Hoare triple {330499#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 156: Hoare triple {330499#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 157: Hoare triple {330499#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 158: Hoare triple {330499#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 159: Hoare triple {330499#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 160: Hoare triple {330499#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 161: Hoare triple {330499#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 162: Hoare triple {330499#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,629 INFO L290 TraceCheckUtils]: 163: Hoare triple {330499#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 164: Hoare triple {330499#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 165: Hoare triple {330499#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 166: Hoare triple {330499#false} assume 8640 == #t~mem75;havoc #t~mem75; {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 167: Hoare triple {330499#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 168: Hoare triple {330499#false} assume !(9 == ~blastFlag~0); {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 169: Hoare triple {330499#false} assume !(12 == ~blastFlag~0); {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 170: Hoare triple {330499#false} assume 15 == ~blastFlag~0; {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L290 TraceCheckUtils]: 171: Hoare triple {330499#false} assume !false; {330499#false} is VALID [2022-04-15 11:54:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-15 11:54:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:54:48,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749746327] [2022-04-15 11:54:48,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749746327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:48,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:48,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:48,631 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:54:48,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [775557873] [2022-04-15 11:54:48,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [775557873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:48,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:48,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:54:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209350290] [2022-04-15 11:54:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:54:48,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2022-04-15 11:54:48,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:54:48,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:48,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:48,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:54:48,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:54:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:54:48,705 INFO L87 Difference]: Start difference. First operand 1645 states and 2428 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:51,573 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-15 11:54:54,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:54:55,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:54:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:57,957 INFO L93 Difference]: Finished difference Result 2281 states and 3372 transitions. [2022-04-15 11:54:57,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:54:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2022-04-15 11:54:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:54:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-15 11:54:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-04-15 11:54:57,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 604 transitions. [2022-04-15 11:54:58,339 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-15 11:54:58,356 INFO L225 Difference]: With dead ends: 2281 [2022-04-15 11:54:58,356 INFO L226 Difference]: Without dead ends: 662 [2022-04-15 11:54:58,358 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:54:58,358 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 137 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:54:58,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 404 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 11:54:58,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-04-15 11:54:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 594. [2022-04-15 11:54:58,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:54:58,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 662 states. Second operand has 594 states, 589 states have (on average 1.4601018675721562) internal successors, (860), 589 states have internal predecessors, (860), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:58,403 INFO L74 IsIncluded]: Start isIncluded. First operand 662 states. Second operand has 594 states, 589 states have (on average 1.4601018675721562) internal successors, (860), 589 states have internal predecessors, (860), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:58,403 INFO L87 Difference]: Start difference. First operand 662 states. Second operand has 594 states, 589 states have (on average 1.4601018675721562) internal successors, (860), 589 states have internal predecessors, (860), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:58,417 INFO L93 Difference]: Finished difference Result 662 states and 963 transitions. [2022-04-15 11:54:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 963 transitions. [2022-04-15 11:54:58,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:58,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:58,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 594 states, 589 states have (on average 1.4601018675721562) internal successors, (860), 589 states have internal predecessors, (860), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 662 states. [2022-04-15 11:54:58,418 INFO L87 Difference]: Start difference. First operand has 594 states, 589 states have (on average 1.4601018675721562) internal successors, (860), 589 states have internal predecessors, (860), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 662 states. [2022-04-15 11:54:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:54:58,431 INFO L93 Difference]: Finished difference Result 662 states and 963 transitions. [2022-04-15 11:54:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 963 transitions. [2022-04-15 11:54:58,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:54:58,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:54:58,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:54:58,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:54:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 589 states have (on average 1.4601018675721562) internal successors, (860), 589 states have internal predecessors, (860), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 864 transitions. [2022-04-15 11:54:58,448 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 864 transitions. Word has length 172 [2022-04-15 11:54:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:54:58,448 INFO L478 AbstractCegarLoop]: Abstraction has 594 states and 864 transitions. [2022-04-15 11:54:58,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:58,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 594 states and 864 transitions. [2022-04-15 11:54:59,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 864 edges. 864 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 864 transitions. [2022-04-15 11:54:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-15 11:54:59,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:54:59,386 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:54:59,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 11:54:59,386 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:54:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:54:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 873965953, now seen corresponding path program 1 times [2022-04-15 11:54:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:59,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537848339] [2022-04-15 11:54:59,481 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:54:59,481 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:54:59,481 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:54:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 873965953, now seen corresponding path program 2 times [2022-04-15 11:54:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:54:59,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858925751] [2022-04-15 11:54:59,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:54:59,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:54:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:54:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:54:59,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {337590#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {337584#true} is VALID [2022-04-15 11:54:59,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {337584#true} assume true; {337584#true} is VALID [2022-04-15 11:54:59,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {337584#true} {337584#true} #725#return; {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {337584#true} call ULTIMATE.init(); {337590#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {337590#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {337584#true} assume true; {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {337584#true} {337584#true} #725#return; {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {337584#true} call #t~ret161 := main(); {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {337584#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; {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {337584#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L272 TraceCheckUtils]: 7: Hoare triple {337584#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {337584#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); {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {337584#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; {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {337584#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; {337584#true} is VALID [2022-04-15 11:54:59,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {337584#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {337584#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {337584#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {337584#true} assume !false; {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {337584#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {337584#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {337584#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {337584#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {337584#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {337584#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {337584#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {337584#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {337584#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {337584#true} assume 8464 == #t~mem55;havoc #t~mem55; {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 25: Hoare triple {337584#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; {337584#true} is VALID [2022-04-15 11:54:59,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {337584#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {337584#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); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {337584#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); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {337584#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 30: Hoare triple {337584#true} ~skip~0 := 0; {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {337584#true} assume !false; {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {337584#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {337584#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {337584#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 35: Hoare triple {337584#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 36: Hoare triple {337584#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {337584#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {337584#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {337584#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {337584#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {337584#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,590 INFO L290 TraceCheckUtils]: 42: Hoare triple {337584#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,590 INFO L290 TraceCheckUtils]: 43: Hoare triple {337584#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {337584#true} is VALID [2022-04-15 11:54:59,590 INFO L290 TraceCheckUtils]: 44: Hoare triple {337584#true} assume 8496 == #t~mem58;havoc #t~mem58; {337584#true} is VALID [2022-04-15 11:54:59,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {337584#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {337584#true} is VALID [2022-04-15 11:54:59,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {337584#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,590 INFO L290 TraceCheckUtils]: 47: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,591 INFO L290 TraceCheckUtils]: 48: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,591 INFO L290 TraceCheckUtils]: 49: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {337589#(= 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); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,592 INFO L290 TraceCheckUtils]: 53: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,592 INFO L290 TraceCheckUtils]: 54: Hoare triple {337589#(= 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); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,596 INFO L290 TraceCheckUtils]: 72: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,598 INFO L290 TraceCheckUtils]: 80: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,600 INFO L290 TraceCheckUtils]: 85: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem77;havoc #t~mem77; {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,600 INFO L290 TraceCheckUtils]: 86: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,600 INFO L290 TraceCheckUtils]: 87: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {337589#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:54:59,600 INFO L290 TraceCheckUtils]: 88: Hoare triple {337589#(= 2 ssl3_accept_~blastFlag~0)} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {337585#false} is VALID [2022-04-15 11:54:59,600 INFO L290 TraceCheckUtils]: 89: Hoare triple {337585#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); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 90: Hoare triple {337585#false} assume !(0 == ~tmp___10~0); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 91: Hoare triple {337585#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); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 92: Hoare triple {337585#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 93: Hoare triple {337585#false} ~skip~0 := 0; {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 94: Hoare triple {337585#false} assume !false; {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 95: Hoare triple {337585#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); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 96: Hoare triple {337585#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 97: Hoare triple {337585#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 98: Hoare triple {337585#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 99: Hoare triple {337585#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 100: Hoare triple {337585#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 101: Hoare triple {337585#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 102: Hoare triple {337585#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 103: Hoare triple {337585#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,601 INFO L290 TraceCheckUtils]: 104: Hoare triple {337585#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 105: Hoare triple {337585#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 106: Hoare triple {337585#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 107: Hoare triple {337585#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 108: Hoare triple {337585#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 109: Hoare triple {337585#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 110: Hoare triple {337585#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 111: Hoare triple {337585#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 112: Hoare triple {337585#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 113: Hoare triple {337585#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 114: Hoare triple {337585#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 115: Hoare triple {337585#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 116: Hoare triple {337585#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 117: Hoare triple {337585#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 118: Hoare triple {337585#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,602 INFO L290 TraceCheckUtils]: 119: Hoare triple {337585#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 120: Hoare triple {337585#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 121: Hoare triple {337585#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 122: Hoare triple {337585#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 123: Hoare triple {337585#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 124: Hoare triple {337585#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 125: Hoare triple {337585#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 126: Hoare triple {337585#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 127: Hoare triple {337585#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 128: Hoare triple {337585#false} assume 8672 == #t~mem79;havoc #t~mem79; {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 129: Hoare triple {337585#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 130: Hoare triple {337585#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 131: Hoare triple {337585#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); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 132: Hoare triple {337585#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; {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 133: Hoare triple {337585#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,603 INFO L290 TraceCheckUtils]: 134: Hoare triple {337585#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); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 135: Hoare triple {337585#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 136: Hoare triple {337585#false} ~skip~0 := 0; {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 137: Hoare triple {337585#false} assume !false; {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 138: Hoare triple {337585#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); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 139: Hoare triple {337585#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 140: Hoare triple {337585#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 141: Hoare triple {337585#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 142: Hoare triple {337585#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 143: Hoare triple {337585#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 144: Hoare triple {337585#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 145: Hoare triple {337585#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 146: Hoare triple {337585#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 147: Hoare triple {337585#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 148: Hoare triple {337585#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,604 INFO L290 TraceCheckUtils]: 149: Hoare triple {337585#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 150: Hoare triple {337585#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 151: Hoare triple {337585#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 152: Hoare triple {337585#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 153: Hoare triple {337585#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 154: Hoare triple {337585#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 155: Hoare triple {337585#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 156: Hoare triple {337585#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 157: Hoare triple {337585#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 158: Hoare triple {337585#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 159: Hoare triple {337585#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 160: Hoare triple {337585#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 161: Hoare triple {337585#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 162: Hoare triple {337585#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 163: Hoare triple {337585#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,605 INFO L290 TraceCheckUtils]: 164: Hoare triple {337585#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 165: Hoare triple {337585#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 166: Hoare triple {337585#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 167: Hoare triple {337585#false} assume 8640 == #t~mem75;havoc #t~mem75; {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 168: Hoare triple {337585#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 169: Hoare triple {337585#false} assume !(9 == ~blastFlag~0); {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 170: Hoare triple {337585#false} assume !(12 == ~blastFlag~0); {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 171: Hoare triple {337585#false} assume 15 == ~blastFlag~0; {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L290 TraceCheckUtils]: 172: Hoare triple {337585#false} assume !false; {337585#false} is VALID [2022-04-15 11:54:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 11:54:59,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:54:59,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858925751] [2022-04-15 11:54:59,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858925751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:59,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:59,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:54:59,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:54:59,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537848339] [2022-04-15 11:54:59,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537848339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:54:59,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:54:59,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:54:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730783096] [2022-04-15 11:54:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:54:59,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2022-04-15 11:54:59,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:54:59,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:54:59,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:54:59,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:54:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:54:59,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:54:59,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:54:59,684 INFO L87 Difference]: Start difference. First operand 594 states and 864 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:02,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:06,681 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-15 11:55:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:08,516 INFO L93 Difference]: Finished difference Result 1723 states and 2526 transitions. [2022-04-15 11:55:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:55:08,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2022-04-15 11:55:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:08,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:55:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:55:08,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 641 transitions. [2022-04-15 11:55:08,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:09,029 INFO L225 Difference]: With dead ends: 1723 [2022-04-15 11:55:09,029 INFO L226 Difference]: Without dead ends: 1157 [2022-04-15 11:55:09,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:55:09,031 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 148 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:09,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 457 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 11:55:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-04-15 11:55:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2022-04-15 11:55:09,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:09,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1157 states. Second operand has 1157 states, 1152 states have (on average 1.453125) internal successors, (1674), 1152 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:09,146 INFO L74 IsIncluded]: Start isIncluded. First operand 1157 states. Second operand has 1157 states, 1152 states have (on average 1.453125) internal successors, (1674), 1152 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:09,147 INFO L87 Difference]: Start difference. First operand 1157 states. Second operand has 1157 states, 1152 states have (on average 1.453125) internal successors, (1674), 1152 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:09,187 INFO L93 Difference]: Finished difference Result 1157 states and 1678 transitions. [2022-04-15 11:55:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1678 transitions. [2022-04-15 11:55:09,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:09,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:09,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 1157 states, 1152 states have (on average 1.453125) internal successors, (1674), 1152 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1157 states. [2022-04-15 11:55:09,190 INFO L87 Difference]: Start difference. First operand has 1157 states, 1152 states have (on average 1.453125) internal successors, (1674), 1152 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1157 states. [2022-04-15 11:55:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:09,228 INFO L93 Difference]: Finished difference Result 1157 states and 1678 transitions. [2022-04-15 11:55:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1678 transitions. [2022-04-15 11:55:09,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:09,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:09,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:09,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1152 states have (on average 1.453125) internal successors, (1674), 1152 states have internal predecessors, (1674), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1678 transitions. [2022-04-15 11:55:09,297 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1678 transitions. Word has length 173 [2022-04-15 11:55:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:09,297 INFO L478 AbstractCegarLoop]: Abstraction has 1157 states and 1678 transitions. [2022-04-15 11:55:09,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:09,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1157 states and 1678 transitions. [2022-04-15 11:55:11,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1678 edges. 1678 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1678 transitions. [2022-04-15 11:55:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-04-15 11:55:11,096 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:11,096 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:55:11,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 11:55:11,096 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 439460355, now seen corresponding path program 1 times [2022-04-15 11:55:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:11,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964708447] [2022-04-15 11:55:11,208 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:11,209 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:11,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 439460355, now seen corresponding path program 2 times [2022-04-15 11:55:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:11,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409425075] [2022-04-15 11:55:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:11,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {345673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {345667#true} is VALID [2022-04-15 11:55:11,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {345667#true} assume true; {345667#true} is VALID [2022-04-15 11:55:11,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {345667#true} {345667#true} #725#return; {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {345667#true} call ULTIMATE.init(); {345673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:55:11,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {345673#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {345667#true} assume true; {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345667#true} {345667#true} #725#return; {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {345667#true} call #t~ret161 := main(); {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {345667#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; {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {345667#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L272 TraceCheckUtils]: 7: Hoare triple {345667#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {345667#true} is VALID [2022-04-15 11:55:11,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {345667#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); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {345667#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; {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {345667#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; {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {345667#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {345667#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {345667#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {345667#true} assume !false; {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {345667#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {345667#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {345667#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {345667#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {345667#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {345667#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {345667#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {345667#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {345667#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {345667#true} is VALID [2022-04-15 11:55:11,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {345667#true} assume 8464 == #t~mem55;havoc #t~mem55; {345667#true} is VALID [2022-04-15 11:55:11,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {345667#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; {345667#true} is VALID [2022-04-15 11:55:11,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {345667#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {345672#(= 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); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {345672#(= 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); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,345 INFO L290 TraceCheckUtils]: 30: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !false; {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {345672#(= 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); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,346 INFO L290 TraceCheckUtils]: 36: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,347 INFO L290 TraceCheckUtils]: 39: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,348 INFO L290 TraceCheckUtils]: 43: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,348 INFO L290 TraceCheckUtils]: 44: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {345672#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {345672#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {345668#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {345668#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {345668#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 51: Hoare triple {345668#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 52: Hoare triple {345668#false} ~skip~0 := 0; {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 53: Hoare triple {345668#false} assume !false; {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 54: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {345668#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {345668#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 57: Hoare triple {345668#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {345668#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {345668#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {345668#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 61: Hoare triple {345668#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 62: Hoare triple {345668#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 63: Hoare triple {345668#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {345668#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {345668#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 66: Hoare triple {345668#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 67: Hoare triple {345668#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 68: Hoare triple {345668#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,350 INFO L290 TraceCheckUtils]: 69: Hoare triple {345668#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 70: Hoare triple {345668#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 71: Hoare triple {345668#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 72: Hoare triple {345668#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 73: Hoare triple {345668#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 74: Hoare triple {345668#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 75: Hoare triple {345668#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 76: Hoare triple {345668#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 77: Hoare triple {345668#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 78: Hoare triple {345668#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 79: Hoare triple {345668#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 80: Hoare triple {345668#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 81: Hoare triple {345668#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 82: Hoare triple {345668#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,351 INFO L290 TraceCheckUtils]: 83: Hoare triple {345668#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 84: Hoare triple {345668#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 85: Hoare triple {345668#false} assume 8656 == #t~mem77;havoc #t~mem77; {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 86: Hoare triple {345668#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; {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 87: Hoare triple {345668#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 88: Hoare triple {345668#false} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 89: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 90: Hoare triple {345668#false} assume !(0 == ~tmp___10~0); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 91: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 92: Hoare triple {345668#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 93: Hoare triple {345668#false} ~skip~0 := 0; {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 94: Hoare triple {345668#false} assume !false; {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 95: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 96: Hoare triple {345668#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 97: Hoare triple {345668#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,352 INFO L290 TraceCheckUtils]: 98: Hoare triple {345668#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 99: Hoare triple {345668#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 100: Hoare triple {345668#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {345668#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {345668#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {345668#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 104: Hoare triple {345668#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 105: Hoare triple {345668#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 106: Hoare triple {345668#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 107: Hoare triple {345668#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 108: Hoare triple {345668#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 109: Hoare triple {345668#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 110: Hoare triple {345668#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 111: Hoare triple {345668#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 112: Hoare triple {345668#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,353 INFO L290 TraceCheckUtils]: 113: Hoare triple {345668#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 114: Hoare triple {345668#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 115: Hoare triple {345668#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 116: Hoare triple {345668#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 117: Hoare triple {345668#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 118: Hoare triple {345668#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 119: Hoare triple {345668#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 120: Hoare triple {345668#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 121: Hoare triple {345668#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 122: Hoare triple {345668#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 123: Hoare triple {345668#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 124: Hoare triple {345668#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 125: Hoare triple {345668#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 126: Hoare triple {345668#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 127: Hoare triple {345668#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,354 INFO L290 TraceCheckUtils]: 128: Hoare triple {345668#false} assume 8672 == #t~mem79;havoc #t~mem79; {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 129: Hoare triple {345668#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 130: Hoare triple {345668#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 131: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 132: Hoare triple {345668#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; {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 133: Hoare triple {345668#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 134: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 135: Hoare triple {345668#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 136: Hoare triple {345668#false} ~skip~0 := 0; {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 137: Hoare triple {345668#false} assume !false; {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 138: Hoare triple {345668#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); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 139: Hoare triple {345668#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 140: Hoare triple {345668#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 141: Hoare triple {345668#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 142: Hoare triple {345668#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,355 INFO L290 TraceCheckUtils]: 143: Hoare triple {345668#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 144: Hoare triple {345668#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 145: Hoare triple {345668#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 146: Hoare triple {345668#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 147: Hoare triple {345668#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 148: Hoare triple {345668#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 149: Hoare triple {345668#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 150: Hoare triple {345668#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 151: Hoare triple {345668#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 152: Hoare triple {345668#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 153: Hoare triple {345668#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 154: Hoare triple {345668#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 155: Hoare triple {345668#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,356 INFO L290 TraceCheckUtils]: 156: Hoare triple {345668#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 157: Hoare triple {345668#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 158: Hoare triple {345668#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 159: Hoare triple {345668#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 160: Hoare triple {345668#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 161: Hoare triple {345668#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 162: Hoare triple {345668#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 163: Hoare triple {345668#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 164: Hoare triple {345668#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 165: Hoare triple {345668#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 166: Hoare triple {345668#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 167: Hoare triple {345668#false} assume 8640 == #t~mem75;havoc #t~mem75; {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 168: Hoare triple {345668#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 169: Hoare triple {345668#false} assume !(9 == ~blastFlag~0); {345668#false} is VALID [2022-04-15 11:55:11,357 INFO L290 TraceCheckUtils]: 170: Hoare triple {345668#false} assume !(12 == ~blastFlag~0); {345668#false} is VALID [2022-04-15 11:55:11,358 INFO L290 TraceCheckUtils]: 171: Hoare triple {345668#false} assume 15 == ~blastFlag~0; {345668#false} is VALID [2022-04-15 11:55:11,358 INFO L290 TraceCheckUtils]: 172: Hoare triple {345668#false} assume !false; {345668#false} is VALID [2022-04-15 11:55:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-04-15 11:55:11,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:11,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409425075] [2022-04-15 11:55:11,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409425075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:11,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:11,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:55:11,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:11,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964708447] [2022-04-15 11:55:11,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964708447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:11,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:11,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:55:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575551787] [2022-04-15 11:55:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2022-04-15 11:55:11,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:11,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:11,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:11,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:55:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:55:11,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:55:11,420 INFO L87 Difference]: Start difference. First operand 1157 states and 1678 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:13,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:18,830 INFO L93 Difference]: Finished difference Result 2313 states and 3361 transitions. [2022-04-15 11:55:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:55:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2022-04-15 11:55:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:18,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-15 11:55:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2022-04-15 11:55:18,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 472 transitions. [2022-04-15 11:55:19,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 472 edges. 472 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:19,163 INFO L225 Difference]: With dead ends: 2313 [2022-04-15 11:55:19,163 INFO L226 Difference]: Without dead ends: 1184 [2022-04-15 11:55:19,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:55:19,165 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:19,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 428 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 11:55:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-04-15 11:55:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2022-04-15 11:55:19,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:19,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1184 states. Second operand has 1184 states, 1179 states have (on average 1.4495335029686174) internal successors, (1709), 1179 states have internal predecessors, (1709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:19,252 INFO L74 IsIncluded]: Start isIncluded. First operand 1184 states. Second operand has 1184 states, 1179 states have (on average 1.4495335029686174) internal successors, (1709), 1179 states have internal predecessors, (1709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:19,252 INFO L87 Difference]: Start difference. First operand 1184 states. Second operand has 1184 states, 1179 states have (on average 1.4495335029686174) internal successors, (1709), 1179 states have internal predecessors, (1709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:19,291 INFO L93 Difference]: Finished difference Result 1184 states and 1713 transitions. [2022-04-15 11:55:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1713 transitions. [2022-04-15 11:55:19,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:19,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:19,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 1184 states, 1179 states have (on average 1.4495335029686174) internal successors, (1709), 1179 states have internal predecessors, (1709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1184 states. [2022-04-15 11:55:19,293 INFO L87 Difference]: Start difference. First operand has 1184 states, 1179 states have (on average 1.4495335029686174) internal successors, (1709), 1179 states have internal predecessors, (1709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1184 states. [2022-04-15 11:55:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:19,332 INFO L93 Difference]: Finished difference Result 1184 states and 1713 transitions. [2022-04-15 11:55:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1713 transitions. [2022-04-15 11:55:19,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:19,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:19,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:19,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:19,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1179 states have (on average 1.4495335029686174) internal successors, (1709), 1179 states have internal predecessors, (1709), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1713 transitions. [2022-04-15 11:55:19,404 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1713 transitions. Word has length 173 [2022-04-15 11:55:19,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:19,404 INFO L478 AbstractCegarLoop]: Abstraction has 1184 states and 1713 transitions. [2022-04-15 11:55:19,404 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:19,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1184 states and 1713 transitions. [2022-04-15 11:55:21,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1713 edges. 1713 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:21,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1713 transitions. [2022-04-15 11:55:21,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-15 11:55:21,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:21,226 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:55:21,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-15 11:55:21,226 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:21,227 INFO L85 PathProgramCache]: Analyzing trace with hash 172738954, now seen corresponding path program 1 times [2022-04-15 11:55:21,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:21,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [844382614] [2022-04-15 11:55:21,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:21,355 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:21,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:21,355 INFO L85 PathProgramCache]: Analyzing trace with hash 172738954, now seen corresponding path program 2 times [2022-04-15 11:55:21,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:21,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331913952] [2022-04-15 11:55:21,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:21,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:21,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {355045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {355038#true} is VALID [2022-04-15 11:55:21,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {355038#true} assume true; {355038#true} is VALID [2022-04-15 11:55:21,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {355038#true} {355038#true} #725#return; {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {355038#true} call ULTIMATE.init(); {355045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:55:21,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {355045#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {355038#true} assume true; {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {355038#true} {355038#true} #725#return; {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {355038#true} call #t~ret161 := main(); {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {355038#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; {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {355038#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L272 TraceCheckUtils]: 7: Hoare triple {355038#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {355038#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); {355038#true} is VALID [2022-04-15 11:55:21,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {355038#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; {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {355038#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; {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {355038#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {355038#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {355038#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {355038#true} assume !false; {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {355038#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {355038#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {355038#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {355038#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {355038#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {355038#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {355038#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {355038#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {355038#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {355038#true} assume 8464 == #t~mem55;havoc #t~mem55; {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {355038#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; {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 26: Hoare triple {355038#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {355038#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); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {355038#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); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {355038#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {355038#true} ~skip~0 := 0; {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {355038#true} assume !false; {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {355038#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {355038#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {355038#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {355038#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {355038#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {355038#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {355038#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {355038#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {355038#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {355038#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {355038#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 43: Hoare triple {355038#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 44: Hoare triple {355038#true} assume 8496 == #t~mem58;havoc #t~mem58; {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 45: Hoare triple {355038#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 46: Hoare triple {355038#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {355038#true} is VALID [2022-04-15 11:55:21,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {355038#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {355038#true} is VALID [2022-04-15 11:55:21,502 INFO L290 TraceCheckUtils]: 48: Hoare triple {355038#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,502 INFO L290 TraceCheckUtils]: 49: Hoare triple {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,503 INFO L290 TraceCheckUtils]: 51: Hoare triple {355043#(= 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; {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,504 INFO L290 TraceCheckUtils]: 53: Hoare triple {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,504 INFO L290 TraceCheckUtils]: 54: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,506 INFO L290 TraceCheckUtils]: 58: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,506 INFO L290 TraceCheckUtils]: 59: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,508 INFO L290 TraceCheckUtils]: 63: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,509 INFO L290 TraceCheckUtils]: 66: Hoare triple {355043#(= 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); {355043#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-15 11:55:21,509 INFO L290 TraceCheckUtils]: 67: Hoare triple {355043#(= 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); {355044#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-15 11:55:21,509 INFO L290 TraceCheckUtils]: 68: Hoare triple {355044#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {355039#false} is VALID [2022-04-15 11:55:21,509 INFO L290 TraceCheckUtils]: 69: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 70: Hoare triple {355039#false} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 71: Hoare triple {355039#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 72: Hoare triple {355039#false} assume !(~ret~0 <= 0); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 73: Hoare triple {355039#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 74: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 75: Hoare triple {355039#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 76: Hoare triple {355039#false} ~skip~0 := 0; {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {355039#false} assume !false; {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {355039#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 80: Hoare triple {355039#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {355039#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {355039#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {355039#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,510 INFO L290 TraceCheckUtils]: 84: Hoare triple {355039#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 85: Hoare triple {355039#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 86: Hoare triple {355039#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 87: Hoare triple {355039#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 88: Hoare triple {355039#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 89: Hoare triple {355039#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 90: Hoare triple {355039#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 91: Hoare triple {355039#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 92: Hoare triple {355039#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 93: Hoare triple {355039#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 94: Hoare triple {355039#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 95: Hoare triple {355039#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 96: Hoare triple {355039#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 97: Hoare triple {355039#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 98: Hoare triple {355039#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 99: Hoare triple {355039#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,511 INFO L290 TraceCheckUtils]: 100: Hoare triple {355039#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 101: Hoare triple {355039#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 102: Hoare triple {355039#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 103: Hoare triple {355039#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 104: Hoare triple {355039#false} assume 8593 == #t~mem72;havoc #t~mem72; {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 105: Hoare triple {355039#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 106: Hoare triple {355039#false} assume !(7 == ~blastFlag~0); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 107: Hoare triple {355039#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 108: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 109: Hoare triple {355039#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 110: Hoare triple {355039#false} ~skip~0 := 0; {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 111: Hoare triple {355039#false} assume !false; {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 112: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 113: Hoare triple {355039#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 114: Hoare triple {355039#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,512 INFO L290 TraceCheckUtils]: 115: Hoare triple {355039#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 116: Hoare triple {355039#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 117: Hoare triple {355039#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 118: Hoare triple {355039#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 119: Hoare triple {355039#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 120: Hoare triple {355039#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 121: Hoare triple {355039#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 122: Hoare triple {355039#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 123: Hoare triple {355039#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 124: Hoare triple {355039#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 125: Hoare triple {355039#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 126: Hoare triple {355039#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 127: Hoare triple {355039#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 128: Hoare triple {355039#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 129: Hoare triple {355039#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,513 INFO L290 TraceCheckUtils]: 130: Hoare triple {355039#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 131: Hoare triple {355039#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 132: Hoare triple {355039#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 133: Hoare triple {355039#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 134: Hoare triple {355039#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 135: Hoare triple {355039#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 136: Hoare triple {355039#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 137: Hoare triple {355039#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 138: Hoare triple {355039#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 139: Hoare triple {355039#false} assume 8608 == #t~mem73;havoc #t~mem73; {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 140: Hoare triple {355039#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 141: Hoare triple {355039#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 142: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 143: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 144: Hoare triple {355039#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {355039#false} is VALID [2022-04-15 11:55:21,514 INFO L290 TraceCheckUtils]: 145: Hoare triple {355039#false} ~skip~0 := 0; {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 146: Hoare triple {355039#false} assume !false; {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 147: Hoare triple {355039#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); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 148: Hoare triple {355039#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 149: Hoare triple {355039#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 150: Hoare triple {355039#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 151: Hoare triple {355039#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 152: Hoare triple {355039#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 153: Hoare triple {355039#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 154: Hoare triple {355039#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 155: Hoare triple {355039#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 156: Hoare triple {355039#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 157: Hoare triple {355039#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 158: Hoare triple {355039#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 159: Hoare triple {355039#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,515 INFO L290 TraceCheckUtils]: 160: Hoare triple {355039#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 161: Hoare triple {355039#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 162: Hoare triple {355039#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 163: Hoare triple {355039#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 164: Hoare triple {355039#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 165: Hoare triple {355039#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 166: Hoare triple {355039#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 167: Hoare triple {355039#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 168: Hoare triple {355039#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 169: Hoare triple {355039#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 170: Hoare triple {355039#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 171: Hoare triple {355039#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 172: Hoare triple {355039#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 173: Hoare triple {355039#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 174: Hoare triple {355039#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,516 INFO L290 TraceCheckUtils]: 175: Hoare triple {355039#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {355039#false} is VALID [2022-04-15 11:55:21,517 INFO L290 TraceCheckUtils]: 176: Hoare triple {355039#false} assume 8640 == #t~mem75;havoc #t~mem75; {355039#false} is VALID [2022-04-15 11:55:21,517 INFO L290 TraceCheckUtils]: 177: Hoare triple {355039#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {355039#false} is VALID [2022-04-15 11:55:21,517 INFO L290 TraceCheckUtils]: 178: Hoare triple {355039#false} assume !(9 == ~blastFlag~0); {355039#false} is VALID [2022-04-15 11:55:21,517 INFO L290 TraceCheckUtils]: 179: Hoare triple {355039#false} assume !(12 == ~blastFlag~0); {355039#false} is VALID [2022-04-15 11:55:21,517 INFO L290 TraceCheckUtils]: 180: Hoare triple {355039#false} assume 15 == ~blastFlag~0; {355039#false} is VALID [2022-04-15 11:55:21,517 INFO L290 TraceCheckUtils]: 181: Hoare triple {355039#false} assume !false; {355039#false} is VALID [2022-04-15 11:55:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-15 11:55:21,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:21,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331913952] [2022-04-15 11:55:21,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331913952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:21,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:21,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:21,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:21,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [844382614] [2022-04-15 11:55:21,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [844382614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:21,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:21,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:21,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272096960] [2022-04-15 11:55:21,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:21,518 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 182 [2022-04-15 11:55:21,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:21,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:21,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:21,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:55:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:21,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:55:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:55:21,585 INFO L87 Difference]: Start difference. First operand 1184 states and 1713 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:23,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:26,308 INFO L93 Difference]: Finished difference Result 2382 states and 3449 transitions. [2022-04-15 11:55:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:55:26,309 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 182 [2022-04-15 11:55:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-15 11:55:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-04-15 11:55:26,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 524 transitions. [2022-04-15 11:55:26,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:26,670 INFO L225 Difference]: With dead ends: 2382 [2022-04-15 11:55:26,670 INFO L226 Difference]: Without dead ends: 1226 [2022-04-15 11:55:26,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:55:26,673 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 57 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:26,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 571 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 11:55:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-04-15 11:55:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1184. [2022-04-15 11:55:26,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:26,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 1184 states, 1179 states have (on average 1.4478371501272265) internal successors, (1707), 1179 states have internal predecessors, (1707), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:26,767 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 1184 states, 1179 states have (on average 1.4478371501272265) internal successors, (1707), 1179 states have internal predecessors, (1707), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:26,768 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 1184 states, 1179 states have (on average 1.4478371501272265) internal successors, (1707), 1179 states have internal predecessors, (1707), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:26,811 INFO L93 Difference]: Finished difference Result 1226 states and 1766 transitions. [2022-04-15 11:55:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1766 transitions. [2022-04-15 11:55:26,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:26,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:26,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 1184 states, 1179 states have (on average 1.4478371501272265) internal successors, (1707), 1179 states have internal predecessors, (1707), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-15 11:55:26,813 INFO L87 Difference]: Start difference. First operand has 1184 states, 1179 states have (on average 1.4478371501272265) internal successors, (1707), 1179 states have internal predecessors, (1707), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1226 states. [2022-04-15 11:55:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:26,855 INFO L93 Difference]: Finished difference Result 1226 states and 1766 transitions. [2022-04-15 11:55:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1766 transitions. [2022-04-15 11:55:26,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:26,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:26,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:26,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1179 states have (on average 1.4478371501272265) internal successors, (1707), 1179 states have internal predecessors, (1707), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1711 transitions. [2022-04-15 11:55:26,917 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1711 transitions. Word has length 182 [2022-04-15 11:55:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:26,917 INFO L478 AbstractCegarLoop]: Abstraction has 1184 states and 1711 transitions. [2022-04-15 11:55:26,917 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:26,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1184 states and 1711 transitions. [2022-04-15 11:55:28,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1711 edges. 1711 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1711 transitions. [2022-04-15 11:55:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-04-15 11:55:28,802 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:28,802 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:55:28,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-15 11:55:28,802 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1444701496, now seen corresponding path program 1 times [2022-04-15 11:55:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:28,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179275067] [2022-04-15 11:55:28,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:28,914 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:28,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1444701496, now seen corresponding path program 2 times [2022-04-15 11:55:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:28,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818666370] [2022-04-15 11:55:28,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:29,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:29,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {364641#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {364634#true} is VALID [2022-04-15 11:55:29,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {364634#true} assume true; {364634#true} is VALID [2022-04-15 11:55:29,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {364634#true} {364634#true} #725#return; {364634#true} is VALID [2022-04-15 11:55:29,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {364634#true} call ULTIMATE.init(); {364641#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:55:29,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {364641#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {364634#true} assume true; {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {364634#true} {364634#true} #725#return; {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {364634#true} call #t~ret161 := main(); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {364634#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; {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {364634#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L272 TraceCheckUtils]: 7: Hoare triple {364634#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {364634#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); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {364634#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; {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {364634#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; {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {364634#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {364634#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {364634#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {364634#true} assume !false; {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {364634#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {364634#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {364634#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {364634#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {364634#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {364634#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {364634#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {364634#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {364634#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {364634#true} assume 8464 == #t~mem55;havoc #t~mem55; {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {364634#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; {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {364634#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {364634#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); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {364634#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); {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {364634#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {364634#true} is VALID [2022-04-15 11:55:29,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {364634#true} ~skip~0 := 0; {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {364634#true} assume !false; {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {364634#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {364634#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 34: Hoare triple {364634#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {364634#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {364634#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {364634#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {364634#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 39: Hoare triple {364634#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {364634#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {364634#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {364634#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {364634#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {364634#true} assume 8496 == #t~mem58;havoc #t~mem58; {364634#true} is VALID [2022-04-15 11:55:29,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {364634#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {364634#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 47: Hoare triple {364634#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 48: Hoare triple {364634#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 49: Hoare triple {364634#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {364634#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); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 51: Hoare triple {364634#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 52: Hoare triple {364634#true} ~skip~0 := 0; {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {364634#true} assume !false; {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {364634#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {364634#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {364634#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 57: Hoare triple {364634#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 58: Hoare triple {364634#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {364634#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {364634#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {364634#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {364634#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 63: Hoare triple {364634#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 64: Hoare triple {364634#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {364634#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 66: Hoare triple {364634#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 67: Hoare triple {364634#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {364634#true} assume 8512 == #t~mem60;havoc #t~mem60; {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 69: Hoare triple {364634#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 70: Hoare triple {364634#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {364634#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {364634#true} is VALID [2022-04-15 11:55:29,045 INFO L290 TraceCheckUtils]: 72: Hoare triple {364634#true} assume !(~ret~0 <= 0); {364634#true} is VALID [2022-04-15 11:55:29,046 INFO L290 TraceCheckUtils]: 73: Hoare triple {364634#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,047 INFO L290 TraceCheckUtils]: 74: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,047 INFO L290 TraceCheckUtils]: 75: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,047 INFO L290 TraceCheckUtils]: 76: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,048 INFO L290 TraceCheckUtils]: 77: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,048 INFO L290 TraceCheckUtils]: 78: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,048 INFO L290 TraceCheckUtils]: 79: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,049 INFO L290 TraceCheckUtils]: 80: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,049 INFO L290 TraceCheckUtils]: 81: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,049 INFO L290 TraceCheckUtils]: 82: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,050 INFO L290 TraceCheckUtils]: 83: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,050 INFO L290 TraceCheckUtils]: 84: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,050 INFO L290 TraceCheckUtils]: 85: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,050 INFO L290 TraceCheckUtils]: 86: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,051 INFO L290 TraceCheckUtils]: 87: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,051 INFO L290 TraceCheckUtils]: 88: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,052 INFO L290 TraceCheckUtils]: 91: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,052 INFO L290 TraceCheckUtils]: 92: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,053 INFO L290 TraceCheckUtils]: 93: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,053 INFO L290 TraceCheckUtils]: 94: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,053 INFO L290 TraceCheckUtils]: 95: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,054 INFO L290 TraceCheckUtils]: 96: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,054 INFO L290 TraceCheckUtils]: 97: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,054 INFO L290 TraceCheckUtils]: 98: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,055 INFO L290 TraceCheckUtils]: 99: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,055 INFO L290 TraceCheckUtils]: 100: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,055 INFO L290 TraceCheckUtils]: 101: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,056 INFO L290 TraceCheckUtils]: 102: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:55:29,056 INFO L290 TraceCheckUtils]: 103: Hoare triple {364639#(not (= 8593 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {364640#(not (= 8593 |ssl3_accept_#t~mem72|))} is VALID [2022-04-15 11:55:29,056 INFO L290 TraceCheckUtils]: 104: Hoare triple {364640#(not (= 8593 |ssl3_accept_#t~mem72|))} assume 8593 == #t~mem72;havoc #t~mem72; {364635#false} is VALID [2022-04-15 11:55:29,056 INFO L290 TraceCheckUtils]: 105: Hoare triple {364635#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 106: Hoare triple {364635#false} assume !(7 == ~blastFlag~0); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 107: Hoare triple {364635#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 108: Hoare triple {364635#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); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 109: Hoare triple {364635#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 110: Hoare triple {364635#false} ~skip~0 := 0; {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 111: Hoare triple {364635#false} assume !false; {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 112: Hoare triple {364635#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); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 113: Hoare triple {364635#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 114: Hoare triple {364635#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 115: Hoare triple {364635#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 116: Hoare triple {364635#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 117: Hoare triple {364635#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 118: Hoare triple {364635#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 119: Hoare triple {364635#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,057 INFO L290 TraceCheckUtils]: 120: Hoare triple {364635#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 121: Hoare triple {364635#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 122: Hoare triple {364635#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 123: Hoare triple {364635#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 124: Hoare triple {364635#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 125: Hoare triple {364635#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 126: Hoare triple {364635#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 127: Hoare triple {364635#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 128: Hoare triple {364635#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 129: Hoare triple {364635#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 130: Hoare triple {364635#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 131: Hoare triple {364635#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 132: Hoare triple {364635#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 133: Hoare triple {364635#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,058 INFO L290 TraceCheckUtils]: 134: Hoare triple {364635#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 135: Hoare triple {364635#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 136: Hoare triple {364635#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 137: Hoare triple {364635#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 138: Hoare triple {364635#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 139: Hoare triple {364635#false} assume 8608 == #t~mem73;havoc #t~mem73; {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 140: Hoare triple {364635#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 141: Hoare triple {364635#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 142: Hoare triple {364635#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); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 143: Hoare triple {364635#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); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 144: Hoare triple {364635#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 145: Hoare triple {364635#false} ~skip~0 := 0; {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 146: Hoare triple {364635#false} assume !false; {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 147: Hoare triple {364635#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); {364635#false} is VALID [2022-04-15 11:55:29,059 INFO L290 TraceCheckUtils]: 148: Hoare triple {364635#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 149: Hoare triple {364635#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 150: Hoare triple {364635#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 151: Hoare triple {364635#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 152: Hoare triple {364635#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 153: Hoare triple {364635#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 154: Hoare triple {364635#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 155: Hoare triple {364635#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 156: Hoare triple {364635#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 157: Hoare triple {364635#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 158: Hoare triple {364635#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 159: Hoare triple {364635#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 160: Hoare triple {364635#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 161: Hoare triple {364635#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 162: Hoare triple {364635#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,060 INFO L290 TraceCheckUtils]: 163: Hoare triple {364635#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 164: Hoare triple {364635#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 165: Hoare triple {364635#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 166: Hoare triple {364635#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 167: Hoare triple {364635#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 168: Hoare triple {364635#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 169: Hoare triple {364635#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 170: Hoare triple {364635#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 171: Hoare triple {364635#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 172: Hoare triple {364635#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 173: Hoare triple {364635#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 174: Hoare triple {364635#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 175: Hoare triple {364635#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 176: Hoare triple {364635#false} assume 8640 == #t~mem75;havoc #t~mem75; {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 177: Hoare triple {364635#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {364635#false} is VALID [2022-04-15 11:55:29,061 INFO L290 TraceCheckUtils]: 178: Hoare triple {364635#false} assume !(9 == ~blastFlag~0); {364635#false} is VALID [2022-04-15 11:55:29,062 INFO L290 TraceCheckUtils]: 179: Hoare triple {364635#false} assume !(12 == ~blastFlag~0); {364635#false} is VALID [2022-04-15 11:55:29,062 INFO L290 TraceCheckUtils]: 180: Hoare triple {364635#false} assume 15 == ~blastFlag~0; {364635#false} is VALID [2022-04-15 11:55:29,062 INFO L290 TraceCheckUtils]: 181: Hoare triple {364635#false} assume !false; {364635#false} is VALID [2022-04-15 11:55:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-15 11:55:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:29,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818666370] [2022-04-15 11:55:29,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818666370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:29,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:29,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:29,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:29,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179275067] [2022-04-15 11:55:29,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179275067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:29,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:29,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:55:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996969109] [2022-04-15 11:55:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:29,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 182 [2022-04-15 11:55:29,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:29,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:29,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:29,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:55:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:55:29,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:55:29,146 INFO L87 Difference]: Start difference. First operand 1184 states and 1711 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:32,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:34,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:38,814 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:41,316 INFO L93 Difference]: Finished difference Result 2474 states and 3573 transitions. [2022-04-15 11:55:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:55:41,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 182 [2022-04-15 11:55:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-15 11:55:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2022-04-15 11:55:41,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 603 transitions. [2022-04-15 11:55:41,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 603 edges. 603 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:41,756 INFO L225 Difference]: With dead ends: 2474 [2022-04-15 11:55:41,756 INFO L226 Difference]: Without dead ends: 1318 [2022-04-15 11:55:41,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:55:41,758 INFO L913 BasicCegarLoop]: 142 mSDtfsCounter, 118 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:41,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 404 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-04-15 11:55:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-04-15 11:55:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1184. [2022-04-15 11:55:41,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:41,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1318 states. Second operand has 1184 states, 1179 states have (on average 1.4410517387616624) internal successors, (1699), 1179 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:41,857 INFO L74 IsIncluded]: Start isIncluded. First operand 1318 states. Second operand has 1184 states, 1179 states have (on average 1.4410517387616624) internal successors, (1699), 1179 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:41,858 INFO L87 Difference]: Start difference. First operand 1318 states. Second operand has 1184 states, 1179 states have (on average 1.4410517387616624) internal successors, (1699), 1179 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:41,905 INFO L93 Difference]: Finished difference Result 1318 states and 1886 transitions. [2022-04-15 11:55:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1886 transitions. [2022-04-15 11:55:41,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:41,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:41,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 1184 states, 1179 states have (on average 1.4410517387616624) internal successors, (1699), 1179 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1318 states. [2022-04-15 11:55:41,907 INFO L87 Difference]: Start difference. First operand has 1184 states, 1179 states have (on average 1.4410517387616624) internal successors, (1699), 1179 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1318 states. [2022-04-15 11:55:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:41,955 INFO L93 Difference]: Finished difference Result 1318 states and 1886 transitions. [2022-04-15 11:55:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1886 transitions. [2022-04-15 11:55:41,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:41,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:41,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:41,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1179 states have (on average 1.4410517387616624) internal successors, (1699), 1179 states have internal predecessors, (1699), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1703 transitions. [2022-04-15 11:55:42,030 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1703 transitions. Word has length 182 [2022-04-15 11:55:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:42,031 INFO L478 AbstractCegarLoop]: Abstraction has 1184 states and 1703 transitions. [2022-04-15 11:55:42,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:42,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1184 states and 1703 transitions. [2022-04-15 11:55:44,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1703 edges. 1703 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1703 transitions. [2022-04-15 11:55:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-04-15 11:55:44,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:44,004 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:55:44,004 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-15 11:55:44,004 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1871769580, now seen corresponding path program 1 times [2022-04-15 11:55:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [932799297] [2022-04-15 11:55:44,144 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:44,144 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:44,144 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:44,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1871769580, now seen corresponding path program 2 times [2022-04-15 11:55:44,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:44,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652537263] [2022-04-15 11:55:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:44,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:44,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {374604#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {374598#true} is VALID [2022-04-15 11:55:44,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {374598#true} assume true; {374598#true} is VALID [2022-04-15 11:55:44,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {374598#true} {374598#true} #725#return; {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {374598#true} call ULTIMATE.init(); {374604#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {374604#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {374598#true} assume true; {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {374598#true} {374598#true} #725#return; {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {374598#true} call #t~ret161 := main(); {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {374598#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; {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {374598#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L272 TraceCheckUtils]: 7: Hoare triple {374598#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {374598#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); {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {374598#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; {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {374598#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; {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {374598#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {374598#true} is VALID [2022-04-15 11:55:44,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {374598#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {374598#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {374598#true} assume !false; {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {374598#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {374598#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {374598#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {374598#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {374598#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {374598#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {374598#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {374598#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {374598#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {374598#true} assume 8464 == #t~mem55;havoc #t~mem55; {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {374598#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; {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {374598#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {374598#true} is VALID [2022-04-15 11:55:44,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {374598#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); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {374598#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); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {374598#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {374598#true} ~skip~0 := 0; {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {374598#true} assume !false; {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {374598#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {374598#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {374598#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {374598#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {374598#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {374598#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {374598#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {374598#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {374598#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {374598#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {374598#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {374598#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {374598#true} assume 8496 == #t~mem58;havoc #t~mem58; {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {374598#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 46: Hoare triple {374598#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 47: Hoare triple {374598#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {374598#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {374598#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {374598#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); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {374598#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {374598#true} ~skip~0 := 0; {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {374598#true} assume !false; {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {374598#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {374598#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {374598#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {374598#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {374598#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {374598#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {374598#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {374598#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {374598#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 63: Hoare triple {374598#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {374598#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 65: Hoare triple {374598#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 66: Hoare triple {374598#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 67: Hoare triple {374598#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 68: Hoare triple {374598#true} assume 8512 == #t~mem60;havoc #t~mem60; {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 69: Hoare triple {374598#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {374598#true} is VALID [2022-04-15 11:55:44,264 INFO L290 TraceCheckUtils]: 70: Hoare triple {374598#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {374598#true} is VALID [2022-04-15 11:55:44,265 INFO L290 TraceCheckUtils]: 71: Hoare triple {374598#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,265 INFO L290 TraceCheckUtils]: 72: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,265 INFO L290 TraceCheckUtils]: 73: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,265 INFO L290 TraceCheckUtils]: 74: Hoare triple {374603#(= 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); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,266 INFO L290 TraceCheckUtils]: 77: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !false; {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {374603#(= 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); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,268 INFO L290 TraceCheckUtils]: 83: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,268 INFO L290 TraceCheckUtils]: 86: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,280 INFO L290 TraceCheckUtils]: 87: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,280 INFO L290 TraceCheckUtils]: 88: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,280 INFO L290 TraceCheckUtils]: 89: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,281 INFO L290 TraceCheckUtils]: 90: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,281 INFO L290 TraceCheckUtils]: 91: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,281 INFO L290 TraceCheckUtils]: 92: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,282 INFO L290 TraceCheckUtils]: 93: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,282 INFO L290 TraceCheckUtils]: 94: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,282 INFO L290 TraceCheckUtils]: 95: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,282 INFO L290 TraceCheckUtils]: 96: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,283 INFO L290 TraceCheckUtils]: 97: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,283 INFO L290 TraceCheckUtils]: 98: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,283 INFO L290 TraceCheckUtils]: 99: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,283 INFO L290 TraceCheckUtils]: 100: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,284 INFO L290 TraceCheckUtils]: 101: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,284 INFO L290 TraceCheckUtils]: 102: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,284 INFO L290 TraceCheckUtils]: 103: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,284 INFO L290 TraceCheckUtils]: 104: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,285 INFO L290 TraceCheckUtils]: 105: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,285 INFO L290 TraceCheckUtils]: 106: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,285 INFO L290 TraceCheckUtils]: 107: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,285 INFO L290 TraceCheckUtils]: 108: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,286 INFO L290 TraceCheckUtils]: 109: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume 8656 == #t~mem77;havoc #t~mem77; {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,286 INFO L290 TraceCheckUtils]: 110: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} call #t~mem140.base, #t~mem140.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem141.base, #t~mem141.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem142.base, #t~mem142.offset := read~$Pointer$(#t~mem141.base, 836 + #t~mem141.offset, 4);call write~$Pointer$(#t~mem142.base, #t~mem142.offset, #t~mem140.base, 172 + #t~mem140.offset, 4);havoc #t~mem140.base, #t~mem140.offset;havoc #t~mem141.base, #t~mem141.offset;havoc #t~mem142.base, #t~mem142.offset; {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,286 INFO L290 TraceCheckUtils]: 111: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {374603#(= 3 ssl3_accept_~blastFlag~0)} is VALID [2022-04-15 11:55:44,286 INFO L290 TraceCheckUtils]: 112: Hoare triple {374603#(= 3 ssl3_accept_~blastFlag~0)} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {374599#false} is VALID [2022-04-15 11:55:44,286 INFO L290 TraceCheckUtils]: 113: Hoare triple {374599#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); {374599#false} is VALID [2022-04-15 11:55:44,286 INFO L290 TraceCheckUtils]: 114: Hoare triple {374599#false} assume !(0 == ~tmp___10~0); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 115: Hoare triple {374599#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); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 116: Hoare triple {374599#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 117: Hoare triple {374599#false} ~skip~0 := 0; {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 118: Hoare triple {374599#false} assume !false; {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 119: Hoare triple {374599#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); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 120: Hoare triple {374599#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 121: Hoare triple {374599#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 122: Hoare triple {374599#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 123: Hoare triple {374599#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 124: Hoare triple {374599#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 125: Hoare triple {374599#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 126: Hoare triple {374599#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 127: Hoare triple {374599#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 128: Hoare triple {374599#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,287 INFO L290 TraceCheckUtils]: 129: Hoare triple {374599#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 130: Hoare triple {374599#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 131: Hoare triple {374599#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 132: Hoare triple {374599#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 133: Hoare triple {374599#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 134: Hoare triple {374599#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 135: Hoare triple {374599#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 136: Hoare triple {374599#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 137: Hoare triple {374599#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 138: Hoare triple {374599#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 139: Hoare triple {374599#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 140: Hoare triple {374599#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 141: Hoare triple {374599#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 142: Hoare triple {374599#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 143: Hoare triple {374599#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,288 INFO L290 TraceCheckUtils]: 144: Hoare triple {374599#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 145: Hoare triple {374599#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 146: Hoare triple {374599#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 147: Hoare triple {374599#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 148: Hoare triple {374599#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 149: Hoare triple {374599#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 150: Hoare triple {374599#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 151: Hoare triple {374599#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 152: Hoare triple {374599#false} assume 8672 == #t~mem79;havoc #t~mem79; {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 153: Hoare triple {374599#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 154: Hoare triple {374599#false} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 155: Hoare triple {374599#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); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 156: Hoare triple {374599#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; {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 157: Hoare triple {374599#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 158: Hoare triple {374599#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); {374599#false} is VALID [2022-04-15 11:55:44,289 INFO L290 TraceCheckUtils]: 159: Hoare triple {374599#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 160: Hoare triple {374599#false} ~skip~0 := 0; {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 161: Hoare triple {374599#false} assume !false; {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 162: Hoare triple {374599#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); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 163: Hoare triple {374599#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 164: Hoare triple {374599#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 165: Hoare triple {374599#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 166: Hoare triple {374599#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 167: Hoare triple {374599#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 168: Hoare triple {374599#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 169: Hoare triple {374599#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 170: Hoare triple {374599#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 171: Hoare triple {374599#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 172: Hoare triple {374599#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 173: Hoare triple {374599#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,290 INFO L290 TraceCheckUtils]: 174: Hoare triple {374599#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 175: Hoare triple {374599#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 176: Hoare triple {374599#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 177: Hoare triple {374599#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 178: Hoare triple {374599#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 179: Hoare triple {374599#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 180: Hoare triple {374599#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 181: Hoare triple {374599#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 182: Hoare triple {374599#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 183: Hoare triple {374599#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 184: Hoare triple {374599#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 185: Hoare triple {374599#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 186: Hoare triple {374599#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 187: Hoare triple {374599#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 188: Hoare triple {374599#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,291 INFO L290 TraceCheckUtils]: 189: Hoare triple {374599#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L290 TraceCheckUtils]: 190: Hoare triple {374599#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L290 TraceCheckUtils]: 191: Hoare triple {374599#false} assume 8640 == #t~mem75;havoc #t~mem75; {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L290 TraceCheckUtils]: 192: Hoare triple {374599#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L290 TraceCheckUtils]: 193: Hoare triple {374599#false} assume !(9 == ~blastFlag~0); {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L290 TraceCheckUtils]: 194: Hoare triple {374599#false} assume !(12 == ~blastFlag~0); {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L290 TraceCheckUtils]: 195: Hoare triple {374599#false} assume 15 == ~blastFlag~0; {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L290 TraceCheckUtils]: 196: Hoare triple {374599#false} assume !false; {374599#false} is VALID [2022-04-15 11:55:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-04-15 11:55:44,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:44,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652537263] [2022-04-15 11:55:44,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652537263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:44,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:44,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:55:44,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:44,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [932799297] [2022-04-15 11:55:44,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [932799297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:44,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:44,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:55:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223648786] [2022-04-15 11:55:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:44,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-15 11:55:44,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:44,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:44,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:44,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:55:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:55:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:55:44,374 INFO L87 Difference]: Start difference. First operand 1184 states and 1703 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:46,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:49,147 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-15 11:55:52,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:55:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:55,547 INFO L93 Difference]: Finished difference Result 2903 states and 4199 transitions. [2022-04-15 11:55:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:55:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 197 [2022-04-15 11:55:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:55:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:55:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:55:55,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 641 transitions. [2022-04-15 11:55:55,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:56,069 INFO L225 Difference]: With dead ends: 2903 [2022-04-15 11:55:56,069 INFO L226 Difference]: Without dead ends: 1747 [2022-04-15 11:55:56,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:55:56,071 INFO L913 BasicCegarLoop]: 395 mSDtfsCounter, 149 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:55:56,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 589 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-04-15 11:55:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2022-04-15 11:55:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2022-04-15 11:55:56,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:55:56,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1747 states. Second operand has 1747 states, 1742 states have (on average 1.4397244546498278) internal successors, (2508), 1742 states have internal predecessors, (2508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:56,225 INFO L74 IsIncluded]: Start isIncluded. First operand 1747 states. Second operand has 1747 states, 1742 states have (on average 1.4397244546498278) internal successors, (2508), 1742 states have internal predecessors, (2508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:56,226 INFO L87 Difference]: Start difference. First operand 1747 states. Second operand has 1747 states, 1742 states have (on average 1.4397244546498278) internal successors, (2508), 1742 states have internal predecessors, (2508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:56,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:56,318 INFO L93 Difference]: Finished difference Result 1747 states and 2512 transitions. [2022-04-15 11:55:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2512 transitions. [2022-04-15 11:55:56,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:56,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:56,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 1747 states, 1742 states have (on average 1.4397244546498278) internal successors, (2508), 1742 states have internal predecessors, (2508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1747 states. [2022-04-15 11:55:56,322 INFO L87 Difference]: Start difference. First operand has 1747 states, 1742 states have (on average 1.4397244546498278) internal successors, (2508), 1742 states have internal predecessors, (2508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1747 states. [2022-04-15 11:55:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:55:56,412 INFO L93 Difference]: Finished difference Result 1747 states and 2512 transitions. [2022-04-15 11:55:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2512 transitions. [2022-04-15 11:55:56,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:55:56,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:55:56,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:55:56,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:55:56,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1742 states have (on average 1.4397244546498278) internal successors, (2508), 1742 states have internal predecessors, (2508), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2512 transitions. [2022-04-15 11:55:56,571 INFO L78 Accepts]: Start accepts. Automaton has 1747 states and 2512 transitions. Word has length 197 [2022-04-15 11:55:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:55:56,571 INFO L478 AbstractCegarLoop]: Abstraction has 1747 states and 2512 transitions. [2022-04-15 11:55:56,572 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:56,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1747 states and 2512 transitions. [2022-04-15 11:55:59,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2512 edges. 2512 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2512 transitions. [2022-04-15 11:55:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-04-15 11:55:59,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:55:59,424 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:55:59,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-15 11:55:59,424 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:55:59,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:55:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -880882500, now seen corresponding path program 1 times [2022-04-15 11:55:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:59,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [81039198] [2022-04-15 11:55:59,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:55:59,606 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:55:59,606 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:55:59,606 INFO L85 PathProgramCache]: Analyzing trace with hash -880882500, now seen corresponding path program 2 times [2022-04-15 11:55:59,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:55:59,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049721335] [2022-04-15 11:55:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:55:59,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:55:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:59,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:55:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:55:59,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {387407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {387401#true} is VALID [2022-04-15 11:55:59,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {387401#true} assume true; {387401#true} is VALID [2022-04-15 11:55:59,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {387401#true} {387401#true} #725#return; {387401#true} is VALID [2022-04-15 11:55:59,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {387401#true} call ULTIMATE.init(); {387407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {387407#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {387401#true} assume true; {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {387401#true} {387401#true} #725#return; {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {387401#true} call #t~ret161 := main(); {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {387401#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; {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {387401#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L272 TraceCheckUtils]: 7: Hoare triple {387401#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {387401#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); {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {387401#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; {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {387401#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; {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {387401#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {387401#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {387401#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {387401#true} assume !false; {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {387401#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {387401#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {387401#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {387401#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {387401#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {387401#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {387401#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {387401#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {387401#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {387401#true} assume 8464 == #t~mem55;havoc #t~mem55; {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {387401#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; {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {387401#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {387401#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); {387401#true} is VALID [2022-04-15 11:55:59,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {387401#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); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {387401#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {387401#true} ~skip~0 := 0; {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {387401#true} assume !false; {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {387401#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {387401#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {387401#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {387401#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {387401#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {387401#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 38: Hoare triple {387401#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {387401#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {387401#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {387401#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {387401#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {387401#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {387401#true} assume 8496 == #t~mem58;havoc #t~mem58; {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 45: Hoare triple {387401#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {387401#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 47: Hoare triple {387401#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {387401#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {387401#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 50: Hoare triple {387401#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); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {387401#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {387401#true} ~skip~0 := 0; {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {387401#true} assume !false; {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {387401#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {387401#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {387401#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {387401#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,757 INFO L290 TraceCheckUtils]: 58: Hoare triple {387401#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {387401#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {387401#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 61: Hoare triple {387401#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 62: Hoare triple {387401#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 63: Hoare triple {387401#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {387401#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 65: Hoare triple {387401#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 66: Hoare triple {387401#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 67: Hoare triple {387401#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 68: Hoare triple {387401#true} assume 8512 == #t~mem60;havoc #t~mem60; {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 69: Hoare triple {387401#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 70: Hoare triple {387401#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 71: Hoare triple {387401#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 72: Hoare triple {387401#true} assume !(~ret~0 <= 0); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {387401#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {387401#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); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 75: Hoare triple {387401#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 76: Hoare triple {387401#true} ~skip~0 := 0; {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {387401#true} assume !false; {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {387401#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {387401#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 80: Hoare triple {387401#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 81: Hoare triple {387401#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 82: Hoare triple {387401#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 83: Hoare triple {387401#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 84: Hoare triple {387401#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {387401#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 86: Hoare triple {387401#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 87: Hoare triple {387401#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 88: Hoare triple {387401#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,759 INFO L290 TraceCheckUtils]: 89: Hoare triple {387401#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 90: Hoare triple {387401#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 91: Hoare triple {387401#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 92: Hoare triple {387401#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 93: Hoare triple {387401#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 94: Hoare triple {387401#true} assume 8528 == #t~mem62;havoc #t~mem62; {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 95: Hoare triple {387401#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 96: Hoare triple {387401#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 97: Hoare triple {387401#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 98: Hoare triple {387401#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 99: Hoare triple {387401#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 100: Hoare triple {387401#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 101: Hoare triple {387401#true} assume !(~ret~0 <= 0); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 102: Hoare triple {387401#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,760 INFO L290 TraceCheckUtils]: 103: Hoare triple {387401#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); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 104: Hoare triple {387401#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 105: Hoare triple {387401#true} ~skip~0 := 0; {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 106: Hoare triple {387401#true} assume !false; {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 107: Hoare triple {387401#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 108: Hoare triple {387401#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 109: Hoare triple {387401#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 110: Hoare triple {387401#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 111: Hoare triple {387401#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 112: Hoare triple {387401#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 113: Hoare triple {387401#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 114: Hoare triple {387401#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 115: Hoare triple {387401#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 116: Hoare triple {387401#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 117: Hoare triple {387401#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,761 INFO L290 TraceCheckUtils]: 118: Hoare triple {387401#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 119: Hoare triple {387401#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 120: Hoare triple {387401#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 121: Hoare triple {387401#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 122: Hoare triple {387401#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 123: Hoare triple {387401#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 124: Hoare triple {387401#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 125: Hoare triple {387401#true} assume 8544 == #t~mem64;havoc #t~mem64; {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 126: Hoare triple {387401#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 127: Hoare triple {387401#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 128: Hoare triple {387401#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 129: Hoare triple {387401#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 130: Hoare triple {387401#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {387401#true} is VALID [2022-04-15 11:55:59,762 INFO L290 TraceCheckUtils]: 131: Hoare triple {387401#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {387401#true} is VALID [2022-04-15 11:55:59,763 INFO L290 TraceCheckUtils]: 132: Hoare triple {387401#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,763 INFO L290 TraceCheckUtils]: 133: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,763 INFO L290 TraceCheckUtils]: 134: Hoare triple {387406#(<= 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); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,763 INFO L290 TraceCheckUtils]: 135: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,764 INFO L290 TraceCheckUtils]: 136: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,764 INFO L290 TraceCheckUtils]: 137: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,764 INFO L290 TraceCheckUtils]: 138: Hoare triple {387406#(<= 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); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,764 INFO L290 TraceCheckUtils]: 139: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,765 INFO L290 TraceCheckUtils]: 140: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,765 INFO L290 TraceCheckUtils]: 141: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,765 INFO L290 TraceCheckUtils]: 142: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,765 INFO L290 TraceCheckUtils]: 143: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,766 INFO L290 TraceCheckUtils]: 144: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,766 INFO L290 TraceCheckUtils]: 145: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,766 INFO L290 TraceCheckUtils]: 146: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,766 INFO L290 TraceCheckUtils]: 147: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,767 INFO L290 TraceCheckUtils]: 148: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,767 INFO L290 TraceCheckUtils]: 149: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,767 INFO L290 TraceCheckUtils]: 150: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,767 INFO L290 TraceCheckUtils]: 151: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,768 INFO L290 TraceCheckUtils]: 152: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,768 INFO L290 TraceCheckUtils]: 153: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,768 INFO L290 TraceCheckUtils]: 154: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,768 INFO L290 TraceCheckUtils]: 155: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,769 INFO L290 TraceCheckUtils]: 156: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,769 INFO L290 TraceCheckUtils]: 157: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,769 INFO L290 TraceCheckUtils]: 158: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,769 INFO L290 TraceCheckUtils]: 159: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,770 INFO L290 TraceCheckUtils]: 160: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume 8448 == #t~mem68;havoc #t~mem68; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,770 INFO L290 TraceCheckUtils]: 161: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(~num1~0 > 0); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,770 INFO L290 TraceCheckUtils]: 162: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} call #t~mem132.base, #t~mem132.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem133 := read~int(#t~mem132.base, 844 + #t~mem132.offset, 4);call write~int(#t~mem133, ~s.base, 52 + ~s.offset, 4);havoc #t~mem132.base, #t~mem132.offset;havoc #t~mem133; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,770 INFO L290 TraceCheckUtils]: 163: Hoare triple {387406#(<= 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); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,771 INFO L290 TraceCheckUtils]: 164: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,771 INFO L290 TraceCheckUtils]: 165: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} ~skip~0 := 0; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,771 INFO L290 TraceCheckUtils]: 166: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !false; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,772 INFO L290 TraceCheckUtils]: 167: Hoare triple {387406#(<= 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); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,772 INFO L290 TraceCheckUtils]: 168: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,772 INFO L290 TraceCheckUtils]: 169: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,772 INFO L290 TraceCheckUtils]: 170: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,773 INFO L290 TraceCheckUtils]: 171: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,773 INFO L290 TraceCheckUtils]: 172: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,773 INFO L290 TraceCheckUtils]: 173: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,773 INFO L290 TraceCheckUtils]: 174: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,773 INFO L290 TraceCheckUtils]: 175: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,774 INFO L290 TraceCheckUtils]: 176: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,774 INFO L290 TraceCheckUtils]: 177: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,774 INFO L290 TraceCheckUtils]: 178: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,774 INFO L290 TraceCheckUtils]: 179: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,775 INFO L290 TraceCheckUtils]: 180: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,775 INFO L290 TraceCheckUtils]: 181: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,775 INFO L290 TraceCheckUtils]: 182: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,775 INFO L290 TraceCheckUtils]: 183: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,776 INFO L290 TraceCheckUtils]: 184: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,776 INFO L290 TraceCheckUtils]: 185: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,776 INFO L290 TraceCheckUtils]: 186: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,776 INFO L290 TraceCheckUtils]: 187: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,777 INFO L290 TraceCheckUtils]: 188: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,777 INFO L290 TraceCheckUtils]: 189: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,777 INFO L290 TraceCheckUtils]: 190: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,777 INFO L290 TraceCheckUtils]: 191: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,778 INFO L290 TraceCheckUtils]: 192: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,778 INFO L290 TraceCheckUtils]: 193: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,778 INFO L290 TraceCheckUtils]: 194: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,778 INFO L290 TraceCheckUtils]: 195: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,779 INFO L290 TraceCheckUtils]: 196: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume 8640 == #t~mem75;havoc #t~mem75; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,779 INFO L290 TraceCheckUtils]: 197: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,779 INFO L290 TraceCheckUtils]: 198: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(9 == ~blastFlag~0); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,779 INFO L290 TraceCheckUtils]: 199: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume !(12 == ~blastFlag~0); {387406#(<= ssl3_accept_~blastFlag~0 5)} is VALID [2022-04-15 11:55:59,780 INFO L290 TraceCheckUtils]: 200: Hoare triple {387406#(<= ssl3_accept_~blastFlag~0 5)} assume 15 == ~blastFlag~0; {387402#false} is VALID [2022-04-15 11:55:59,780 INFO L290 TraceCheckUtils]: 201: Hoare triple {387402#false} assume !false; {387402#false} is VALID [2022-04-15 11:55:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-04-15 11:55:59,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:55:59,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049721335] [2022-04-15 11:55:59,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049721335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:59,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:59,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:55:59,781 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:55:59,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [81039198] [2022-04-15 11:55:59,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [81039198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:55:59,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:55:59,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:55:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388320988] [2022-04-15 11:55:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:55:59,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 202 [2022-04-15 11:55:59,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:55:59,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:55:59,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:55:59,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:55:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:55:59,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:55:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:55:59,850 INFO L87 Difference]: Start difference. First operand 1747 states and 2512 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:01,530 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-15 11:56:03,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:56:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:08,659 INFO L93 Difference]: Finished difference Result 4030 states and 5818 transitions. [2022-04-15 11:56:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:56:08,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 202 [2022-04-15 11:56:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:56:08,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2022-04-15 11:56:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2022-04-15 11:56:08,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 642 transitions. [2022-04-15 11:56:09,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 642 edges. 642 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:09,375 INFO L225 Difference]: With dead ends: 4030 [2022-04-15 11:56:09,375 INFO L226 Difference]: Without dead ends: 2311 [2022-04-15 11:56:09,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:56:09,377 INFO L913 BasicCegarLoop]: 202 mSDtfsCounter, 159 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:56:09,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 387 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 11:56:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-04-15 11:56:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2022-04-15 11:56:10,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:56:10,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2311 states. Second operand has 2311 states, 2306 states have (on average 1.4414570685169124) internal successors, (3324), 2306 states have internal predecessors, (3324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:10,296 INFO L74 IsIncluded]: Start isIncluded. First operand 2311 states. Second operand has 2311 states, 2306 states have (on average 1.4414570685169124) internal successors, (3324), 2306 states have internal predecessors, (3324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:10,297 INFO L87 Difference]: Start difference. First operand 2311 states. Second operand has 2311 states, 2306 states have (on average 1.4414570685169124) internal successors, (3324), 2306 states have internal predecessors, (3324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:10,457 INFO L93 Difference]: Finished difference Result 2311 states and 3328 transitions. [2022-04-15 11:56:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3328 transitions. [2022-04-15 11:56:10,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:10,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:10,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 2311 states, 2306 states have (on average 1.4414570685169124) internal successors, (3324), 2306 states have internal predecessors, (3324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2311 states. [2022-04-15 11:56:10,462 INFO L87 Difference]: Start difference. First operand has 2311 states, 2306 states have (on average 1.4414570685169124) internal successors, (3324), 2306 states have internal predecessors, (3324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2311 states. [2022-04-15 11:56:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:10,613 INFO L93 Difference]: Finished difference Result 2311 states and 3328 transitions. [2022-04-15 11:56:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3328 transitions. [2022-04-15 11:56:10,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:10,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:10,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:56:10,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:56:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2311 states, 2306 states have (on average 1.4414570685169124) internal successors, (3324), 2306 states have internal predecessors, (3324), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 3328 transitions. [2022-04-15 11:56:10,866 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 3328 transitions. Word has length 202 [2022-04-15 11:56:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:56:10,866 INFO L478 AbstractCegarLoop]: Abstraction has 2311 states and 3328 transitions. [2022-04-15 11:56:10,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:10,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2311 states and 3328 transitions. [2022-04-15 11:56:15,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3328 edges. 3328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3328 transitions. [2022-04-15 11:56:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-04-15 11:56:15,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:56:15,219 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:56:15,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-15 11:56:15,219 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:56:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:56:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash -847930299, now seen corresponding path program 1 times [2022-04-15 11:56:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:15,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1493443239] [2022-04-15 11:56:15,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:56:15,467 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:56:15,467 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:56:15,467 INFO L85 PathProgramCache]: Analyzing trace with hash -847930299, now seen corresponding path program 2 times [2022-04-15 11:56:15,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:56:15,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977274650] [2022-04-15 11:56:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:56:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:56:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:56:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:15,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {404721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {404714#true} is VALID [2022-04-15 11:56:15,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {404714#true} assume true; {404714#true} is VALID [2022-04-15 11:56:15,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {404714#true} {404714#true} #725#return; {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {404714#true} call ULTIMATE.init(); {404721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:56:15,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {404721#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {404714#true} assume true; {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {404714#true} {404714#true} #725#return; {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {404714#true} call #t~ret161 := main(); {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {404714#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; {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {404714#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L272 TraceCheckUtils]: 7: Hoare triple {404714#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {404714#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); {404714#true} is VALID [2022-04-15 11:56:15,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {404714#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; {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {404714#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; {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {404714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {404714#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {404714#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {404714#true} assume !false; {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {404714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {404714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {404714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {404714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {404714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {404714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {404714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {404714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {404714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {404714#true} assume 8464 == #t~mem55;havoc #t~mem55; {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {404714#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; {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {404714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {404714#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); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {404714#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); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {404714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {404714#true} ~skip~0 := 0; {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {404714#true} assume !false; {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {404714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {404714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {404714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {404714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {404714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {404714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {404714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {404714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {404714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {404714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {404714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {404714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {404714#true} assume 8496 == #t~mem58;havoc #t~mem58; {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {404714#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {404714#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {404714#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {404714#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {404714#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {404714#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); {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {404714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {404714#true} ~skip~0 := 0; {404714#true} is VALID [2022-04-15 11:56:15,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {404714#true} assume !false; {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {404714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {404714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {404714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {404714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {404714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {404714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {404714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {404714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {404714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {404714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 64: Hoare triple {404714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {404714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 66: Hoare triple {404714#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {404714#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {404714#true} assume 8512 == #t~mem60;havoc #t~mem60; {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {404714#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {404714#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 71: Hoare triple {404714#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {404714#true} assume !(~ret~0 <= 0); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {404714#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {404714#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); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {404714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {404714#true} ~skip~0 := 0; {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {404714#true} assume !false; {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 78: Hoare triple {404714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {404714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 80: Hoare triple {404714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {404714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,665 INFO L290 TraceCheckUtils]: 82: Hoare triple {404714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 83: Hoare triple {404714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 84: Hoare triple {404714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 85: Hoare triple {404714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 86: Hoare triple {404714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 87: Hoare triple {404714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 88: Hoare triple {404714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 89: Hoare triple {404714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 90: Hoare triple {404714#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 91: Hoare triple {404714#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 92: Hoare triple {404714#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 93: Hoare triple {404714#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 94: Hoare triple {404714#true} assume 8528 == #t~mem62;havoc #t~mem62; {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 95: Hoare triple {404714#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,666 INFO L290 TraceCheckUtils]: 96: Hoare triple {404714#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {404714#true} is VALID [2022-04-15 11:56:15,667 INFO L290 TraceCheckUtils]: 97: Hoare triple {404714#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {404714#true} is VALID [2022-04-15 11:56:15,667 INFO L290 TraceCheckUtils]: 98: Hoare triple {404714#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {404714#true} is VALID [2022-04-15 11:56:15,667 INFO L290 TraceCheckUtils]: 99: Hoare triple {404714#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {404714#true} is VALID [2022-04-15 11:56:15,667 INFO L290 TraceCheckUtils]: 100: Hoare triple {404714#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {404714#true} is VALID [2022-04-15 11:56:15,667 INFO L290 TraceCheckUtils]: 101: Hoare triple {404714#true} assume !(~ret~0 <= 0); {404714#true} is VALID [2022-04-15 11:56:15,668 INFO L290 TraceCheckUtils]: 102: Hoare triple {404714#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,668 INFO L290 TraceCheckUtils]: 103: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,669 INFO L290 TraceCheckUtils]: 104: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,669 INFO L290 TraceCheckUtils]: 105: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,669 INFO L290 TraceCheckUtils]: 106: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,670 INFO L290 TraceCheckUtils]: 107: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,670 INFO L290 TraceCheckUtils]: 108: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,670 INFO L290 TraceCheckUtils]: 109: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,671 INFO L290 TraceCheckUtils]: 110: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,671 INFO L290 TraceCheckUtils]: 111: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,671 INFO L290 TraceCheckUtils]: 112: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,672 INFO L290 TraceCheckUtils]: 113: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,672 INFO L290 TraceCheckUtils]: 114: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,672 INFO L290 TraceCheckUtils]: 115: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,673 INFO L290 TraceCheckUtils]: 116: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,673 INFO L290 TraceCheckUtils]: 117: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,673 INFO L290 TraceCheckUtils]: 118: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,674 INFO L290 TraceCheckUtils]: 119: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,674 INFO L290 TraceCheckUtils]: 120: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,675 INFO L290 TraceCheckUtils]: 121: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,675 INFO L290 TraceCheckUtils]: 122: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,675 INFO L290 TraceCheckUtils]: 123: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,676 INFO L290 TraceCheckUtils]: 124: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,676 INFO L290 TraceCheckUtils]: 125: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,676 INFO L290 TraceCheckUtils]: 126: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,677 INFO L290 TraceCheckUtils]: 127: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,677 INFO L290 TraceCheckUtils]: 128: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:15,677 INFO L290 TraceCheckUtils]: 129: Hoare triple {404719#(not (= 8576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {404720#(not (= 8576 |ssl3_accept_#t~mem69|))} is VALID [2022-04-15 11:56:15,678 INFO L290 TraceCheckUtils]: 130: Hoare triple {404720#(not (= 8576 |ssl3_accept_#t~mem69|))} assume 8576 == #t~mem69;havoc #t~mem69; {404715#false} is VALID [2022-04-15 11:56:15,678 INFO L290 TraceCheckUtils]: 131: Hoare triple {404715#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {404715#false} is VALID [2022-04-15 11:56:15,678 INFO L290 TraceCheckUtils]: 132: Hoare triple {404715#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {404715#false} is VALID [2022-04-15 11:56:15,678 INFO L290 TraceCheckUtils]: 133: Hoare triple {404715#false} assume !(~ret~0 <= 0); {404715#false} is VALID [2022-04-15 11:56:15,678 INFO L290 TraceCheckUtils]: 134: Hoare triple {404715#false} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {404715#false} is VALID [2022-04-15 11:56:15,678 INFO L290 TraceCheckUtils]: 135: Hoare triple {404715#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {404715#false} is VALID [2022-04-15 11:56:15,678 INFO L290 TraceCheckUtils]: 136: Hoare triple {404715#false} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 137: Hoare triple {404715#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); {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 138: Hoare triple {404715#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 139: Hoare triple {404715#false} ~skip~0 := 0; {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 140: Hoare triple {404715#false} assume !false; {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 141: Hoare triple {404715#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); {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 142: Hoare triple {404715#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 143: Hoare triple {404715#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 144: Hoare triple {404715#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 145: Hoare triple {404715#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,679 INFO L290 TraceCheckUtils]: 146: Hoare triple {404715#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 147: Hoare triple {404715#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 148: Hoare triple {404715#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 149: Hoare triple {404715#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 150: Hoare triple {404715#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 151: Hoare triple {404715#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 152: Hoare triple {404715#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 153: Hoare triple {404715#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 154: Hoare triple {404715#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 155: Hoare triple {404715#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,680 INFO L290 TraceCheckUtils]: 156: Hoare triple {404715#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 157: Hoare triple {404715#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 158: Hoare triple {404715#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 159: Hoare triple {404715#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 160: Hoare triple {404715#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 161: Hoare triple {404715#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 162: Hoare triple {404715#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 163: Hoare triple {404715#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 164: Hoare triple {404715#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 165: Hoare triple {404715#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 166: Hoare triple {404715#false} assume 8592 == #t~mem71;havoc #t~mem71; {404715#false} is VALID [2022-04-15 11:56:15,681 INFO L290 TraceCheckUtils]: 167: Hoare triple {404715#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 168: Hoare triple {404715#false} assume !(7 == ~blastFlag~0); {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 169: Hoare triple {404715#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 170: Hoare triple {404715#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); {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 171: Hoare triple {404715#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 172: Hoare triple {404715#false} ~skip~0 := 0; {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 173: Hoare triple {404715#false} assume !false; {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 174: Hoare triple {404715#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); {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 175: Hoare triple {404715#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 176: Hoare triple {404715#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 177: Hoare triple {404715#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,682 INFO L290 TraceCheckUtils]: 178: Hoare triple {404715#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 179: Hoare triple {404715#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 180: Hoare triple {404715#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 181: Hoare triple {404715#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 182: Hoare triple {404715#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 183: Hoare triple {404715#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 184: Hoare triple {404715#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 185: Hoare triple {404715#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 186: Hoare triple {404715#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 187: Hoare triple {404715#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 188: Hoare triple {404715#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,683 INFO L290 TraceCheckUtils]: 189: Hoare triple {404715#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 190: Hoare triple {404715#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 191: Hoare triple {404715#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 192: Hoare triple {404715#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 193: Hoare triple {404715#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 194: Hoare triple {404715#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 195: Hoare triple {404715#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 196: Hoare triple {404715#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 197: Hoare triple {404715#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 198: Hoare triple {404715#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 199: Hoare triple {404715#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,684 INFO L290 TraceCheckUtils]: 200: Hoare triple {404715#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 201: Hoare triple {404715#false} assume 8608 == #t~mem73;havoc #t~mem73; {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 202: Hoare triple {404715#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 203: Hoare triple {404715#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 204: Hoare triple {404715#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); {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 205: Hoare triple {404715#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); {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 206: Hoare triple {404715#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 207: Hoare triple {404715#false} ~skip~0 := 0; {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 208: Hoare triple {404715#false} assume !false; {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 209: Hoare triple {404715#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); {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 210: Hoare triple {404715#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 211: Hoare triple {404715#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,685 INFO L290 TraceCheckUtils]: 212: Hoare triple {404715#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 213: Hoare triple {404715#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 214: Hoare triple {404715#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 215: Hoare triple {404715#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 216: Hoare triple {404715#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 217: Hoare triple {404715#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 218: Hoare triple {404715#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 219: Hoare triple {404715#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 220: Hoare triple {404715#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 221: Hoare triple {404715#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 222: Hoare triple {404715#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 223: Hoare triple {404715#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,686 INFO L290 TraceCheckUtils]: 224: Hoare triple {404715#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 225: Hoare triple {404715#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 226: Hoare triple {404715#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 227: Hoare triple {404715#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 228: Hoare triple {404715#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 229: Hoare triple {404715#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 230: Hoare triple {404715#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 231: Hoare triple {404715#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 232: Hoare triple {404715#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 233: Hoare triple {404715#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,687 INFO L290 TraceCheckUtils]: 234: Hoare triple {404715#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 235: Hoare triple {404715#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 236: Hoare triple {404715#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 237: Hoare triple {404715#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 238: Hoare triple {404715#false} assume 8640 == #t~mem75;havoc #t~mem75; {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 239: Hoare triple {404715#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 240: Hoare triple {404715#false} assume !(9 == ~blastFlag~0); {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 241: Hoare triple {404715#false} assume !(12 == ~blastFlag~0); {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 242: Hoare triple {404715#false} assume 15 == ~blastFlag~0; {404715#false} is VALID [2022-04-15 11:56:15,688 INFO L290 TraceCheckUtils]: 243: Hoare triple {404715#false} assume !false; {404715#false} is VALID [2022-04-15 11:56:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-04-15 11:56:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:56:15,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977274650] [2022-04-15 11:56:15,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977274650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:15,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:15,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:15,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:56:15,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1493443239] [2022-04-15 11:56:15,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1493443239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:15,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:15,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360752858] [2022-04-15 11:56:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:56:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 244 [2022-04-15 11:56:15,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:56:15,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:15,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:15,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:56:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:56:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:56:15,790 INFO L87 Difference]: Start difference. First operand 2311 states and 3328 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:17,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:56:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:22,326 INFO L93 Difference]: Finished difference Result 5027 states and 7220 transitions. [2022-04-15 11:56:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:56:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 244 [2022-04-15 11:56:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:56:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-15 11:56:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:22,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-15 11:56:22,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 602 transitions. [2022-04-15 11:56:22,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:23,017 INFO L225 Difference]: With dead ends: 5027 [2022-04-15 11:56:23,017 INFO L226 Difference]: Without dead ends: 2744 [2022-04-15 11:56:23,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:56:23,020 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 120 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 53 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 11:56:23,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 414 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 11:56:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2022-04-15 11:56:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 2443. [2022-04-15 11:56:23,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:56:24,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2744 states. Second operand has 2443 states, 2438 states have (on average 1.4339622641509433) internal successors, (3496), 2438 states have internal predecessors, (3496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:24,001 INFO L74 IsIncluded]: Start isIncluded. First operand 2744 states. Second operand has 2443 states, 2438 states have (on average 1.4339622641509433) internal successors, (3496), 2438 states have internal predecessors, (3496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:24,002 INFO L87 Difference]: Start difference. First operand 2744 states. Second operand has 2443 states, 2438 states have (on average 1.4339622641509433) internal successors, (3496), 2438 states have internal predecessors, (3496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:24,252 INFO L93 Difference]: Finished difference Result 2744 states and 3900 transitions. [2022-04-15 11:56:24,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3900 transitions. [2022-04-15 11:56:24,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:24,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:24,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 2443 states, 2438 states have (on average 1.4339622641509433) internal successors, (3496), 2438 states have internal predecessors, (3496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2744 states. [2022-04-15 11:56:24,257 INFO L87 Difference]: Start difference. First operand has 2443 states, 2438 states have (on average 1.4339622641509433) internal successors, (3496), 2438 states have internal predecessors, (3496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2744 states. [2022-04-15 11:56:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:24,502 INFO L93 Difference]: Finished difference Result 2744 states and 3900 transitions. [2022-04-15 11:56:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3900 transitions. [2022-04-15 11:56:24,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:24,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:24,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:56:24,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:56:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2438 states have (on average 1.4339622641509433) internal successors, (3496), 2438 states have internal predecessors, (3496), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3500 transitions. [2022-04-15 11:56:24,816 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3500 transitions. Word has length 244 [2022-04-15 11:56:24,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:56:24,816 INFO L478 AbstractCegarLoop]: Abstraction has 2443 states and 3500 transitions. [2022-04-15 11:56:24,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:24,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2443 states and 3500 transitions. [2022-04-15 11:56:28,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3500 edges. 3500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3500 transitions. [2022-04-15 11:56:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-04-15 11:56:28,998 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:56:28,998 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:56:28,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-15 11:56:28,999 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:56:28,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:56:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash -581914151, now seen corresponding path program 1 times [2022-04-15 11:56:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:28,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373878019] [2022-04-15 11:56:29,208 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:56:29,209 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:56:29,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:56:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -581914151, now seen corresponding path program 2 times [2022-04-15 11:56:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:56:29,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029746299] [2022-04-15 11:56:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:56:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:56:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:56:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:29,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {425161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {425154#true} is VALID [2022-04-15 11:56:29,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {425154#true} assume true; {425154#true} is VALID [2022-04-15 11:56:29,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {425154#true} {425154#true} #725#return; {425154#true} is VALID [2022-04-15 11:56:29,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {425154#true} call ULTIMATE.init(); {425161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:56:29,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {425161#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {425154#true} is VALID [2022-04-15 11:56:29,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {425154#true} assume true; {425154#true} is VALID [2022-04-15 11:56:29,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425154#true} {425154#true} #725#return; {425154#true} is VALID [2022-04-15 11:56:29,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {425154#true} call #t~ret161 := main(); {425154#true} is VALID [2022-04-15 11:56:29,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {425154#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; {425154#true} is VALID [2022-04-15 11:56:29,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {425154#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L272 TraceCheckUtils]: 7: Hoare triple {425154#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {425154#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); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {425154#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; {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {425154#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; {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {425154#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {425154#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {425154#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {425154#true} assume !false; {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {425154#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {425154#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {425154#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {425154#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {425154#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {425154#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {425154#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {425154#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {425154#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {425154#true} assume 8464 == #t~mem55;havoc #t~mem55; {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {425154#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; {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {425154#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {425154#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); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {425154#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); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {425154#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {425154#true} ~skip~0 := 0; {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {425154#true} assume !false; {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {425154#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {425154#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {425154#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {425154#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {425154#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {425154#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {425154#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {425154#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {425154#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {425154#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {425154#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {425154#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {425154#true} assume 8496 == #t~mem58;havoc #t~mem58; {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {425154#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {425154#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 47: Hoare triple {425154#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {425154#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 49: Hoare triple {425154#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 50: Hoare triple {425154#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); {425154#true} is VALID [2022-04-15 11:56:29,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {425154#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {425154#true} ~skip~0 := 0; {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 53: Hoare triple {425154#true} assume !false; {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 54: Hoare triple {425154#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 55: Hoare triple {425154#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {425154#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {425154#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {425154#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 59: Hoare triple {425154#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {425154#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {425154#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {425154#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {425154#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {425154#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {425154#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {425154#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 67: Hoare triple {425154#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 68: Hoare triple {425154#true} assume 8512 == #t~mem60;havoc #t~mem60; {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 69: Hoare triple {425154#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 70: Hoare triple {425154#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 71: Hoare triple {425154#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {425154#true} assume !(~ret~0 <= 0); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 73: Hoare triple {425154#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 74: Hoare triple {425154#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); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 75: Hoare triple {425154#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 76: Hoare triple {425154#true} ~skip~0 := 0; {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 77: Hoare triple {425154#true} assume !false; {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 78: Hoare triple {425154#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 79: Hoare triple {425154#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,373 INFO L290 TraceCheckUtils]: 80: Hoare triple {425154#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {425154#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {425154#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {425154#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {425154#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {425154#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {425154#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {425154#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 88: Hoare triple {425154#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {425154#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {425154#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {425154#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {425154#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {425154#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 94: Hoare triple {425154#true} assume 8528 == #t~mem62;havoc #t~mem62; {425154#true} is VALID [2022-04-15 11:56:29,374 INFO L290 TraceCheckUtils]: 95: Hoare triple {425154#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {425154#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {425154#true} is VALID [2022-04-15 11:56:29,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {425154#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {425154#true} is VALID [2022-04-15 11:56:29,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {425154#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {425154#true} is VALID [2022-04-15 11:56:29,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {425154#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {425154#true} is VALID [2022-04-15 11:56:29,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {425154#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {425154#true} is VALID [2022-04-15 11:56:29,375 INFO L290 TraceCheckUtils]: 101: Hoare triple {425154#true} assume !(~ret~0 <= 0); {425154#true} is VALID [2022-04-15 11:56:29,376 INFO L290 TraceCheckUtils]: 102: Hoare triple {425154#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,376 INFO L290 TraceCheckUtils]: 103: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,377 INFO L290 TraceCheckUtils]: 104: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,377 INFO L290 TraceCheckUtils]: 105: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,377 INFO L290 TraceCheckUtils]: 106: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,378 INFO L290 TraceCheckUtils]: 107: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,378 INFO L290 TraceCheckUtils]: 108: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,378 INFO L290 TraceCheckUtils]: 109: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,379 INFO L290 TraceCheckUtils]: 110: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,379 INFO L290 TraceCheckUtils]: 111: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,379 INFO L290 TraceCheckUtils]: 112: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,380 INFO L290 TraceCheckUtils]: 113: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,380 INFO L290 TraceCheckUtils]: 114: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,380 INFO L290 TraceCheckUtils]: 115: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,381 INFO L290 TraceCheckUtils]: 116: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,382 INFO L290 TraceCheckUtils]: 119: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,382 INFO L290 TraceCheckUtils]: 120: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,382 INFO L290 TraceCheckUtils]: 121: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,383 INFO L290 TraceCheckUtils]: 122: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,383 INFO L290 TraceCheckUtils]: 123: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,383 INFO L290 TraceCheckUtils]: 124: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,384 INFO L290 TraceCheckUtils]: 125: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,384 INFO L290 TraceCheckUtils]: 126: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,384 INFO L290 TraceCheckUtils]: 127: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,385 INFO L290 TraceCheckUtils]: 128: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,385 INFO L290 TraceCheckUtils]: 129: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 130: Hoare triple {425159#(not (= 8577 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {425160#(not (= |ssl3_accept_#t~mem70| 8577))} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 131: Hoare triple {425160#(not (= |ssl3_accept_#t~mem70| 8577))} assume 8577 == #t~mem70;havoc #t~mem70; {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 132: Hoare triple {425155#false} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 133: Hoare triple {425155#false} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 134: Hoare triple {425155#false} assume !(~ret~0 <= 0); {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 135: Hoare triple {425155#false} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 136: Hoare triple {425155#false} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 137: Hoare triple {425155#false} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 138: Hoare triple {425155#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); {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 139: Hoare triple {425155#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {425155#false} is VALID [2022-04-15 11:56:29,386 INFO L290 TraceCheckUtils]: 140: Hoare triple {425155#false} ~skip~0 := 0; {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 141: Hoare triple {425155#false} assume !false; {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 142: Hoare triple {425155#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); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 143: Hoare triple {425155#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 144: Hoare triple {425155#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 145: Hoare triple {425155#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 146: Hoare triple {425155#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 147: Hoare triple {425155#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 148: Hoare triple {425155#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 149: Hoare triple {425155#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 150: Hoare triple {425155#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 151: Hoare triple {425155#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 152: Hoare triple {425155#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 153: Hoare triple {425155#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 154: Hoare triple {425155#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,387 INFO L290 TraceCheckUtils]: 155: Hoare triple {425155#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 156: Hoare triple {425155#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 157: Hoare triple {425155#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 158: Hoare triple {425155#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 159: Hoare triple {425155#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 160: Hoare triple {425155#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 161: Hoare triple {425155#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 162: Hoare triple {425155#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 163: Hoare triple {425155#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 164: Hoare triple {425155#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 165: Hoare triple {425155#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 166: Hoare triple {425155#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 167: Hoare triple {425155#false} assume 8592 == #t~mem71;havoc #t~mem71; {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 168: Hoare triple {425155#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 169: Hoare triple {425155#false} assume !(7 == ~blastFlag~0); {425155#false} is VALID [2022-04-15 11:56:29,388 INFO L290 TraceCheckUtils]: 170: Hoare triple {425155#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 171: Hoare triple {425155#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); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 172: Hoare triple {425155#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 173: Hoare triple {425155#false} ~skip~0 := 0; {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 174: Hoare triple {425155#false} assume !false; {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 175: Hoare triple {425155#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); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 176: Hoare triple {425155#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 177: Hoare triple {425155#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 178: Hoare triple {425155#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 179: Hoare triple {425155#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 180: Hoare triple {425155#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 181: Hoare triple {425155#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 182: Hoare triple {425155#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 183: Hoare triple {425155#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 184: Hoare triple {425155#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,389 INFO L290 TraceCheckUtils]: 185: Hoare triple {425155#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 186: Hoare triple {425155#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 187: Hoare triple {425155#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 188: Hoare triple {425155#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 189: Hoare triple {425155#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 190: Hoare triple {425155#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 191: Hoare triple {425155#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 192: Hoare triple {425155#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 193: Hoare triple {425155#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 194: Hoare triple {425155#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 195: Hoare triple {425155#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 196: Hoare triple {425155#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 197: Hoare triple {425155#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 198: Hoare triple {425155#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 199: Hoare triple {425155#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,390 INFO L290 TraceCheckUtils]: 200: Hoare triple {425155#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 201: Hoare triple {425155#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 202: Hoare triple {425155#false} assume 8608 == #t~mem73;havoc #t~mem73; {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 203: Hoare triple {425155#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 204: Hoare triple {425155#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 205: Hoare triple {425155#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); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 206: Hoare triple {425155#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); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 207: Hoare triple {425155#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 208: Hoare triple {425155#false} ~skip~0 := 0; {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 209: Hoare triple {425155#false} assume !false; {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 210: Hoare triple {425155#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); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 211: Hoare triple {425155#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 212: Hoare triple {425155#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 213: Hoare triple {425155#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 214: Hoare triple {425155#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,391 INFO L290 TraceCheckUtils]: 215: Hoare triple {425155#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 216: Hoare triple {425155#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 217: Hoare triple {425155#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 218: Hoare triple {425155#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 219: Hoare triple {425155#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 220: Hoare triple {425155#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 221: Hoare triple {425155#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 222: Hoare triple {425155#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 223: Hoare triple {425155#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 224: Hoare triple {425155#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 225: Hoare triple {425155#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 226: Hoare triple {425155#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 227: Hoare triple {425155#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 228: Hoare triple {425155#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 229: Hoare triple {425155#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,392 INFO L290 TraceCheckUtils]: 230: Hoare triple {425155#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 231: Hoare triple {425155#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 232: Hoare triple {425155#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 233: Hoare triple {425155#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 234: Hoare triple {425155#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 235: Hoare triple {425155#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 236: Hoare triple {425155#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 237: Hoare triple {425155#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 238: Hoare triple {425155#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 239: Hoare triple {425155#false} assume 8640 == #t~mem75;havoc #t~mem75; {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 240: Hoare triple {425155#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 241: Hoare triple {425155#false} assume !(9 == ~blastFlag~0); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 242: Hoare triple {425155#false} assume !(12 == ~blastFlag~0); {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 243: Hoare triple {425155#false} assume 15 == ~blastFlag~0; {425155#false} is VALID [2022-04-15 11:56:29,393 INFO L290 TraceCheckUtils]: 244: Hoare triple {425155#false} assume !false; {425155#false} is VALID [2022-04-15 11:56:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-04-15 11:56:29,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:56:29,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029746299] [2022-04-15 11:56:29,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029746299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:29,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:29,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:29,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:56:29,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373878019] [2022-04-15 11:56:29,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373878019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:29,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:29,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 11:56:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545549086] [2022-04-15 11:56:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:56:29,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 245 [2022-04-15 11:56:29,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:56:29,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:29,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:29,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 11:56:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 11:56:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 11:56:29,483 INFO L87 Difference]: Start difference. First operand 2443 states and 3500 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:38,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:56:42,097 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-15 11:56:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:46,581 INFO L93 Difference]: Finished difference Result 5123 states and 7324 transitions. [2022-04-15 11:56:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 11:56:46,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 245 [2022-04-15 11:56:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:56:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-15 11:56:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2022-04-15 11:56:46,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 602 transitions. [2022-04-15 11:56:46,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 602 edges. 602 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:47,305 INFO L225 Difference]: With dead ends: 5123 [2022-04-15 11:56:47,305 INFO L226 Difference]: Without dead ends: 2708 [2022-04-15 11:56:47,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 11:56:47,308 INFO L913 BasicCegarLoop]: 150 mSDtfsCounter, 119 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:56:47,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 420 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:56:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2022-04-15 11:56:48,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2443. [2022-04-15 11:56:48,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:56:48,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2708 states. Second operand has 2443 states, 2438 states have (on average 1.424118129614438) internal successors, (3472), 2438 states have internal predecessors, (3472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:48,253 INFO L74 IsIncluded]: Start isIncluded. First operand 2708 states. Second operand has 2443 states, 2438 states have (on average 1.424118129614438) internal successors, (3472), 2438 states have internal predecessors, (3472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:48,255 INFO L87 Difference]: Start difference. First operand 2708 states. Second operand has 2443 states, 2438 states have (on average 1.424118129614438) internal successors, (3472), 2438 states have internal predecessors, (3472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:48,454 INFO L93 Difference]: Finished difference Result 2708 states and 3832 transitions. [2022-04-15 11:56:48,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3832 transitions. [2022-04-15 11:56:48,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:48,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:48,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 2443 states, 2438 states have (on average 1.424118129614438) internal successors, (3472), 2438 states have internal predecessors, (3472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2708 states. [2022-04-15 11:56:48,459 INFO L87 Difference]: Start difference. First operand has 2443 states, 2438 states have (on average 1.424118129614438) internal successors, (3472), 2438 states have internal predecessors, (3472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 2708 states. [2022-04-15 11:56:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:56:48,664 INFO L93 Difference]: Finished difference Result 2708 states and 3832 transitions. [2022-04-15 11:56:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3832 transitions. [2022-04-15 11:56:48,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:56:48,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:56:48,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:56:48,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:56:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2438 states have (on average 1.424118129614438) internal successors, (3472), 2438 states have internal predecessors, (3472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3476 transitions. [2022-04-15 11:56:48,969 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3476 transitions. Word has length 245 [2022-04-15 11:56:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:56:48,969 INFO L478 AbstractCegarLoop]: Abstraction has 2443 states and 3476 transitions. [2022-04-15 11:56:48,969 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:48,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2443 states and 3476 transitions. [2022-04-15 11:56:53,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3476 edges. 3476 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:53,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3476 transitions. [2022-04-15 11:56:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-15 11:56:53,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:56:53,074 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:56:53,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-15 11:56:53,074 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:56:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:56:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1524901599, now seen corresponding path program 1 times [2022-04-15 11:56:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:53,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1127743581] [2022-04-15 11:56:53,327 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:56:53,327 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:56:53,327 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:56:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1524901599, now seen corresponding path program 2 times [2022-04-15 11:56:53,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:56:53,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213518192] [2022-04-15 11:56:53,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:56:53,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:56:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:56:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:56:53,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {445720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {445714#true} is VALID [2022-04-15 11:56:53,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {445714#true} assume true; {445714#true} is VALID [2022-04-15 11:56:53,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {445714#true} {445714#true} #725#return; {445714#true} is VALID [2022-04-15 11:56:53,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {445714#true} call ULTIMATE.init(); {445720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:56:53,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {445720#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {445714#true} is VALID [2022-04-15 11:56:53,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {445714#true} assume true; {445714#true} is VALID [2022-04-15 11:56:53,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {445714#true} {445714#true} #725#return; {445714#true} is VALID [2022-04-15 11:56:53,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {445714#true} call #t~ret161 := main(); {445714#true} is VALID [2022-04-15 11:56:53,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {445714#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; {445714#true} is VALID [2022-04-15 11:56:53,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {445714#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,472 INFO L272 TraceCheckUtils]: 7: Hoare triple {445714#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {445714#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); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {445714#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; {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {445714#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; {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {445714#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {445714#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {445714#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {445714#true} assume !false; {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {445714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {445714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {445714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {445714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {445714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {445714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {445714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {445714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {445714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {445714#true} assume 8464 == #t~mem55;havoc #t~mem55; {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {445714#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; {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {445714#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {445714#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); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {445714#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); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {445714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {445714#true} ~skip~0 := 0; {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {445714#true} assume !false; {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {445714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 33: Hoare triple {445714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {445714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {445714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {445714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {445714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {445714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {445714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {445714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {445714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {445714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 43: Hoare triple {445714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 44: Hoare triple {445714#true} assume 8496 == #t~mem58;havoc #t~mem58; {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 45: Hoare triple {445714#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 46: Hoare triple {445714#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 47: Hoare triple {445714#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 48: Hoare triple {445714#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {445714#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {445714#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); {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 51: Hoare triple {445714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445714#true} is VALID [2022-04-15 11:56:53,475 INFO L290 TraceCheckUtils]: 52: Hoare triple {445714#true} ~skip~0 := 0; {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 53: Hoare triple {445714#true} assume !false; {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 54: Hoare triple {445714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 55: Hoare triple {445714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 56: Hoare triple {445714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 57: Hoare triple {445714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {445714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {445714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {445714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {445714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {445714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 63: Hoare triple {445714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {445714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {445714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {445714#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 67: Hoare triple {445714#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {445714#true} assume 8512 == #t~mem60;havoc #t~mem60; {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 69: Hoare triple {445714#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 70: Hoare triple {445714#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 71: Hoare triple {445714#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 72: Hoare triple {445714#true} assume !(~ret~0 <= 0); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 73: Hoare triple {445714#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 74: Hoare triple {445714#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); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 75: Hoare triple {445714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 76: Hoare triple {445714#true} ~skip~0 := 0; {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 77: Hoare triple {445714#true} assume !false; {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 78: Hoare triple {445714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 79: Hoare triple {445714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {445714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 81: Hoare triple {445714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,477 INFO L290 TraceCheckUtils]: 82: Hoare triple {445714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 83: Hoare triple {445714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 84: Hoare triple {445714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 85: Hoare triple {445714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 86: Hoare triple {445714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 87: Hoare triple {445714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 88: Hoare triple {445714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 89: Hoare triple {445714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 90: Hoare triple {445714#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 91: Hoare triple {445714#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 92: Hoare triple {445714#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 93: Hoare triple {445714#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 94: Hoare triple {445714#true} assume 8528 == #t~mem62;havoc #t~mem62; {445714#true} is VALID [2022-04-15 11:56:53,478 INFO L290 TraceCheckUtils]: 95: Hoare triple {445714#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 96: Hoare triple {445714#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 97: Hoare triple {445714#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 98: Hoare triple {445714#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 99: Hoare triple {445714#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 100: Hoare triple {445714#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 101: Hoare triple {445714#true} assume !(~ret~0 <= 0); {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 102: Hoare triple {445714#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 103: Hoare triple {445714#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); {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 104: Hoare triple {445714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 105: Hoare triple {445714#true} ~skip~0 := 0; {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 106: Hoare triple {445714#true} assume !false; {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 107: Hoare triple {445714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,479 INFO L290 TraceCheckUtils]: 108: Hoare triple {445714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 109: Hoare triple {445714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 110: Hoare triple {445714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 111: Hoare triple {445714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 112: Hoare triple {445714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {445714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 114: Hoare triple {445714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 115: Hoare triple {445714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 116: Hoare triple {445714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 117: Hoare triple {445714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 118: Hoare triple {445714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 119: Hoare triple {445714#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 120: Hoare triple {445714#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 121: Hoare triple {445714#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,480 INFO L290 TraceCheckUtils]: 122: Hoare triple {445714#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 123: Hoare triple {445714#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 124: Hoare triple {445714#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 125: Hoare triple {445714#true} assume 8544 == #t~mem64;havoc #t~mem64; {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 126: Hoare triple {445714#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 127: Hoare triple {445714#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 128: Hoare triple {445714#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 129: Hoare triple {445714#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 130: Hoare triple {445714#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 131: Hoare triple {445714#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 132: Hoare triple {445714#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 133: Hoare triple {445714#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 134: Hoare triple {445714#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); {445714#true} is VALID [2022-04-15 11:56:53,481 INFO L290 TraceCheckUtils]: 135: Hoare triple {445714#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 136: Hoare triple {445714#true} ~skip~0 := 0; {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 137: Hoare triple {445714#true} assume !false; {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 138: Hoare triple {445714#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 139: Hoare triple {445714#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 140: Hoare triple {445714#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 141: Hoare triple {445714#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 142: Hoare triple {445714#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 143: Hoare triple {445714#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 144: Hoare triple {445714#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 145: Hoare triple {445714#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 146: Hoare triple {445714#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 147: Hoare triple {445714#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 148: Hoare triple {445714#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,482 INFO L290 TraceCheckUtils]: 149: Hoare triple {445714#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 150: Hoare triple {445714#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 151: Hoare triple {445714#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 152: Hoare triple {445714#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 153: Hoare triple {445714#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 154: Hoare triple {445714#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 155: Hoare triple {445714#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 156: Hoare triple {445714#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 157: Hoare triple {445714#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 158: Hoare triple {445714#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 159: Hoare triple {445714#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 160: Hoare triple {445714#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 161: Hoare triple {445714#true} assume 8576 == #t~mem69;havoc #t~mem69; {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 162: Hoare triple {445714#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 163: Hoare triple {445714#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {445714#true} is VALID [2022-04-15 11:56:53,483 INFO L290 TraceCheckUtils]: 164: Hoare triple {445714#true} assume !(~ret~0 <= 0); {445714#true} is VALID [2022-04-15 11:56:53,484 INFO L290 TraceCheckUtils]: 165: Hoare triple {445714#true} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {445714#true} is VALID [2022-04-15 11:56:53,484 INFO L290 TraceCheckUtils]: 166: Hoare triple {445714#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,484 INFO L290 TraceCheckUtils]: 167: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,484 INFO L290 TraceCheckUtils]: 168: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,485 INFO L290 TraceCheckUtils]: 169: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,485 INFO L290 TraceCheckUtils]: 170: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} ~skip~0 := 0; {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,485 INFO L290 TraceCheckUtils]: 171: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !false; {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,485 INFO L290 TraceCheckUtils]: 172: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,486 INFO L290 TraceCheckUtils]: 173: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,486 INFO L290 TraceCheckUtils]: 174: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,486 INFO L290 TraceCheckUtils]: 175: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,487 INFO L290 TraceCheckUtils]: 176: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,487 INFO L290 TraceCheckUtils]: 177: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,487 INFO L290 TraceCheckUtils]: 178: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,487 INFO L290 TraceCheckUtils]: 179: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,488 INFO L290 TraceCheckUtils]: 180: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,488 INFO L290 TraceCheckUtils]: 181: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,488 INFO L290 TraceCheckUtils]: 182: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,488 INFO L290 TraceCheckUtils]: 183: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,489 INFO L290 TraceCheckUtils]: 184: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,489 INFO L290 TraceCheckUtils]: 185: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,489 INFO L290 TraceCheckUtils]: 186: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,489 INFO L290 TraceCheckUtils]: 187: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,490 INFO L290 TraceCheckUtils]: 188: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,490 INFO L290 TraceCheckUtils]: 189: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,490 INFO L290 TraceCheckUtils]: 190: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,491 INFO L290 TraceCheckUtils]: 191: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,491 INFO L290 TraceCheckUtils]: 192: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,491 INFO L290 TraceCheckUtils]: 193: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,491 INFO L290 TraceCheckUtils]: 194: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,492 INFO L290 TraceCheckUtils]: 195: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,492 INFO L290 TraceCheckUtils]: 196: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,492 INFO L290 TraceCheckUtils]: 197: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume 8592 == #t~mem71;havoc #t~mem71; {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,492 INFO L290 TraceCheckUtils]: 198: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 199: Hoare triple {445719#(= (+ (- 7) ssl3_accept_~blastFlag~0) 0)} assume !(7 == ~blastFlag~0); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 200: Hoare triple {445715#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 201: Hoare triple {445715#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); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 202: Hoare triple {445715#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 203: Hoare triple {445715#false} ~skip~0 := 0; {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 204: Hoare triple {445715#false} assume !false; {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 205: Hoare triple {445715#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); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 206: Hoare triple {445715#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 207: Hoare triple {445715#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 208: Hoare triple {445715#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 209: Hoare triple {445715#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,493 INFO L290 TraceCheckUtils]: 210: Hoare triple {445715#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 211: Hoare triple {445715#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 212: Hoare triple {445715#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 213: Hoare triple {445715#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 214: Hoare triple {445715#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 215: Hoare triple {445715#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 216: Hoare triple {445715#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 217: Hoare triple {445715#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 218: Hoare triple {445715#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 219: Hoare triple {445715#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 220: Hoare triple {445715#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 221: Hoare triple {445715#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 222: Hoare triple {445715#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 223: Hoare triple {445715#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 224: Hoare triple {445715#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,494 INFO L290 TraceCheckUtils]: 225: Hoare triple {445715#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 226: Hoare triple {445715#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 227: Hoare triple {445715#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 228: Hoare triple {445715#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 229: Hoare triple {445715#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 230: Hoare triple {445715#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 231: Hoare triple {445715#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 232: Hoare triple {445715#false} assume 8608 == #t~mem73;havoc #t~mem73; {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 233: Hoare triple {445715#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 234: Hoare triple {445715#false} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 235: Hoare triple {445715#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); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 236: Hoare triple {445715#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); {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 237: Hoare triple {445715#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 238: Hoare triple {445715#false} ~skip~0 := 0; {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 239: Hoare triple {445715#false} assume !false; {445715#false} is VALID [2022-04-15 11:56:53,495 INFO L290 TraceCheckUtils]: 240: Hoare triple {445715#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); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 241: Hoare triple {445715#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 242: Hoare triple {445715#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 243: Hoare triple {445715#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 244: Hoare triple {445715#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 245: Hoare triple {445715#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 246: Hoare triple {445715#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 247: Hoare triple {445715#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 248: Hoare triple {445715#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 249: Hoare triple {445715#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 250: Hoare triple {445715#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 251: Hoare triple {445715#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 252: Hoare triple {445715#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 253: Hoare triple {445715#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 254: Hoare triple {445715#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 255: Hoare triple {445715#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,496 INFO L290 TraceCheckUtils]: 256: Hoare triple {445715#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 257: Hoare triple {445715#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 258: Hoare triple {445715#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 259: Hoare triple {445715#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 260: Hoare triple {445715#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 261: Hoare triple {445715#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 262: Hoare triple {445715#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 263: Hoare triple {445715#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 264: Hoare triple {445715#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 265: Hoare triple {445715#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 266: Hoare triple {445715#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 267: Hoare triple {445715#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 268: Hoare triple {445715#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 269: Hoare triple {445715#false} assume 8640 == #t~mem75;havoc #t~mem75; {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 270: Hoare triple {445715#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {445715#false} is VALID [2022-04-15 11:56:53,497 INFO L290 TraceCheckUtils]: 271: Hoare triple {445715#false} assume !(9 == ~blastFlag~0); {445715#false} is VALID [2022-04-15 11:56:53,498 INFO L290 TraceCheckUtils]: 272: Hoare triple {445715#false} assume !(12 == ~blastFlag~0); {445715#false} is VALID [2022-04-15 11:56:53,498 INFO L290 TraceCheckUtils]: 273: Hoare triple {445715#false} assume 15 == ~blastFlag~0; {445715#false} is VALID [2022-04-15 11:56:53,498 INFO L290 TraceCheckUtils]: 274: Hoare triple {445715#false} assume !false; {445715#false} is VALID [2022-04-15 11:56:53,498 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2022-04-15 11:56:53,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:56:53,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213518192] [2022-04-15 11:56:53,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213518192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:53,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:53,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:56:53,499 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:56:53,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1127743581] [2022-04-15 11:56:53,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1127743581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:56:53,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:56:53,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:56:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565907632] [2022-04-15 11:56:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:56:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:56:53,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:56:53,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:53,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:56:53,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:56:53,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:56:53,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:56:53,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:56:53,608 INFO L87 Difference]: Start difference. First operand 2443 states and 3476 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:56:57,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:57:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:02,361 INFO L93 Difference]: Finished difference Result 5417 states and 7730 transitions. [2022-04-15 11:57:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:57:02,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:57:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:57:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:57:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:57:02,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 641 transitions. [2022-04-15 11:57:02,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:03,108 INFO L225 Difference]: With dead ends: 5417 [2022-04-15 11:57:03,109 INFO L226 Difference]: Without dead ends: 3002 [2022-04-15 11:57:03,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:57:03,111 INFO L913 BasicCegarLoop]: 397 mSDtfsCounter, 157 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:57:03,111 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 591 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 463 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 11:57:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2022-04-15 11:57:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2022-04-15 11:57:04,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:57:04,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3002 states. Second operand has 3002 states, 2997 states have (on average 1.4234234234234233) internal successors, (4266), 2997 states have internal predecessors, (4266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:04,086 INFO L74 IsIncluded]: Start isIncluded. First operand 3002 states. Second operand has 3002 states, 2997 states have (on average 1.4234234234234233) internal successors, (4266), 2997 states have internal predecessors, (4266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:04,088 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand has 3002 states, 2997 states have (on average 1.4234234234234233) internal successors, (4266), 2997 states have internal predecessors, (4266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:04,345 INFO L93 Difference]: Finished difference Result 3002 states and 4270 transitions. [2022-04-15 11:57:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4270 transitions. [2022-04-15 11:57:04,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:04,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:04,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 3002 states, 2997 states have (on average 1.4234234234234233) internal successors, (4266), 2997 states have internal predecessors, (4266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3002 states. [2022-04-15 11:57:04,351 INFO L87 Difference]: Start difference. First operand has 3002 states, 2997 states have (on average 1.4234234234234233) internal successors, (4266), 2997 states have internal predecessors, (4266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3002 states. [2022-04-15 11:57:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:04,608 INFO L93 Difference]: Finished difference Result 3002 states and 4270 transitions. [2022-04-15 11:57:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4270 transitions. [2022-04-15 11:57:04,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:04,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:04,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:57:04,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:57:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2997 states have (on average 1.4234234234234233) internal successors, (4266), 2997 states have internal predecessors, (4266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 4270 transitions. [2022-04-15 11:57:05,032 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 4270 transitions. Word has length 275 [2022-04-15 11:57:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:57:05,032 INFO L478 AbstractCegarLoop]: Abstraction has 3002 states and 4270 transitions. [2022-04-15 11:57:05,033 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:05,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3002 states and 4270 transitions. [2022-04-15 11:57:10,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4270 edges. 4270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4270 transitions. [2022-04-15 11:57:10,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-15 11:57:10,391 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:57:10,391 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:57:10,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-15 11:57:10,391 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:57:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:57:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash -692728799, now seen corresponding path program 1 times [2022-04-15 11:57:10,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:10,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912100420] [2022-04-15 11:57:10,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:57:10,618 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:57:10,618 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:57:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash -692728799, now seen corresponding path program 2 times [2022-04-15 11:57:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:57:10,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184983857] [2022-04-15 11:57:10,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:57:10,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:57:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:57:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:10,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {468571#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {468565#true} is VALID [2022-04-15 11:57:10,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {468565#true} assume true; {468565#true} is VALID [2022-04-15 11:57:10,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {468565#true} {468565#true} #725#return; {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {468565#true} call ULTIMATE.init(); {468571#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {468571#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {468565#true} assume true; {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468565#true} {468565#true} #725#return; {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {468565#true} call #t~ret161 := main(); {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {468565#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; {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {468565#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L272 TraceCheckUtils]: 7: Hoare triple {468565#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {468565#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; {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {468565#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; {468565#true} is VALID [2022-04-15 11:57:10,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {468565#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {468565#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {468565#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {468565#true} assume 8464 == #t~mem55;havoc #t~mem55; {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {468565#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; {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {468565#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {468565#true} is VALID [2022-04-15 11:57:10,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {468565#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {468565#true} ~skip~0 := 0; {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {468565#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {468565#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {468565#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {468565#true} assume 8496 == #t~mem58;havoc #t~mem58; {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {468565#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 46: Hoare triple {468565#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 47: Hoare triple {468565#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 48: Hoare triple {468565#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 49: Hoare triple {468565#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 51: Hoare triple {468565#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {468565#true} ~skip~0 := 0; {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 59: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 63: Hoare triple {468565#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 64: Hoare triple {468565#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 65: Hoare triple {468565#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 66: Hoare triple {468565#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 67: Hoare triple {468565#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 68: Hoare triple {468565#true} assume 8512 == #t~mem60;havoc #t~mem60; {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {468565#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {468565#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 71: Hoare triple {468565#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {468565#true} is VALID [2022-04-15 11:57:10,811 INFO L290 TraceCheckUtils]: 72: Hoare triple {468565#true} assume !(~ret~0 <= 0); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {468565#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 74: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {468565#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {468565#true} ~skip~0 := 0; {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 78: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 79: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 80: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 81: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 83: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 84: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 85: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 86: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,812 INFO L290 TraceCheckUtils]: 87: Hoare triple {468565#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 88: Hoare triple {468565#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 89: Hoare triple {468565#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 90: Hoare triple {468565#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 91: Hoare triple {468565#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 92: Hoare triple {468565#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {468565#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 94: Hoare triple {468565#true} assume 8528 == #t~mem62;havoc #t~mem62; {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 95: Hoare triple {468565#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 96: Hoare triple {468565#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 97: Hoare triple {468565#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 98: Hoare triple {468565#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 99: Hoare triple {468565#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 100: Hoare triple {468565#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 101: Hoare triple {468565#true} assume !(~ret~0 <= 0); {468565#true} is VALID [2022-04-15 11:57:10,813 INFO L290 TraceCheckUtils]: 102: Hoare triple {468565#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 103: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 104: Hoare triple {468565#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 105: Hoare triple {468565#true} ~skip~0 := 0; {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 106: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 107: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 108: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 109: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 110: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 111: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 112: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 113: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 114: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 115: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 116: Hoare triple {468565#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,814 INFO L290 TraceCheckUtils]: 117: Hoare triple {468565#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 118: Hoare triple {468565#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 119: Hoare triple {468565#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 120: Hoare triple {468565#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 121: Hoare triple {468565#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 122: Hoare triple {468565#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 123: Hoare triple {468565#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 124: Hoare triple {468565#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 125: Hoare triple {468565#true} assume 8544 == #t~mem64;havoc #t~mem64; {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 126: Hoare triple {468565#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 127: Hoare triple {468565#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 128: Hoare triple {468565#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 129: Hoare triple {468565#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 130: Hoare triple {468565#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 131: Hoare triple {468565#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {468565#true} is VALID [2022-04-15 11:57:10,815 INFO L290 TraceCheckUtils]: 132: Hoare triple {468565#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 133: Hoare triple {468565#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 134: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 135: Hoare triple {468565#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 136: Hoare triple {468565#true} ~skip~0 := 0; {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 137: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 138: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 139: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 140: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 141: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 142: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 143: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 144: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 145: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 146: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,816 INFO L290 TraceCheckUtils]: 147: Hoare triple {468565#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 148: Hoare triple {468565#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 149: Hoare triple {468565#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 150: Hoare triple {468565#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 151: Hoare triple {468565#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 152: Hoare triple {468565#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 153: Hoare triple {468565#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 154: Hoare triple {468565#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 155: Hoare triple {468565#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 156: Hoare triple {468565#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 157: Hoare triple {468565#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 158: Hoare triple {468565#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 159: Hoare triple {468565#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 160: Hoare triple {468565#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 161: Hoare triple {468565#true} assume 8576 == #t~mem69;havoc #t~mem69; {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 162: Hoare triple {468565#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {468565#true} is VALID [2022-04-15 11:57:10,817 INFO L290 TraceCheckUtils]: 163: Hoare triple {468565#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 164: Hoare triple {468565#true} assume !(~ret~0 <= 0); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 165: Hoare triple {468565#true} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 166: Hoare triple {468565#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 167: Hoare triple {468565#true} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 168: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 169: Hoare triple {468565#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 170: Hoare triple {468565#true} ~skip~0 := 0; {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 171: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 172: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 173: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 174: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 175: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 176: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 177: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,818 INFO L290 TraceCheckUtils]: 178: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 179: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 180: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 181: Hoare triple {468565#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 182: Hoare triple {468565#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 183: Hoare triple {468565#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 184: Hoare triple {468565#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 185: Hoare triple {468565#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 186: Hoare triple {468565#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 187: Hoare triple {468565#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 188: Hoare triple {468565#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 189: Hoare triple {468565#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 190: Hoare triple {468565#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 191: Hoare triple {468565#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 192: Hoare triple {468565#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,819 INFO L290 TraceCheckUtils]: 193: Hoare triple {468565#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 194: Hoare triple {468565#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 195: Hoare triple {468565#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 196: Hoare triple {468565#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 197: Hoare triple {468565#true} assume 8592 == #t~mem71;havoc #t~mem71; {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 198: Hoare triple {468565#true} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 199: Hoare triple {468565#true} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 200: Hoare triple {468565#true} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 201: Hoare triple {468565#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); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 202: Hoare triple {468565#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 203: Hoare triple {468565#true} ~skip~0 := 0; {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 204: Hoare triple {468565#true} assume !false; {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 205: Hoare triple {468565#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 206: Hoare triple {468565#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 207: Hoare triple {468565#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,820 INFO L290 TraceCheckUtils]: 208: Hoare triple {468565#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 209: Hoare triple {468565#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 210: Hoare triple {468565#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 211: Hoare triple {468565#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 212: Hoare triple {468565#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 213: Hoare triple {468565#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 214: Hoare triple {468565#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 215: Hoare triple {468565#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 216: Hoare triple {468565#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 217: Hoare triple {468565#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 218: Hoare triple {468565#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 219: Hoare triple {468565#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 220: Hoare triple {468565#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 221: Hoare triple {468565#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 222: Hoare triple {468565#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 223: Hoare triple {468565#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,821 INFO L290 TraceCheckUtils]: 224: Hoare triple {468565#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 225: Hoare triple {468565#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 226: Hoare triple {468565#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 227: Hoare triple {468565#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 228: Hoare triple {468565#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 229: Hoare triple {468565#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 230: Hoare triple {468565#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 231: Hoare triple {468565#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 232: Hoare triple {468565#true} assume 8608 == #t~mem73;havoc #t~mem73; {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 233: Hoare triple {468565#true} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {468565#true} is VALID [2022-04-15 11:57:10,822 INFO L290 TraceCheckUtils]: 234: Hoare triple {468565#true} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,823 INFO L290 TraceCheckUtils]: 235: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,823 INFO L290 TraceCheckUtils]: 236: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,823 INFO L290 TraceCheckUtils]: 237: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,823 INFO L290 TraceCheckUtils]: 238: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} ~skip~0 := 0; {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,824 INFO L290 TraceCheckUtils]: 239: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !false; {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,824 INFO L290 TraceCheckUtils]: 240: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,824 INFO L290 TraceCheckUtils]: 241: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,824 INFO L290 TraceCheckUtils]: 242: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,824 INFO L290 TraceCheckUtils]: 243: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,825 INFO L290 TraceCheckUtils]: 244: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,825 INFO L290 TraceCheckUtils]: 245: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,825 INFO L290 TraceCheckUtils]: 246: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,825 INFO L290 TraceCheckUtils]: 247: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,826 INFO L290 TraceCheckUtils]: 248: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,826 INFO L290 TraceCheckUtils]: 249: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,826 INFO L290 TraceCheckUtils]: 250: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,826 INFO L290 TraceCheckUtils]: 251: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,826 INFO L290 TraceCheckUtils]: 252: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,827 INFO L290 TraceCheckUtils]: 253: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,827 INFO L290 TraceCheckUtils]: 254: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,827 INFO L290 TraceCheckUtils]: 255: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,827 INFO L290 TraceCheckUtils]: 256: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,827 INFO L290 TraceCheckUtils]: 257: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,828 INFO L290 TraceCheckUtils]: 258: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,828 INFO L290 TraceCheckUtils]: 259: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,828 INFO L290 TraceCheckUtils]: 260: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,828 INFO L290 TraceCheckUtils]: 261: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,829 INFO L290 TraceCheckUtils]: 262: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,829 INFO L290 TraceCheckUtils]: 263: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,829 INFO L290 TraceCheckUtils]: 264: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,829 INFO L290 TraceCheckUtils]: 265: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,829 INFO L290 TraceCheckUtils]: 266: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,830 INFO L290 TraceCheckUtils]: 267: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,830 INFO L290 TraceCheckUtils]: 268: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,830 INFO L290 TraceCheckUtils]: 269: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume 8640 == #t~mem75;havoc #t~mem75; {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,830 INFO L290 TraceCheckUtils]: 270: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:10,831 INFO L290 TraceCheckUtils]: 271: Hoare triple {468570#(= (+ (- 9) ssl3_accept_~blastFlag~0) 0)} assume !(9 == ~blastFlag~0); {468566#false} is VALID [2022-04-15 11:57:10,831 INFO L290 TraceCheckUtils]: 272: Hoare triple {468566#false} assume !(12 == ~blastFlag~0); {468566#false} is VALID [2022-04-15 11:57:10,831 INFO L290 TraceCheckUtils]: 273: Hoare triple {468566#false} assume 15 == ~blastFlag~0; {468566#false} is VALID [2022-04-15 11:57:10,831 INFO L290 TraceCheckUtils]: 274: Hoare triple {468566#false} assume !false; {468566#false} is VALID [2022-04-15 11:57:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-04-15 11:57:10,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:57:10,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184983857] [2022-04-15 11:57:10,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184983857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:10,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:10,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:57:10,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:57:10,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912100420] [2022-04-15 11:57:10,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912100420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:10,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:10,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:57:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766403497] [2022-04-15 11:57:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:57:10,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:57:10,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:57:10,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:10,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:10,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:57:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:57:10,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:57:10,932 INFO L87 Difference]: Start difference. First operand 3002 states and 4270 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:15,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:57:18,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:57:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:23,816 INFO L93 Difference]: Finished difference Result 6567 states and 9362 transitions. [2022-04-15 11:57:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:57:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:57:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:57:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions. [2022-04-15 11:57:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions. [2022-04-15 11:57:23,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 634 transitions. [2022-04-15 11:57:24,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:24,896 INFO L225 Difference]: With dead ends: 6567 [2022-04-15 11:57:24,897 INFO L226 Difference]: Without dead ends: 3593 [2022-04-15 11:57:24,900 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:57:24,900 INFO L913 BasicCegarLoop]: 394 mSDtfsCounter, 148 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 11:57:24,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 588 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 11:57:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2022-04-15 11:57:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3593. [2022-04-15 11:57:25,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:57:25,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3593 states. Second operand has 3593 states, 3588 states have (on average 1.4230769230769231) internal successors, (5106), 3588 states have internal predecessors, (5106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:25,954 INFO L74 IsIncluded]: Start isIncluded. First operand 3593 states. Second operand has 3593 states, 3588 states have (on average 1.4230769230769231) internal successors, (5106), 3588 states have internal predecessors, (5106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:25,956 INFO L87 Difference]: Start difference. First operand 3593 states. Second operand has 3593 states, 3588 states have (on average 1.4230769230769231) internal successors, (5106), 3588 states have internal predecessors, (5106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:26,368 INFO L93 Difference]: Finished difference Result 3593 states and 5110 transitions. [2022-04-15 11:57:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5110 transitions. [2022-04-15 11:57:26,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:26,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:26,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 3593 states, 3588 states have (on average 1.4230769230769231) internal successors, (5106), 3588 states have internal predecessors, (5106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3593 states. [2022-04-15 11:57:26,376 INFO L87 Difference]: Start difference. First operand has 3593 states, 3588 states have (on average 1.4230769230769231) internal successors, (5106), 3588 states have internal predecessors, (5106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3593 states. [2022-04-15 11:57:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:26,769 INFO L93 Difference]: Finished difference Result 3593 states and 5110 transitions. [2022-04-15 11:57:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5110 transitions. [2022-04-15 11:57:26,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:26,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:26,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:57:26,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:57:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3593 states, 3588 states have (on average 1.4230769230769231) internal successors, (5106), 3588 states have internal predecessors, (5106), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3593 states to 3593 states and 5110 transitions. [2022-04-15 11:57:27,452 INFO L78 Accepts]: Start accepts. Automaton has 3593 states and 5110 transitions. Word has length 275 [2022-04-15 11:57:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:57:27,452 INFO L478 AbstractCegarLoop]: Abstraction has 3593 states and 5110 transitions. [2022-04-15 11:57:27,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:27,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3593 states and 5110 transitions. [2022-04-15 11:57:33,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5110 edges. 5110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3593 states and 5110 transitions. [2022-04-15 11:57:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-15 11:57:33,426 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:57:33,426 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:57:33,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-15 11:57:33,427 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:57:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:57:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -269082077, now seen corresponding path program 1 times [2022-04-15 11:57:33,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:33,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1432907549] [2022-04-15 11:57:33,669 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:57:33,669 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:57:33,669 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:57:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -269082077, now seen corresponding path program 2 times [2022-04-15 11:57:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:57:33,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150055639] [2022-04-15 11:57:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:57:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:57:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:33,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:57:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:33,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {496086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {496080#true} is VALID [2022-04-15 11:57:33,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {496080#true} assume true; {496080#true} is VALID [2022-04-15 11:57:33,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {496080#true} {496080#true} #725#return; {496080#true} is VALID [2022-04-15 11:57:33,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {496080#true} call ULTIMATE.init(); {496086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:57:33,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {496086#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {496080#true} is VALID [2022-04-15 11:57:33,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {496080#true} assume true; {496080#true} is VALID [2022-04-15 11:57:33,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {496080#true} {496080#true} #725#return; {496080#true} is VALID [2022-04-15 11:57:33,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {496080#true} call #t~ret161 := main(); {496080#true} is VALID [2022-04-15 11:57:33,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {496080#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; {496080#true} is VALID [2022-04-15 11:57:33,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {496080#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L272 TraceCheckUtils]: 7: Hoare triple {496080#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {496080#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; {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {496080#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; {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {496080#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {496080#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {496080#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {496080#true} assume !false; {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {496080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {496080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {496080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {496080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {496080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {496080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {496080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {496080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {496080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {496080#true} assume 8464 == #t~mem55;havoc #t~mem55; {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {496080#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; {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {496080#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {496080#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {496080#true} ~skip~0 := 0; {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {496080#true} assume !false; {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {496080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {496080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {496080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {496080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {496080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {496080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {496080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {496080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {496080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {496080#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {496080#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {496080#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 44: Hoare triple {496080#true} assume 8496 == #t~mem58;havoc #t~mem58; {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 45: Hoare triple {496080#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {496080#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {496080#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {496080#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {496080#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 50: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 51: Hoare triple {496080#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496080#true} is VALID [2022-04-15 11:57:33,828 INFO L290 TraceCheckUtils]: 52: Hoare triple {496080#true} ~skip~0 := 0; {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {496080#true} assume !false; {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {496080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {496080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {496080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {496080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 58: Hoare triple {496080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {496080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {496080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {496080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 62: Hoare triple {496080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 63: Hoare triple {496080#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 64: Hoare triple {496080#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {496080#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 66: Hoare triple {496080#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,829 INFO L290 TraceCheckUtils]: 67: Hoare triple {496080#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {496080#true} assume 8512 == #t~mem60;havoc #t~mem60; {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 69: Hoare triple {496080#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 70: Hoare triple {496080#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 71: Hoare triple {496080#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 72: Hoare triple {496080#true} assume !(~ret~0 <= 0); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {496080#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 75: Hoare triple {496080#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 76: Hoare triple {496080#true} ~skip~0 := 0; {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 77: Hoare triple {496080#true} assume !false; {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 78: Hoare triple {496080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 79: Hoare triple {496080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 80: Hoare triple {496080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {496080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {496080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 83: Hoare triple {496080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 84: Hoare triple {496080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {496080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {496080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 87: Hoare triple {496080#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {496080#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 89: Hoare triple {496080#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 90: Hoare triple {496080#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 91: Hoare triple {496080#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 92: Hoare triple {496080#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 93: Hoare triple {496080#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 94: Hoare triple {496080#true} assume 8528 == #t~mem62;havoc #t~mem62; {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 95: Hoare triple {496080#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,831 INFO L290 TraceCheckUtils]: 96: Hoare triple {496080#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 97: Hoare triple {496080#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 98: Hoare triple {496080#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 99: Hoare triple {496080#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 100: Hoare triple {496080#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 101: Hoare triple {496080#true} assume !(~ret~0 <= 0); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 102: Hoare triple {496080#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 103: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 104: Hoare triple {496080#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 105: Hoare triple {496080#true} ~skip~0 := 0; {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 106: Hoare triple {496080#true} assume !false; {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 107: Hoare triple {496080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 108: Hoare triple {496080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 109: Hoare triple {496080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 110: Hoare triple {496080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,832 INFO L290 TraceCheckUtils]: 111: Hoare triple {496080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 112: Hoare triple {496080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 113: Hoare triple {496080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 114: Hoare triple {496080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 115: Hoare triple {496080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 116: Hoare triple {496080#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 117: Hoare triple {496080#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 118: Hoare triple {496080#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 119: Hoare triple {496080#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 120: Hoare triple {496080#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 121: Hoare triple {496080#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 122: Hoare triple {496080#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 123: Hoare triple {496080#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 124: Hoare triple {496080#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 125: Hoare triple {496080#true} assume 8544 == #t~mem64;havoc #t~mem64; {496080#true} is VALID [2022-04-15 11:57:33,833 INFO L290 TraceCheckUtils]: 126: Hoare triple {496080#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 127: Hoare triple {496080#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 128: Hoare triple {496080#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 129: Hoare triple {496080#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 130: Hoare triple {496080#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 131: Hoare triple {496080#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 132: Hoare triple {496080#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 133: Hoare triple {496080#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 134: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 135: Hoare triple {496080#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 136: Hoare triple {496080#true} ~skip~0 := 0; {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 137: Hoare triple {496080#true} assume !false; {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 138: Hoare triple {496080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 139: Hoare triple {496080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,834 INFO L290 TraceCheckUtils]: 140: Hoare triple {496080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 141: Hoare triple {496080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 142: Hoare triple {496080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 143: Hoare triple {496080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 144: Hoare triple {496080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 145: Hoare triple {496080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 146: Hoare triple {496080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 147: Hoare triple {496080#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 148: Hoare triple {496080#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 149: Hoare triple {496080#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 150: Hoare triple {496080#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 151: Hoare triple {496080#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 152: Hoare triple {496080#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 153: Hoare triple {496080#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,835 INFO L290 TraceCheckUtils]: 154: Hoare triple {496080#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 155: Hoare triple {496080#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 156: Hoare triple {496080#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 157: Hoare triple {496080#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 158: Hoare triple {496080#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 159: Hoare triple {496080#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 160: Hoare triple {496080#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 161: Hoare triple {496080#true} assume 8576 == #t~mem69;havoc #t~mem69; {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 162: Hoare triple {496080#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 163: Hoare triple {496080#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 164: Hoare triple {496080#true} assume !(~ret~0 <= 0); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 165: Hoare triple {496080#true} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 166: Hoare triple {496080#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 167: Hoare triple {496080#true} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 168: Hoare triple {496080#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); {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 169: Hoare triple {496080#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496080#true} is VALID [2022-04-15 11:57:33,836 INFO L290 TraceCheckUtils]: 170: Hoare triple {496080#true} ~skip~0 := 0; {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 171: Hoare triple {496080#true} assume !false; {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 172: Hoare triple {496080#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 173: Hoare triple {496080#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 174: Hoare triple {496080#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 175: Hoare triple {496080#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 176: Hoare triple {496080#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 177: Hoare triple {496080#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 178: Hoare triple {496080#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 179: Hoare triple {496080#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 180: Hoare triple {496080#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 181: Hoare triple {496080#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 182: Hoare triple {496080#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 183: Hoare triple {496080#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 184: Hoare triple {496080#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,837 INFO L290 TraceCheckUtils]: 185: Hoare triple {496080#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 186: Hoare triple {496080#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 187: Hoare triple {496080#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 188: Hoare triple {496080#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 189: Hoare triple {496080#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 190: Hoare triple {496080#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 191: Hoare triple {496080#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 192: Hoare triple {496080#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 193: Hoare triple {496080#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 194: Hoare triple {496080#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 195: Hoare triple {496080#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 196: Hoare triple {496080#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 197: Hoare triple {496080#true} assume 8592 == #t~mem71;havoc #t~mem71; {496080#true} is VALID [2022-04-15 11:57:33,838 INFO L290 TraceCheckUtils]: 198: Hoare triple {496080#true} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {496080#true} is VALID [2022-04-15 11:57:33,839 INFO L290 TraceCheckUtils]: 199: Hoare triple {496080#true} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,839 INFO L290 TraceCheckUtils]: 200: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,839 INFO L290 TraceCheckUtils]: 201: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,839 INFO L290 TraceCheckUtils]: 202: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,840 INFO L290 TraceCheckUtils]: 203: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} ~skip~0 := 0; {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,840 INFO L290 TraceCheckUtils]: 204: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !false; {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,840 INFO L290 TraceCheckUtils]: 205: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,840 INFO L290 TraceCheckUtils]: 206: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,841 INFO L290 TraceCheckUtils]: 207: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,841 INFO L290 TraceCheckUtils]: 208: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,841 INFO L290 TraceCheckUtils]: 209: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,841 INFO L290 TraceCheckUtils]: 210: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,842 INFO L290 TraceCheckUtils]: 211: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,842 INFO L290 TraceCheckUtils]: 212: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,842 INFO L290 TraceCheckUtils]: 213: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,842 INFO L290 TraceCheckUtils]: 214: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,843 INFO L290 TraceCheckUtils]: 215: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,843 INFO L290 TraceCheckUtils]: 216: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,843 INFO L290 TraceCheckUtils]: 217: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,843 INFO L290 TraceCheckUtils]: 218: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,844 INFO L290 TraceCheckUtils]: 219: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,844 INFO L290 TraceCheckUtils]: 220: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,844 INFO L290 TraceCheckUtils]: 221: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,844 INFO L290 TraceCheckUtils]: 222: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,845 INFO L290 TraceCheckUtils]: 223: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,845 INFO L290 TraceCheckUtils]: 224: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,845 INFO L290 TraceCheckUtils]: 225: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,845 INFO L290 TraceCheckUtils]: 226: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,846 INFO L290 TraceCheckUtils]: 227: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,846 INFO L290 TraceCheckUtils]: 228: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,846 INFO L290 TraceCheckUtils]: 229: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,846 INFO L290 TraceCheckUtils]: 230: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,847 INFO L290 TraceCheckUtils]: 231: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,847 INFO L290 TraceCheckUtils]: 232: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume 8608 == #t~mem73;havoc #t~mem73; {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,847 INFO L290 TraceCheckUtils]: 233: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 234: Hoare triple {496085#(= (+ ssl3_accept_~blastFlag~0 (- 8)) 0)} assume !(8 == ~blastFlag~0); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 235: Hoare triple {496081#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); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 236: Hoare triple {496081#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); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 237: Hoare triple {496081#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 238: Hoare triple {496081#false} ~skip~0 := 0; {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 239: Hoare triple {496081#false} assume !false; {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 240: Hoare triple {496081#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); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 241: Hoare triple {496081#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 242: Hoare triple {496081#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 243: Hoare triple {496081#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 244: Hoare triple {496081#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 245: Hoare triple {496081#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 246: Hoare triple {496081#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,854 INFO L290 TraceCheckUtils]: 247: Hoare triple {496081#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 248: Hoare triple {496081#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 249: Hoare triple {496081#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 250: Hoare triple {496081#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 251: Hoare triple {496081#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 252: Hoare triple {496081#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 253: Hoare triple {496081#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 254: Hoare triple {496081#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 255: Hoare triple {496081#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 256: Hoare triple {496081#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 257: Hoare triple {496081#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 258: Hoare triple {496081#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 259: Hoare triple {496081#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 260: Hoare triple {496081#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 261: Hoare triple {496081#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,855 INFO L290 TraceCheckUtils]: 262: Hoare triple {496081#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 263: Hoare triple {496081#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 264: Hoare triple {496081#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 265: Hoare triple {496081#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 266: Hoare triple {496081#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 267: Hoare triple {496081#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 268: Hoare triple {496081#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 269: Hoare triple {496081#false} assume 8640 == #t~mem75;havoc #t~mem75; {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 270: Hoare triple {496081#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 271: Hoare triple {496081#false} assume !(9 == ~blastFlag~0); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 272: Hoare triple {496081#false} assume !(12 == ~blastFlag~0); {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 273: Hoare triple {496081#false} assume 15 == ~blastFlag~0; {496081#false} is VALID [2022-04-15 11:57:33,856 INFO L290 TraceCheckUtils]: 274: Hoare triple {496081#false} assume !false; {496081#false} is VALID [2022-04-15 11:57:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 11:57:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:57:33,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150055639] [2022-04-15 11:57:33,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150055639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:33,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:33,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:57:33,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:57:33,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1432907549] [2022-04-15 11:57:33,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1432907549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:33,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:33,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:57:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982299207] [2022-04-15 11:57:33,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:57:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:57:33,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:57:33,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:33,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:33,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:57:33,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:33,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:57:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:57:33,976 INFO L87 Difference]: Start difference. First operand 3593 states and 5110 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:38,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:57:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:47,575 INFO L93 Difference]: Finished difference Result 7722 states and 11004 transitions. [2022-04-15 11:57:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:57:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:57:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:57:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:57:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:47,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:57:47,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 641 transitions. [2022-04-15 11:57:47,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:48,780 INFO L225 Difference]: With dead ends: 7722 [2022-04-15 11:57:48,780 INFO L226 Difference]: Without dead ends: 4157 [2022-04-15 11:57:48,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:57:48,784 INFO L913 BasicCegarLoop]: 397 mSDtfsCounter, 155 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:57:48,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 591 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 11:57:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2022-04-15 11:57:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 4157. [2022-04-15 11:57:49,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:57:49,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4157 states. Second operand has 4157 states, 4152 states have (on average 1.4224470134874758) internal successors, (5906), 4152 states have internal predecessors, (5906), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:49,886 INFO L74 IsIncluded]: Start isIncluded. First operand 4157 states. Second operand has 4157 states, 4152 states have (on average 1.4224470134874758) internal successors, (5906), 4152 states have internal predecessors, (5906), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:49,888 INFO L87 Difference]: Start difference. First operand 4157 states. Second operand has 4157 states, 4152 states have (on average 1.4224470134874758) internal successors, (5906), 4152 states have internal predecessors, (5906), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:50,420 INFO L93 Difference]: Finished difference Result 4157 states and 5910 transitions. [2022-04-15 11:57:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5910 transitions. [2022-04-15 11:57:50,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:50,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:50,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 4157 states, 4152 states have (on average 1.4224470134874758) internal successors, (5906), 4152 states have internal predecessors, (5906), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4157 states. [2022-04-15 11:57:50,429 INFO L87 Difference]: Start difference. First operand has 4157 states, 4152 states have (on average 1.4224470134874758) internal successors, (5906), 4152 states have internal predecessors, (5906), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4157 states. [2022-04-15 11:57:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:57:50,977 INFO L93 Difference]: Finished difference Result 4157 states and 5910 transitions. [2022-04-15 11:57:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5910 transitions. [2022-04-15 11:57:50,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:57:50,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:57:50,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:57:50,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:57:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4157 states, 4152 states have (on average 1.4224470134874758) internal successors, (5906), 4152 states have internal predecessors, (5906), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 5910 transitions. [2022-04-15 11:57:51,857 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 5910 transitions. Word has length 275 [2022-04-15 11:57:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:57:51,857 INFO L478 AbstractCegarLoop]: Abstraction has 4157 states and 5910 transitions. [2022-04-15 11:57:51,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:51,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4157 states and 5910 transitions. [2022-04-15 11:57:58,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5910 edges. 5910 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5910 transitions. [2022-04-15 11:57:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-04-15 11:57:58,903 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:57:58,903 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:57:58,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-04-15 11:57:58,903 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:57:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:57:58,903 INFO L85 PathProgramCache]: Analyzing trace with hash 909963747, now seen corresponding path program 1 times [2022-04-15 11:57:58,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:58,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986447395] [2022-04-15 11:57:59,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:57:59,108 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:57:59,108 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:57:59,108 INFO L85 PathProgramCache]: Analyzing trace with hash 909963747, now seen corresponding path program 2 times [2022-04-15 11:57:59,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:57:59,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854469912] [2022-04-15 11:57:59,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:57:59,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:57:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:59,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:57:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:57:59,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {528167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {528161#true} is VALID [2022-04-15 11:57:59,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {528161#true} assume true; {528161#true} is VALID [2022-04-15 11:57:59,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {528161#true} {528161#true} #725#return; {528161#true} is VALID [2022-04-15 11:57:59,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {528161#true} call ULTIMATE.init(); {528167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:57:59,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {528167#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {528161#true} is VALID [2022-04-15 11:57:59,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {528161#true} assume true; {528161#true} is VALID [2022-04-15 11:57:59,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {528161#true} {528161#true} #725#return; {528161#true} is VALID [2022-04-15 11:57:59,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {528161#true} call #t~ret161 := main(); {528161#true} is VALID [2022-04-15 11:57:59,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {528161#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; {528161#true} is VALID [2022-04-15 11:57:59,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {528161#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,251 INFO L272 TraceCheckUtils]: 7: Hoare triple {528161#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {528161#true} is VALID [2022-04-15 11:57:59,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {528161#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); {528161#true} is VALID [2022-04-15 11:57:59,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {528161#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; {528161#true} is VALID [2022-04-15 11:57:59,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {528161#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; {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {528161#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {528161#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {528161#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {528161#true} assume !false; {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {528161#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {528161#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {528161#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {528161#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {528161#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {528161#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {528161#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {528161#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {528161#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {528161#true} assume 8464 == #t~mem55;havoc #t~mem55; {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {528161#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; {528161#true} is VALID [2022-04-15 11:57:59,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {528161#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {528161#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); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {528161#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); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {528161#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {528161#true} ~skip~0 := 0; {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {528161#true} assume !false; {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {528161#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {528161#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {528161#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {528161#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {528161#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {528161#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 38: Hoare triple {528161#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {528161#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {528161#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {528161#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {528161#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {528161#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {528161#true} assume 8496 == #t~mem58;havoc #t~mem58; {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {528161#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {528161#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {528161#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 48: Hoare triple {528161#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 49: Hoare triple {528161#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 50: Hoare triple {528161#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); {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 51: Hoare triple {528161#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 52: Hoare triple {528161#true} ~skip~0 := 0; {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 53: Hoare triple {528161#true} assume !false; {528161#true} is VALID [2022-04-15 11:57:59,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {528161#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,255 INFO L290 TraceCheckUtils]: 55: Hoare triple {528161#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,255 INFO L290 TraceCheckUtils]: 56: Hoare triple {528161#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {528161#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {528161#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {528161#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {528161#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 61: Hoare triple {528161#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 62: Hoare triple {528161#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 63: Hoare triple {528161#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 64: Hoare triple {528161#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 65: Hoare triple {528161#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {528161#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {528161#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {528161#true} assume 8512 == #t~mem60;havoc #t~mem60; {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {528161#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 70: Hoare triple {528161#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 71: Hoare triple {528161#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 72: Hoare triple {528161#true} assume !(~ret~0 <= 0); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {528161#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {528161#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); {528161#true} is VALID [2022-04-15 11:57:59,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {528161#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 76: Hoare triple {528161#true} ~skip~0 := 0; {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {528161#true} assume !false; {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 78: Hoare triple {528161#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 79: Hoare triple {528161#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 80: Hoare triple {528161#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 81: Hoare triple {528161#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 82: Hoare triple {528161#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 83: Hoare triple {528161#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 84: Hoare triple {528161#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 85: Hoare triple {528161#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {528161#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {528161#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 88: Hoare triple {528161#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 89: Hoare triple {528161#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 90: Hoare triple {528161#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,257 INFO L290 TraceCheckUtils]: 91: Hoare triple {528161#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {528161#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {528161#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 94: Hoare triple {528161#true} assume 8528 == #t~mem62;havoc #t~mem62; {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 95: Hoare triple {528161#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 96: Hoare triple {528161#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 97: Hoare triple {528161#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 98: Hoare triple {528161#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 99: Hoare triple {528161#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 100: Hoare triple {528161#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 101: Hoare triple {528161#true} assume !(~ret~0 <= 0); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 102: Hoare triple {528161#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 103: Hoare triple {528161#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); {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 104: Hoare triple {528161#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 105: Hoare triple {528161#true} ~skip~0 := 0; {528161#true} is VALID [2022-04-15 11:57:59,258 INFO L290 TraceCheckUtils]: 106: Hoare triple {528161#true} assume !false; {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 107: Hoare triple {528161#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 108: Hoare triple {528161#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 109: Hoare triple {528161#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 110: Hoare triple {528161#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 111: Hoare triple {528161#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 112: Hoare triple {528161#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 113: Hoare triple {528161#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 114: Hoare triple {528161#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 115: Hoare triple {528161#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 116: Hoare triple {528161#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 117: Hoare triple {528161#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 118: Hoare triple {528161#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 119: Hoare triple {528161#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 120: Hoare triple {528161#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 121: Hoare triple {528161#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,259 INFO L290 TraceCheckUtils]: 122: Hoare triple {528161#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 123: Hoare triple {528161#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 124: Hoare triple {528161#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 125: Hoare triple {528161#true} assume 8544 == #t~mem64;havoc #t~mem64; {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 126: Hoare triple {528161#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 127: Hoare triple {528161#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 128: Hoare triple {528161#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 129: Hoare triple {528161#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 130: Hoare triple {528161#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 131: Hoare triple {528161#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 132: Hoare triple {528161#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 133: Hoare triple {528161#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 134: Hoare triple {528161#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); {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 135: Hoare triple {528161#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 136: Hoare triple {528161#true} ~skip~0 := 0; {528161#true} is VALID [2022-04-15 11:57:59,260 INFO L290 TraceCheckUtils]: 137: Hoare triple {528161#true} assume !false; {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 138: Hoare triple {528161#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 139: Hoare triple {528161#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 140: Hoare triple {528161#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 141: Hoare triple {528161#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 142: Hoare triple {528161#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 143: Hoare triple {528161#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 144: Hoare triple {528161#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 145: Hoare triple {528161#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 146: Hoare triple {528161#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 147: Hoare triple {528161#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 148: Hoare triple {528161#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 149: Hoare triple {528161#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 150: Hoare triple {528161#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 151: Hoare triple {528161#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,261 INFO L290 TraceCheckUtils]: 152: Hoare triple {528161#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 153: Hoare triple {528161#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 154: Hoare triple {528161#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 155: Hoare triple {528161#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 156: Hoare triple {528161#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 157: Hoare triple {528161#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 158: Hoare triple {528161#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 159: Hoare triple {528161#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 160: Hoare triple {528161#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 161: Hoare triple {528161#true} assume 8576 == #t~mem69;havoc #t~mem69; {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 162: Hoare triple {528161#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {528161#true} is VALID [2022-04-15 11:57:59,262 INFO L290 TraceCheckUtils]: 163: Hoare triple {528161#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {528166#(= (+ (- 6) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:59,263 INFO L290 TraceCheckUtils]: 164: Hoare triple {528166#(= (+ (- 6) ssl3_accept_~blastFlag~0) 0)} assume !(~ret~0 <= 0); {528166#(= (+ (- 6) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:59,263 INFO L290 TraceCheckUtils]: 165: Hoare triple {528166#(= (+ (- 6) ssl3_accept_~blastFlag~0) 0)} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {528166#(= (+ (- 6) ssl3_accept_~blastFlag~0) 0)} is VALID [2022-04-15 11:57:59,263 INFO L290 TraceCheckUtils]: 166: Hoare triple {528166#(= (+ (- 6) ssl3_accept_~blastFlag~0) 0)} assume !(6 == ~blastFlag~0); {528162#false} is VALID [2022-04-15 11:57:59,263 INFO L290 TraceCheckUtils]: 167: Hoare triple {528162#false} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,263 INFO L290 TraceCheckUtils]: 168: Hoare triple {528162#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); {528162#false} is VALID [2022-04-15 11:57:59,263 INFO L290 TraceCheckUtils]: 169: Hoare triple {528162#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 170: Hoare triple {528162#false} ~skip~0 := 0; {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 171: Hoare triple {528162#false} assume !false; {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 172: Hoare triple {528162#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); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 173: Hoare triple {528162#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 174: Hoare triple {528162#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 175: Hoare triple {528162#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 176: Hoare triple {528162#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 177: Hoare triple {528162#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 178: Hoare triple {528162#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 179: Hoare triple {528162#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 180: Hoare triple {528162#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 181: Hoare triple {528162#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 182: Hoare triple {528162#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 183: Hoare triple {528162#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,264 INFO L290 TraceCheckUtils]: 184: Hoare triple {528162#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 185: Hoare triple {528162#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 186: Hoare triple {528162#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 187: Hoare triple {528162#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 188: Hoare triple {528162#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 189: Hoare triple {528162#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 190: Hoare triple {528162#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 191: Hoare triple {528162#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 192: Hoare triple {528162#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 193: Hoare triple {528162#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 194: Hoare triple {528162#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 195: Hoare triple {528162#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 196: Hoare triple {528162#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 197: Hoare triple {528162#false} assume 8592 == #t~mem71;havoc #t~mem71; {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 198: Hoare triple {528162#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 199: Hoare triple {528162#false} assume !(7 == ~blastFlag~0); {528162#false} is VALID [2022-04-15 11:57:59,265 INFO L290 TraceCheckUtils]: 200: Hoare triple {528162#false} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 201: Hoare triple {528162#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); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 202: Hoare triple {528162#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 203: Hoare triple {528162#false} ~skip~0 := 0; {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 204: Hoare triple {528162#false} assume !false; {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 205: Hoare triple {528162#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); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 206: Hoare triple {528162#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 207: Hoare triple {528162#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 208: Hoare triple {528162#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 209: Hoare triple {528162#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 210: Hoare triple {528162#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 211: Hoare triple {528162#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 212: Hoare triple {528162#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 213: Hoare triple {528162#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 214: Hoare triple {528162#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,266 INFO L290 TraceCheckUtils]: 215: Hoare triple {528162#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 216: Hoare triple {528162#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 217: Hoare triple {528162#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 218: Hoare triple {528162#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 219: Hoare triple {528162#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 220: Hoare triple {528162#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 221: Hoare triple {528162#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 222: Hoare triple {528162#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 223: Hoare triple {528162#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 224: Hoare triple {528162#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 225: Hoare triple {528162#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 226: Hoare triple {528162#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 227: Hoare triple {528162#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 228: Hoare triple {528162#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 229: Hoare triple {528162#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 230: Hoare triple {528162#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,267 INFO L290 TraceCheckUtils]: 231: Hoare triple {528162#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 232: Hoare triple {528162#false} assume 8608 == #t~mem73;havoc #t~mem73; {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 233: Hoare triple {528162#false} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 234: Hoare triple {528162#false} assume !(8 == ~blastFlag~0); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 235: Hoare triple {528162#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); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 236: Hoare triple {528162#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); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 237: Hoare triple {528162#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 238: Hoare triple {528162#false} ~skip~0 := 0; {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 239: Hoare triple {528162#false} assume !false; {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 240: Hoare triple {528162#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); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 241: Hoare triple {528162#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 242: Hoare triple {528162#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 243: Hoare triple {528162#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 244: Hoare triple {528162#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 245: Hoare triple {528162#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,268 INFO L290 TraceCheckUtils]: 246: Hoare triple {528162#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 247: Hoare triple {528162#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 248: Hoare triple {528162#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 249: Hoare triple {528162#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 250: Hoare triple {528162#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 251: Hoare triple {528162#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 252: Hoare triple {528162#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 253: Hoare triple {528162#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 254: Hoare triple {528162#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 255: Hoare triple {528162#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 256: Hoare triple {528162#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 257: Hoare triple {528162#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 258: Hoare triple {528162#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 259: Hoare triple {528162#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 260: Hoare triple {528162#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 261: Hoare triple {528162#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,269 INFO L290 TraceCheckUtils]: 262: Hoare triple {528162#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 263: Hoare triple {528162#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 264: Hoare triple {528162#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 265: Hoare triple {528162#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 266: Hoare triple {528162#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 267: Hoare triple {528162#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 268: Hoare triple {528162#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 269: Hoare triple {528162#false} assume 8640 == #t~mem75;havoc #t~mem75; {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 270: Hoare triple {528162#false} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 271: Hoare triple {528162#false} assume !(9 == ~blastFlag~0); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 272: Hoare triple {528162#false} assume !(12 == ~blastFlag~0); {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 273: Hoare triple {528162#false} assume 15 == ~blastFlag~0; {528162#false} is VALID [2022-04-15 11:57:59,270 INFO L290 TraceCheckUtils]: 274: Hoare triple {528162#false} assume !false; {528162#false} is VALID [2022-04-15 11:57:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2022-04-15 11:57:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:57:59,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854469912] [2022-04-15 11:57:59,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854469912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:59,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:59,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:57:59,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:57:59,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986447395] [2022-04-15 11:57:59,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986447395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:57:59,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:57:59,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:57:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406249000] [2022-04-15 11:57:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:57:59,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:57:59,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:57:59,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:57:59,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:57:59,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:57:59,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:57:59,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:57:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:57:59,354 INFO L87 Difference]: Start difference. First operand 4157 states and 5910 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:01,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:58:03,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:58:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:12,686 INFO L93 Difference]: Finished difference Result 8847 states and 12600 transitions. [2022-04-15 11:58:12,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:58:12,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 275 [2022-04-15 11:58:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:58:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:58:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2022-04-15 11:58:12,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 641 transitions. [2022-04-15 11:58:13,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 641 edges. 641 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:14,106 INFO L225 Difference]: With dead ends: 8847 [2022-04-15 11:58:14,106 INFO L226 Difference]: Without dead ends: 4718 [2022-04-15 11:58:14,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:14,110 INFO L913 BasicCegarLoop]: 397 mSDtfsCounter, 187 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 11:58:14,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 591 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 463 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 11:58:14,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2022-04-15 11:58:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4718. [2022-04-15 11:58:15,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:58:15,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4718 states. Second operand has 4718 states, 4713 states have (on average 1.4220241884150222) internal successors, (6702), 4713 states have internal predecessors, (6702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:15,277 INFO L74 IsIncluded]: Start isIncluded. First operand 4718 states. Second operand has 4718 states, 4713 states have (on average 1.4220241884150222) internal successors, (6702), 4713 states have internal predecessors, (6702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:15,279 INFO L87 Difference]: Start difference. First operand 4718 states. Second operand has 4718 states, 4713 states have (on average 1.4220241884150222) internal successors, (6702), 4713 states have internal predecessors, (6702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:15,977 INFO L93 Difference]: Finished difference Result 4718 states and 6706 transitions. [2022-04-15 11:58:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6706 transitions. [2022-04-15 11:58:15,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:15,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:15,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 4718 states, 4713 states have (on average 1.4220241884150222) internal successors, (6702), 4713 states have internal predecessors, (6702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4718 states. [2022-04-15 11:58:15,986 INFO L87 Difference]: Start difference. First operand has 4718 states, 4713 states have (on average 1.4220241884150222) internal successors, (6702), 4713 states have internal predecessors, (6702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 4718 states. [2022-04-15 11:58:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:16,669 INFO L93 Difference]: Finished difference Result 4718 states and 6706 transitions. [2022-04-15 11:58:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6706 transitions. [2022-04-15 11:58:16,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:16,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:16,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:58:16,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:58:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4718 states, 4713 states have (on average 1.4220241884150222) internal successors, (6702), 4713 states have internal predecessors, (6702), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 6706 transitions. [2022-04-15 11:58:17,766 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 6706 transitions. Word has length 275 [2022-04-15 11:58:17,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:58:17,767 INFO L478 AbstractCegarLoop]: Abstraction has 4718 states and 6706 transitions. [2022-04-15 11:58:17,767 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:17,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4718 states and 6706 transitions. [2022-04-15 11:58:26,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6706 edges. 6706 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 6706 transitions. [2022-04-15 11:58:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2022-04-15 11:58:26,514 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:58:26,514 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:58:26,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-04-15 11:58:26,514 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:58:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:58:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1983859236, now seen corresponding path program 1 times [2022-04-15 11:58:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:26,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190899311] [2022-04-15 11:58:26,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 11:58:26,857 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 11:58:26,857 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 11:58:26,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1983859236, now seen corresponding path program 2 times [2022-04-15 11:58:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:58:26,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068780185] [2022-04-15 11:58:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:58:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:58:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:58:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:58:27,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {564742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {564736#true} is VALID [2022-04-15 11:58:27,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {564736#true} assume true; {564736#true} is VALID [2022-04-15 11:58:27,039 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {564736#true} {564736#true} #725#return; {564736#true} is VALID [2022-04-15 11:58:27,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {564736#true} call ULTIMATE.init(); {564742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:58:27,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {564742#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {564736#true} is VALID [2022-04-15 11:58:27,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {564736#true} assume true; {564736#true} is VALID [2022-04-15 11:58:27,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {564736#true} {564736#true} #725#return; {564736#true} is VALID [2022-04-15 11:58:27,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {564736#true} call #t~ret161 := main(); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {564736#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; {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {564736#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L272 TraceCheckUtils]: 7: Hoare triple {564736#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 8: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {564736#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; {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {564736#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; {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {564736#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {564736#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {564736#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {564736#true} assume 8464 == #t~mem55;havoc #t~mem55; {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {564736#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; {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {564736#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {564736#true} assume 8496 == #t~mem58;havoc #t~mem58; {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {564736#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {564736#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {564736#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {564736#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {564736#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 61: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 62: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {564736#true} assume 8512 == #t~mem60;havoc #t~mem60; {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {564736#true} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {564736#true} assume !(0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296);havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 71: Hoare triple {564736#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 72: Hoare triple {564736#true} assume !(~ret~0 <= 0); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 73: Hoare triple {564736#true} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 74: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 75: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 76: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,044 INFO L290 TraceCheckUtils]: 80: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 83: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 84: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 85: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 86: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 87: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 88: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 89: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 90: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 91: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {564736#true} assume 8528 == #t~mem62;havoc #t~mem62; {564736#true} is VALID [2022-04-15 11:58:27,045 INFO L290 TraceCheckUtils]: 95: Hoare triple {564736#true} call #t~mem99.base, #t~mem99.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem100.base, #t~mem100.offset := read~$Pointer$(#t~mem99.base, 836 + #t~mem99.offset, 4);call #t~mem101 := read~int(#t~mem100.base, 12 + #t~mem100.offset, 4);~l~0 := #t~mem101;havoc #t~mem99.base, #t~mem99.offset;havoc #t~mem100.base, #t~mem100.offset;havoc #t~mem101;call #t~mem102 := read~int(~s.base, 232 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {564736#true} assume 0 != (if 0 == #t~mem102 then 0 else (if 1 == #t~mem102 then 0 else ~bitwiseAnd(#t~mem102, 2097152))) % 4294967296;havoc #t~mem102;call #t~mem103.base, #t~mem103.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem103.base, 871 + #t~mem103.offset, 4);havoc #t~mem103.base, #t~mem103.offset; {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 97: Hoare triple {564736#true} call #t~mem105.base, #t~mem105.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem106 := read~int(#t~mem105.base, 871 + #t~mem105.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {564736#true} assume 0 != #t~mem106;havoc #t~mem105.base, #t~mem105.offset;havoc #t~mem106; {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 99: Hoare triple {564736#true} assume -2147483648 <= #t~nondet115 && #t~nondet115 <= 2147483647;~ret~0 := #t~nondet115;havoc #t~nondet115; {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 100: Hoare triple {564736#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {564736#true} assume !(~ret~0 <= 0); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {564736#true} call write~int(8544, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 104: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 105: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 106: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 107: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 108: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 109: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,046 INFO L290 TraceCheckUtils]: 110: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 111: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 112: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 113: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 114: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 115: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 116: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 117: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 118: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 119: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 120: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 122: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 123: Hoare triple {564736#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 124: Hoare triple {564736#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,047 INFO L290 TraceCheckUtils]: 125: Hoare triple {564736#true} assume 8544 == #t~mem64;havoc #t~mem64; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 126: Hoare triple {564736#true} call #t~mem116 := read~int(~s.base, 180 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 127: Hoare triple {564736#true} assume 0 != #t~mem116;havoc #t~mem116;call #t~mem117.base, #t~mem117.offset := read~$Pointer$(~s.base, 176 + ~s.offset, 4);call #t~mem118.base, #t~mem118.offset := read~$Pointer$(#t~mem117.base, 148 + #t~mem117.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 128: Hoare triple {564736#true} assume !(0 != (#t~mem118.base + #t~mem118.offset) % 4294967296);havoc #t~mem117.base, #t~mem117.offset;havoc #t~mem118.base, #t~mem118.offset; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 129: Hoare triple {564736#true} call #t~mem121.base, #t~mem121.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem122.base, #t~mem122.offset := read~$Pointer$(#t~mem121.base, 836 + #t~mem121.offset, 4);call #t~mem123 := read~int(#t~mem122.base, 12 + #t~mem122.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 130: Hoare triple {564736#true} assume !(0 != (if 0 == #t~mem123 then 0 else (if 1 == #t~mem123 then 0 else ~bitwiseAnd(#t~mem123, 256))) % 4294967296);havoc #t~mem121.base, #t~mem121.offset;havoc #t~mem122.base, #t~mem122.offset;havoc #t~mem123; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 131: Hoare triple {564736#true} call #t~mem126.base, #t~mem126.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(1, #t~mem126.base, 895 + #t~mem126.offset, 4);havoc #t~mem126.base, #t~mem126.offset;assume -2147483648 <= #t~nondet127 && #t~nondet127 <= 2147483647;~ret~0 := #t~nondet127;havoc #t~nondet127; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 132: Hoare triple {564736#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 133: Hoare triple {564736#true} assume !(~ret~0 <= 0);call write~int(8448, ~s.base, 52 + ~s.offset, 4);call #t~mem128.base, #t~mem128.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call write~int(8576, #t~mem128.base, 844 + #t~mem128.offset, 4);havoc #t~mem128.base, #t~mem128.offset;call write~int(0, ~s.base, 64 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 134: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 135: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 136: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 137: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 138: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 139: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 140: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,048 INFO L290 TraceCheckUtils]: 141: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 142: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 143: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 144: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 145: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 146: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 147: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 148: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 149: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 150: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 151: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 152: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 153: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 154: Hoare triple {564736#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 155: Hoare triple {564736#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 156: Hoare triple {564736#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,049 INFO L290 TraceCheckUtils]: 157: Hoare triple {564736#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 158: Hoare triple {564736#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 159: Hoare triple {564736#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 160: Hoare triple {564736#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 161: Hoare triple {564736#true} assume 8576 == #t~mem69;havoc #t~mem69; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 162: Hoare triple {564736#true} assume -2147483648 <= #t~nondet134 && #t~nondet134 <= 2147483647;~ret~0 := #t~nondet134;havoc #t~nondet134; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 163: Hoare triple {564736#true} assume 5 == ~blastFlag~0;~blastFlag~0 := 6; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 164: Hoare triple {564736#true} assume !(~ret~0 <= 0); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 165: Hoare triple {564736#true} assume !(2 == ~ret~0);assume -2147483648 <= #t~nondet135 && #t~nondet135 <= 2147483647;~ret~0 := #t~nondet135;havoc #t~nondet135; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 166: Hoare triple {564736#true} assume 6 == ~blastFlag~0;~blastFlag~0 := 7; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 167: Hoare triple {564736#true} assume !(~ret~0 <= 0);call write~int(0, ~s.base, 64 + ~s.offset, 4);call write~int(8592, ~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 168: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 169: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 170: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 171: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 172: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,050 INFO L290 TraceCheckUtils]: 173: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 174: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 175: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 176: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 177: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 178: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 179: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 180: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 181: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 182: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 183: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 184: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 185: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 186: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 187: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,051 INFO L290 TraceCheckUtils]: 188: Hoare triple {564736#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 189: Hoare triple {564736#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 190: Hoare triple {564736#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 191: Hoare triple {564736#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 192: Hoare triple {564736#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 193: Hoare triple {564736#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 194: Hoare triple {564736#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 195: Hoare triple {564736#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 196: Hoare triple {564736#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 197: Hoare triple {564736#true} assume 8592 == #t~mem71;havoc #t~mem71; {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 198: Hoare triple {564736#true} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~ret~0 := #t~nondet136;havoc #t~nondet136; {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 199: Hoare triple {564736#true} assume 7 == ~blastFlag~0;~blastFlag~0 := 8; {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 200: Hoare triple {564736#true} assume !(~ret~0 <= 0);call write~int(8608, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 201: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 202: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 203: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,052 INFO L290 TraceCheckUtils]: 204: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 205: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 206: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 207: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 208: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 209: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 210: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 211: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 212: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 213: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 214: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 215: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 216: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 217: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 218: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,053 INFO L290 TraceCheckUtils]: 219: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 220: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 221: Hoare triple {564736#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 222: Hoare triple {564736#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 223: Hoare triple {564736#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 224: Hoare triple {564736#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 225: Hoare triple {564736#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 226: Hoare triple {564736#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 227: Hoare triple {564736#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 228: Hoare triple {564736#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 229: Hoare triple {564736#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 230: Hoare triple {564736#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 231: Hoare triple {564736#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 232: Hoare triple {564736#true} assume 8608 == #t~mem73;havoc #t~mem73; {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 233: Hoare triple {564736#true} assume -2147483648 <= #t~nondet137 && #t~nondet137 <= 2147483647;~ret~0 := #t~nondet137;havoc #t~nondet137; {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 234: Hoare triple {564736#true} assume 8 == ~blastFlag~0;~blastFlag~0 := 9; {564736#true} is VALID [2022-04-15 11:58:27,054 INFO L290 TraceCheckUtils]: 235: Hoare triple {564736#true} assume !(~ret~0 <= 0);call write~int(8640, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 236: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 237: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 238: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 239: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 240: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 241: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 242: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 243: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 244: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 245: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 246: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 247: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 248: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 249: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,055 INFO L290 TraceCheckUtils]: 250: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 251: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 252: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 253: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 254: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 255: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 256: Hoare triple {564736#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 257: Hoare triple {564736#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 258: Hoare triple {564736#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 259: Hoare triple {564736#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 260: Hoare triple {564736#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 261: Hoare triple {564736#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 262: Hoare triple {564736#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 263: Hoare triple {564736#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 264: Hoare triple {564736#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,056 INFO L290 TraceCheckUtils]: 265: Hoare triple {564736#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 266: Hoare triple {564736#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 267: Hoare triple {564736#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 268: Hoare triple {564736#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 269: Hoare triple {564736#true} assume 8640 == #t~mem75;havoc #t~mem75; {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 270: Hoare triple {564736#true} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 271: Hoare triple {564736#true} assume 9 == ~blastFlag~0;~blastFlag~0 := 10; {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 272: Hoare triple {564736#true} assume !(~ret~0 <= 0);call #t~mem139 := read~int(~s.base, 92 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 273: Hoare triple {564736#true} assume !(0 != #t~mem139);havoc #t~mem139;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 274: Hoare triple {564736#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 275: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 276: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 277: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 278: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 279: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,057 INFO L290 TraceCheckUtils]: 280: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 281: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 282: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 283: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 284: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 285: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 286: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 287: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 288: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 289: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 290: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 291: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 292: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 293: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 294: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 295: Hoare triple {564736#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,058 INFO L290 TraceCheckUtils]: 296: Hoare triple {564736#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 297: Hoare triple {564736#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 298: Hoare triple {564736#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 299: Hoare triple {564736#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 300: Hoare triple {564736#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 301: Hoare triple {564736#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 302: Hoare triple {564736#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 303: Hoare triple {564736#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 304: Hoare triple {564736#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 305: Hoare triple {564736#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 306: Hoare triple {564736#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 307: Hoare triple {564736#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 308: Hoare triple {564736#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 309: Hoare triple {564736#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 310: Hoare triple {564736#true} assume 8656 == #t~mem77;havoc #t~mem77; {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 311: Hoare triple {564736#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; {564736#true} is VALID [2022-04-15 11:58:27,059 INFO L290 TraceCheckUtils]: 312: Hoare triple {564736#true} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 313: Hoare triple {564736#true} assume 10 == ~blastFlag~0;~blastFlag~0 := 11; {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 314: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 315: Hoare triple {564736#true} assume !(0 == ~tmp___10~0); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 316: Hoare triple {564736#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); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 317: Hoare triple {564736#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 318: Hoare triple {564736#true} ~skip~0 := 0; {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 319: Hoare triple {564736#true} assume !false; {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 320: Hoare triple {564736#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 321: Hoare triple {564736#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 322: Hoare triple {564736#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 323: Hoare triple {564736#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 324: Hoare triple {564736#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 325: Hoare triple {564736#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 326: Hoare triple {564736#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 327: Hoare triple {564736#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,060 INFO L290 TraceCheckUtils]: 328: Hoare triple {564736#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 329: Hoare triple {564736#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 330: Hoare triple {564736#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 331: Hoare triple {564736#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 332: Hoare triple {564736#true} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 333: Hoare triple {564736#true} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 334: Hoare triple {564736#true} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 335: Hoare triple {564736#true} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 336: Hoare triple {564736#true} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 337: Hoare triple {564736#true} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 338: Hoare triple {564736#true} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 339: Hoare triple {564736#true} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 340: Hoare triple {564736#true} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 341: Hoare triple {564736#true} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 342: Hoare triple {564736#true} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,061 INFO L290 TraceCheckUtils]: 343: Hoare triple {564736#true} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 344: Hoare triple {564736#true} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 345: Hoare triple {564736#true} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 346: Hoare triple {564736#true} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 347: Hoare triple {564736#true} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 348: Hoare triple {564736#true} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 349: Hoare triple {564736#true} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 350: Hoare triple {564736#true} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 351: Hoare triple {564736#true} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 352: Hoare triple {564736#true} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 353: Hoare triple {564736#true} assume 8672 == #t~mem79;havoc #t~mem79; {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 354: Hoare triple {564736#true} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {564736#true} is VALID [2022-04-15 11:58:27,062 INFO L290 TraceCheckUtils]: 355: Hoare triple {564736#true} assume 11 == ~blastFlag~0;~blastFlag~0 := 12; {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,063 INFO L290 TraceCheckUtils]: 356: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} 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); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,063 INFO L290 TraceCheckUtils]: 357: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} 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; {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,064 INFO L290 TraceCheckUtils]: 358: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,064 INFO L290 TraceCheckUtils]: 359: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,064 INFO L290 TraceCheckUtils]: 360: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,065 INFO L290 TraceCheckUtils]: 361: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} ~skip~0 := 0; {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,065 INFO L290 TraceCheckUtils]: 362: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !false; {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,065 INFO L290 TraceCheckUtils]: 363: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,066 INFO L290 TraceCheckUtils]: 364: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,066 INFO L290 TraceCheckUtils]: 365: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,066 INFO L290 TraceCheckUtils]: 366: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,066 INFO L290 TraceCheckUtils]: 367: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,067 INFO L290 TraceCheckUtils]: 368: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,067 INFO L290 TraceCheckUtils]: 369: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,067 INFO L290 TraceCheckUtils]: 370: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,068 INFO L290 TraceCheckUtils]: 371: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,068 INFO L290 TraceCheckUtils]: 372: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,068 INFO L290 TraceCheckUtils]: 373: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,068 INFO L290 TraceCheckUtils]: 374: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,069 INFO L290 TraceCheckUtils]: 375: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,069 INFO L290 TraceCheckUtils]: 376: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,069 INFO L290 TraceCheckUtils]: 377: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,070 INFO L290 TraceCheckUtils]: 378: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,070 INFO L290 TraceCheckUtils]: 379: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,070 INFO L290 TraceCheckUtils]: 380: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,071 INFO L290 TraceCheckUtils]: 381: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,071 INFO L290 TraceCheckUtils]: 382: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,071 INFO L290 TraceCheckUtils]: 383: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,071 INFO L290 TraceCheckUtils]: 384: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,072 INFO L290 TraceCheckUtils]: 385: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,072 INFO L290 TraceCheckUtils]: 386: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,072 INFO L290 TraceCheckUtils]: 387: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,073 INFO L290 TraceCheckUtils]: 388: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,073 INFO L290 TraceCheckUtils]: 389: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,073 INFO L290 TraceCheckUtils]: 390: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,074 INFO L290 TraceCheckUtils]: 391: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,074 INFO L290 TraceCheckUtils]: 392: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume 8640 == #t~mem75;havoc #t~mem75; {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,074 INFO L290 TraceCheckUtils]: 393: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume -2147483648 <= #t~nondet138 && #t~nondet138 <= 2147483647;~ret~0 := #t~nondet138;havoc #t~nondet138; {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,074 INFO L290 TraceCheckUtils]: 394: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(9 == ~blastFlag~0); {564741#(= ssl3_accept_~blastFlag~0 12)} is VALID [2022-04-15 11:58:27,075 INFO L290 TraceCheckUtils]: 395: Hoare triple {564741#(= ssl3_accept_~blastFlag~0 12)} assume !(12 == ~blastFlag~0); {564737#false} is VALID [2022-04-15 11:58:27,075 INFO L290 TraceCheckUtils]: 396: Hoare triple {564737#false} assume 15 == ~blastFlag~0; {564737#false} is VALID [2022-04-15 11:58:27,075 INFO L290 TraceCheckUtils]: 397: Hoare triple {564737#false} assume !false; {564737#false} is VALID [2022-04-15 11:58:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2022-04-15 11:58:27,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:58:27,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068780185] [2022-04-15 11:58:27,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068780185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:27,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:27,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:27,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:58:27,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190899311] [2022-04-15 11:58:27,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190899311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:58:27,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:58:27,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:58:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770372944] [2022-04-15 11:58:27,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:58:27,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 398 [2022-04-15 11:58:27,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:58:27,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:27,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:27,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:58:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:58:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:58:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:27,176 INFO L87 Difference]: Start difference. First operand 4718 states and 6706 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:31,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 11:58:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:41,168 INFO L93 Difference]: Finished difference Result 10000 states and 14236 transitions. [2022-04-15 11:58:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:58:41,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 398 [2022-04-15 11:58:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:58:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2022-04-15 11:58:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2022-04-15 11:58:41,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 636 transitions. [2022-04-15 11:58:41,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:58:42,816 INFO L225 Difference]: With dead ends: 10000 [2022-04-15 11:58:42,816 INFO L226 Difference]: Without dead ends: 5310 [2022-04-15 11:58:42,821 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:58:42,821 INFO L913 BasicCegarLoop]: 394 mSDtfsCounter, 146 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 11:58:42,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 588 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 458 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 11:58:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2022-04-15 11:58:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 5310. [2022-04-15 11:58:44,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:58:44,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5310 states. Second operand has 5310 states, 5305 states have (on average 1.42186616399623) internal successors, (7543), 5305 states have internal predecessors, (7543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:44,042 INFO L74 IsIncluded]: Start isIncluded. First operand 5310 states. Second operand has 5310 states, 5305 states have (on average 1.42186616399623) internal successors, (7543), 5305 states have internal predecessors, (7543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:44,044 INFO L87 Difference]: Start difference. First operand 5310 states. Second operand has 5310 states, 5305 states have (on average 1.42186616399623) internal successors, (7543), 5305 states have internal predecessors, (7543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:44,907 INFO L93 Difference]: Finished difference Result 5310 states and 7547 transitions. [2022-04-15 11:58:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 5310 states and 7547 transitions. [2022-04-15 11:58:44,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:44,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:44,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 5310 states, 5305 states have (on average 1.42186616399623) internal successors, (7543), 5305 states have internal predecessors, (7543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5310 states. [2022-04-15 11:58:44,918 INFO L87 Difference]: Start difference. First operand has 5310 states, 5305 states have (on average 1.42186616399623) internal successors, (7543), 5305 states have internal predecessors, (7543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 5310 states. [2022-04-15 11:58:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:58:45,784 INFO L93 Difference]: Finished difference Result 5310 states and 7547 transitions. [2022-04-15 11:58:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5310 states and 7547 transitions. [2022-04-15 11:58:45,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:58:45,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:58:45,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:58:45,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:58:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5310 states, 5305 states have (on average 1.42186616399623) internal successors, (7543), 5305 states have internal predecessors, (7543), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5310 states to 5310 states and 7547 transitions. [2022-04-15 11:58:47,126 INFO L78 Accepts]: Start accepts. Automaton has 5310 states and 7547 transitions. Word has length 398 [2022-04-15 11:58:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:58:47,126 INFO L478 AbstractCegarLoop]: Abstraction has 5310 states and 7547 transitions. [2022-04-15 11:58:47,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:58:47,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5310 states and 7547 transitions.