/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 18:24:21,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 18:24:21,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 18:24:21,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 18:24:21,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 18:24:21,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 18:24:21,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 18:24:21,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 18:24:21,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 18:24:21,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 18:24:21,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 18:24:21,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 18:24:21,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 18:24:21,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 18:24:21,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 18:24:21,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 18:24:21,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 18:24:21,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 18:24:21,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 18:24:21,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 18:24:21,920 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 18:24:21,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 18:24:21,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 18:24:21,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 18:24:21,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 18:24:21,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 18:24:21,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 18:24:21,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 18:24:21,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 18:24:21,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 18:24:21,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 18:24:21,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 18:24:21,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 18:24:21,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 18:24:21,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 18:24:21,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 18:24:21,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 18:24:21,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 18:24:21,934 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 18:24:21,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 18:24:21,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 18:24:21,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 18:24:21,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 18:24:21,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 18:24:21,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 18:24:21,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 18:24:21,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 18:24:21,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 18:24:21,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 18:24:21,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 18:24:21,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 18:24:21,965 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 18:24:21,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 18:24:21,965 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 18:24:21,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 18:24:21,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 18:24:21,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 18:24:21,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 18:24:21,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 18:24:21,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 18:24:21,966 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 18:24:21,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 18:24:21,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 18:24:21,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 18:24:21,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 18:24:21,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 18:24:21,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 18:24:21,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:24:21,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 18:24:21,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 18:24:22,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 18:24:22,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 18:24:22,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 18:24:22,166 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 18:24:22,166 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 18:24:22,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-14 18:24:22,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e2d9aeb/fa9e05761f864025be9a92f10e75dee8/FLAG2495a8036 [2022-04-14 18:24:22,690 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 18:24:22,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.02.i.cil-1.c [2022-04-14 18:24:22,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e2d9aeb/fa9e05761f864025be9a92f10e75dee8/FLAG2495a8036 [2022-04-14 18:24:22,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e2d9aeb/fa9e05761f864025be9a92f10e75dee8 [2022-04-14 18:24:22,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 18:24:22,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 18:24:22,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 18:24:22,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 18:24:22,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 18:24:22,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:24:22" (1/1) ... [2022-04-14 18:24:22,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e32a092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:22, skipping insertion in model container [2022-04-14 18:24:22,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 06:24:22" (1/1) ... [2022-04-14 18:24:22,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 18:24:22,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 18:24:23,074 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.02.i.cil-1.c[72502,72515] [2022-04-14 18:24:23,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:24:23,095 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 18:24:23,204 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.02.i.cil-1.c[72502,72515] [2022-04-14 18:24:23,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 18:24:23,224 INFO L208 MainTranslator]: Completed translation [2022-04-14 18:24:23,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23 WrapperNode [2022-04-14 18:24:23,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 18:24:23,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 18:24:23,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 18:24:23,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 18:24:23,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 18:24:23,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 18:24:23,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 18:24:23,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 18:24:23,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (1/1) ... [2022-04-14 18:24:23,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 18:24:23,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 18:24:23,359 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-14 18:24:23,367 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-14 18:24:23,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 18:24:23,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 18:24:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 18:24:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-14 18:24:23,399 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-14 18:24:23,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 18:24:23,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-14 18:24:23,400 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-14 18:24:23,400 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-14 18:24:23,400 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-14 18:24:23,400 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-14 18:24:23,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-14 18:24:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-14 18:24:23,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 18:24:23,594 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 18:24:23,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 18:24:25,966 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-14 18:24:26,545 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-14 18:24:26,546 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-14 18:24:26,557 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 18:24:26,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 18:24:26,566 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 18:24:26,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:24:26 BoogieIcfgContainer [2022-04-14 18:24:26,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 18:24:26,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 18:24:26,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 18:24:26,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 18:24:26,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 06:24:22" (1/3) ... [2022-04-14 18:24:26,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cba0c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:24:26, skipping insertion in model container [2022-04-14 18:24:26,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 06:24:23" (2/3) ... [2022-04-14 18:24:26,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cba0c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 06:24:26, skipping insertion in model container [2022-04-14 18:24:26,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 06:24:26" (3/3) ... [2022-04-14 18:24:26,574 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.02.i.cil-1.c [2022-04-14 18:24:26,581 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 18:24:26,581 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 18:24:26,622 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 18:24:26,633 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 18:24:26,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 18:24:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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-14 18:24:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-14 18:24:26,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:24:26,660 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:24:26,660 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:24:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:24:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2027838722, now seen corresponding path program 1 times [2022-04-14 18:24:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:24:26,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684538657] [2022-04-14 18:24:26,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:24:26,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:24:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:27,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:24:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:27,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-14 18:24:27,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-14 18:24:27,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-14 18:24:27,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:24:27,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {156#true} is VALID [2022-04-14 18:24:27,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-14 18:24:27,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #661#return; {156#true} is VALID [2022-04-14 18:24:27,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-14 18:24:27,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {156#true} is VALID [2022-04-14 18:24:27,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {156#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {156#true} is VALID [2022-04-14 18:24:27,133 INFO L272 TraceCheckUtils]: 7: Hoare triple {156#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {156#true} is VALID [2022-04-14 18:24:27,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {156#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;~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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {161#(= 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)))); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {161#(= 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; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {161#(= 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); {161#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:27,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {161#(= 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); {162#(= 8464 |ssl3_accept_#t~mem55|)} is VALID [2022-04-14 18:24:27,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {162#(= 8464 |ssl3_accept_#t~mem55|)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {157#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {157#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {157#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {157#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {157#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {157#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {157#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {157#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {157#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {157#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {157#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {157#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {157#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {157#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {157#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {157#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {157#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {157#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {157#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {157#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {157#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {157#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {157#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {157#false} is VALID [2022-04-14 18:24:27,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-14 18:24:27,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {157#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {157#false} is VALID [2022-04-14 18:24:27,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 3 == ~blastFlag~0; {157#false} is VALID [2022-04-14 18:24:27,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-14 18:24:27,148 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-14 18:24:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:24:27,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684538657] [2022-04-14 18:24:27,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684538657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:24:27,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:24:27,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:24:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833822837] [2022-04-14 18:24:27,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:24:27,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-14 18:24:27,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:24:27,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:27,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:27,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:24:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:24:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:24:27,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:24:27,263 INFO L87 Difference]: Start difference. First operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:30,528 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-14 18:24:32,537 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-14 18:24:36,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:24:38,067 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-14 18:24:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:39,433 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-14 18:24:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:24:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-14 18:24:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:24:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-14 18:24:39,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:39,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-14 18:24:39,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-14 18:24:39,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:39,914 INFO L225 Difference]: With dead ends: 324 [2022-04-14 18:24:39,914 INFO L226 Difference]: Without dead ends: 165 [2022-04-14 18:24:39,917 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-14 18:24:39,920 INFO L913 BasicCegarLoop]: 219 mSDtfsCounter, 34 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:24:39,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 577 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-04-14 18:24:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-14 18:24:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-14 18:24:39,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:24:39,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:39,956 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:39,957 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:39,964 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-14 18:24:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-14 18:24:39,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:39,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:39,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-14 18:24:39,967 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 165 states. [2022-04-14 18:24:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:39,974 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-14 18:24:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-14 18:24:39,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:39,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:39,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:24:39,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:24:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.5384615384615385) internal successors, (220), 143 states have internal predecessors, (220), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-14 18:24:39,983 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-14 18:24:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:24:39,984 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-14 18:24:39,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-14 18:24:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-14 18:24:39,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:24:39,986 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:24:39,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 18:24:39,987 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:24:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:24:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1075038228, now seen corresponding path program 1 times [2022-04-14 18:24:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:24:39,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330239163] [2022-04-14 18:24:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:24:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:24:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:24:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:40,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1065#true} is VALID [2022-04-14 18:24:40,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {1065#true} assume true; {1065#true} is VALID [2022-04-14 18:24:40,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1065#true} {1065#true} #661#return; {1065#true} is VALID [2022-04-14 18:24:40,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {1065#true} call ULTIMATE.init(); {1072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:24:40,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {1065#true} is VALID [2022-04-14 18:24:40,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {1065#true} assume true; {1065#true} is VALID [2022-04-14 18:24:40,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1065#true} {1065#true} #661#return; {1065#true} is VALID [2022-04-14 18:24:40,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {1065#true} call #t~ret161 := main(); {1065#true} is VALID [2022-04-14 18:24:40,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {1065#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {1065#true} is VALID [2022-04-14 18:24:40,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {1065#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {1065#true} is VALID [2022-04-14 18:24:40,202 INFO L272 TraceCheckUtils]: 7: Hoare triple {1065#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {1065#true} is VALID [2022-04-14 18:24:40,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {1065#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;~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); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {1070#(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); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {1070#(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); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {1070#(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); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {1070#(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); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(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); {1070#(not (= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:24:40,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {1070#(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); {1071#(not (= |ssl3_accept_#t~mem52| 8480))} is VALID [2022-04-14 18:24:40,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {1071#(not (= |ssl3_accept_#t~mem52| 8480))} assume 8480 == #t~mem52;havoc #t~mem52; {1066#false} is VALID [2022-04-14 18:24:40,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#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; {1066#false} is VALID [2022-04-14 18:24:40,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {1066#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); {1066#false} is VALID [2022-04-14 18:24:40,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {1066#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {1066#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {1066#false} is VALID [2022-04-14 18:24:40,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {1066#false} ~skip~0 := 0; {1066#false} is VALID [2022-04-14 18:24:40,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2022-04-14 18:24:40,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {1066#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {1066#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {1066#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {1066#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {1066#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {1066#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {1066#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {1066#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {1066#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {1066#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {1066#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {1066#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {1066#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {1066#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {1066#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {1066#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {1066#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {1066#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {1066#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {1066#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {1066#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {1066#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {1066#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 51: Hoare triple {1066#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {1066#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {1066#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {1066#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {1066#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {1066#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {1066#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {1066#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {1066#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {1066#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {1066#false} is VALID [2022-04-14 18:24:40,217 INFO L290 TraceCheckUtils]: 61: Hoare triple {1066#false} assume 8672 == #t~mem79;havoc #t~mem79; {1066#false} is VALID [2022-04-14 18:24:40,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {1066#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {1066#false} is VALID [2022-04-14 18:24:40,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {1066#false} assume 3 == ~blastFlag~0; {1066#false} is VALID [2022-04-14 18:24:40,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2022-04-14 18:24:40,218 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-14 18:24:40,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:24:40,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330239163] [2022-04-14 18:24:40,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330239163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:24:40,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:24:40,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:24:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716472929] [2022-04-14 18:24:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:24:40,220 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-14 18:24:40,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:24:40,220 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-14 18:24:40,277 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-14 18:24:40,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:24:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:24:40,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:24:40,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:24:40,280 INFO L87 Difference]: Start difference. First operand 148 states and 224 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-14 18:24:42,301 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-14 18:24:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:43,939 INFO L93 Difference]: Finished difference Result 384 states and 586 transitions. [2022-04-14 18:24:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:24:43,940 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-14 18:24:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:24:43,940 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-14 18:24:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-14 18:24:43,944 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-14 18:24:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-14 18:24:43,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-14 18:24:44,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:44,354 INFO L225 Difference]: With dead ends: 384 [2022-04-14 18:24:44,354 INFO L226 Difference]: Without dead ends: 262 [2022-04-14 18:24:44,357 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-14 18:24:44,361 INFO L913 BasicCegarLoop]: 243 mSDtfsCounter, 137 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-14 18:24:44,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 584 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 602 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-14 18:24:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-14 18:24:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 164. [2022-04-14 18:24:44,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:24:44,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:44,378 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:44,378 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:44,386 INFO L93 Difference]: Finished difference Result 262 states and 398 transitions. [2022-04-14 18:24:44,386 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 398 transitions. [2022-04-14 18:24:44,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:44,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:44,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-14 18:24:44,388 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 262 states. [2022-04-14 18:24:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:44,396 INFO L93 Difference]: Finished difference Result 262 states and 398 transitions. [2022-04-14 18:24:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 398 transitions. [2022-04-14 18:24:44,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:44,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:44,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:24:44,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:24:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.5408805031446542) internal successors, (245), 159 states have internal predecessors, (245), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-04-14 18:24:44,406 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 65 [2022-04-14 18:24:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:24:44,406 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-04-14 18:24:44,407 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-14 18:24:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-04-14 18:24:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-14 18:24:44,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:24:44,408 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:24:44,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 18:24:44,408 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:24:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:24:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1045469476, now seen corresponding path program 1 times [2022-04-14 18:24:44,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:24:44,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173911163] [2022-04-14 18:24:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:24:44,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:24:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:44,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:24:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:44,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {2264#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2257#true} is VALID [2022-04-14 18:24:44,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-04-14 18:24:44,578 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2257#true} {2257#true} #661#return; {2257#true} is VALID [2022-04-14 18:24:44,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {2257#true} call ULTIMATE.init(); {2264#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:24:44,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {2264#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {2257#true} is VALID [2022-04-14 18:24:44,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-04-14 18:24:44,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2257#true} {2257#true} #661#return; {2257#true} is VALID [2022-04-14 18:24:44,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {2257#true} call #t~ret161 := main(); {2257#true} is VALID [2022-04-14 18:24:44,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {2257#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {2257#true} is VALID [2022-04-14 18:24:44,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {2257#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {2257#true} is VALID [2022-04-14 18:24:44,581 INFO L272 TraceCheckUtils]: 7: Hoare triple {2257#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {2257#true} is VALID [2022-04-14 18:24:44,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {2257#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;~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); {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:44,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {2262#(= 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; {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:44,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {2262#(= 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; {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:44,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {2262#(= 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)))); {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:44,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {2262#(= 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); {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:44,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {2262#(= 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; {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:44,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {2262#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:44,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {2262#(= 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); {2263#(= 8464 |ssl3_accept_#t~mem47|)} is VALID [2022-04-14 18:24:44,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#(= 8464 |ssl3_accept_#t~mem47|)} assume 12292 == #t~mem47;havoc #t~mem47; {2258#false} is VALID [2022-04-14 18:24:44,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {2258#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {2258#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {2258#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2258#false} is VALID [2022-04-14 18:24:44,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {2258#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {2258#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); {2258#false} is VALID [2022-04-14 18:24:44,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {2258#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {2258#false} is VALID [2022-04-14 18:24:44,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {2258#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); {2258#false} is VALID [2022-04-14 18:24:44,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {2258#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); {2258#false} is VALID [2022-04-14 18:24:44,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {2258#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {2258#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {2258#false} is VALID [2022-04-14 18:24:44,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {2258#false} ~skip~0 := 0; {2258#false} is VALID [2022-04-14 18:24:44,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {2258#false} assume !false; {2258#false} is VALID [2022-04-14 18:24:44,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {2258#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {2258#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {2258#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {2258#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {2258#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {2258#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {2258#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,592 INFO L290 TraceCheckUtils]: 36: Hoare triple {2258#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,592 INFO L290 TraceCheckUtils]: 37: Hoare triple {2258#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,592 INFO L290 TraceCheckUtils]: 38: Hoare triple {2258#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,592 INFO L290 TraceCheckUtils]: 39: Hoare triple {2258#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {2258#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {2258#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 42: Hoare triple {2258#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 43: Hoare triple {2258#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {2258#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {2258#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {2258#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 47: Hoare triple {2258#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 48: Hoare triple {2258#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,593 INFO L290 TraceCheckUtils]: 49: Hoare triple {2258#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 50: Hoare triple {2258#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 51: Hoare triple {2258#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 52: Hoare triple {2258#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 53: Hoare triple {2258#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 54: Hoare triple {2258#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 55: Hoare triple {2258#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 56: Hoare triple {2258#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,594 INFO L290 TraceCheckUtils]: 57: Hoare triple {2258#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,595 INFO L290 TraceCheckUtils]: 58: Hoare triple {2258#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,595 INFO L290 TraceCheckUtils]: 59: Hoare triple {2258#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {2258#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {2258#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {2258#false} is VALID [2022-04-14 18:24:44,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {2258#false} assume 8672 == #t~mem79;havoc #t~mem79; {2258#false} is VALID [2022-04-14 18:24:44,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {2258#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {2258#false} is VALID [2022-04-14 18:24:44,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {2258#false} assume 3 == ~blastFlag~0; {2258#false} is VALID [2022-04-14 18:24:44,596 INFO L290 TraceCheckUtils]: 65: Hoare triple {2258#false} assume !false; {2258#false} is VALID [2022-04-14 18:24:44,596 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-14 18:24:44,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:24:44,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173911163] [2022-04-14 18:24:44,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173911163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:24:44,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:24:44,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:24:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765856076] [2022-04-14 18:24:44,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:24:44,597 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-14 18:24:44,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:24:44,598 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-14 18:24:44,646 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-14 18:24:44,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:24:44,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:24:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:24:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:24:44,649 INFO L87 Difference]: Start difference. First operand 164 states and 249 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-14 18:24:46,669 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-14 18:24:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:47,591 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-14 18:24:47,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:24:47,591 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-14 18:24:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:24:47,592 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-14 18:24:47,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-14 18:24:47,595 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-14 18:24:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-14 18:24:47,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-14 18:24:47,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:47,871 INFO L225 Difference]: With dead ends: 318 [2022-04-14 18:24:47,871 INFO L226 Difference]: Without dead ends: 180 [2022-04-14 18:24:47,872 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-14 18:24:47,872 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 28 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:24:47,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:24:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-14 18:24:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2022-04-14 18:24:47,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:24:47,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:47,884 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:47,885 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:47,888 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-14 18:24:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-14 18:24:47,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:47,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:47,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-14 18:24:47,890 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-14 18:24:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:47,893 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-14 18:24:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-14 18:24:47,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:47,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:47,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:24:47,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:24:47,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.5345911949685536) internal successors, (244), 159 states have internal predecessors, (244), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 248 transitions. [2022-04-14 18:24:47,898 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 248 transitions. Word has length 66 [2022-04-14 18:24:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:24:47,898 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 248 transitions. [2022-04-14 18:24:47,898 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-14 18:24:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 248 transitions. [2022-04-14 18:24:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-14 18:24:47,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:24:47,899 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-14 18:24:47,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-14 18:24:47,899 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:24:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:24:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash -207458704, now seen corresponding path program 1 times [2022-04-14 18:24:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:24:47,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288517083] [2022-04-14 18:24:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:24:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:24:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:48,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:24:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:48,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {3211#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3204#true} is VALID [2022-04-14 18:24:48,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-14 18:24:48,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3204#true} {3204#true} #661#return; {3204#true} is VALID [2022-04-14 18:24:48,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {3204#true} call ULTIMATE.init(); {3211#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:24:48,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {3211#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {3204#true} is VALID [2022-04-14 18:24:48,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-14 18:24:48,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#true} {3204#true} #661#return; {3204#true} is VALID [2022-04-14 18:24:48,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#true} call #t~ret161 := main(); {3204#true} is VALID [2022-04-14 18:24:48,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {3204#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {3204#true} is VALID [2022-04-14 18:24:48,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {3204#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {3204#true} is VALID [2022-04-14 18:24:48,034 INFO L272 TraceCheckUtils]: 7: Hoare triple {3204#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {3204#true} is VALID [2022-04-14 18:24:48,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {3204#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;~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); {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {3209#(= 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; {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {3209#(= 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; {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {3209#(= 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)))); {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {3209#(= 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); {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {3209#(= 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; {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {3209#(= 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); {3209#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:48,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {3209#(= 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); {3210#(= 8464 |ssl3_accept_#t~mem48|)} is VALID [2022-04-14 18:24:48,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {3210#(= 8464 |ssl3_accept_#t~mem48|)} assume 16384 == #t~mem48;havoc #t~mem48; {3205#false} is VALID [2022-04-14 18:24:48,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {3205#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {3205#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {3205#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {3205#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); {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {3205#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {3205#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); {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {3205#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); {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {3205#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {3205#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {3205#false} ~skip~0 := 0; {3205#false} is VALID [2022-04-14 18:24:48,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {3205#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {3205#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {3205#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {3205#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {3205#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {3205#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {3205#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {3205#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {3205#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {3205#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {3205#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {3205#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {3205#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {3205#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {3205#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {3205#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 45: Hoare triple {3205#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,052 INFO L290 TraceCheckUtils]: 46: Hoare triple {3205#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 47: Hoare triple {3205#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 48: Hoare triple {3205#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {3205#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 50: Hoare triple {3205#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {3205#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 52: Hoare triple {3205#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 53: Hoare triple {3205#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {3205#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 55: Hoare triple {3205#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {3205#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 57: Hoare triple {3205#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 58: Hoare triple {3205#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 59: Hoare triple {3205#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 60: Hoare triple {3205#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 61: Hoare triple {3205#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 62: Hoare triple {3205#false} assume 8672 == #t~mem79;havoc #t~mem79; {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 63: Hoare triple {3205#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {3205#false} is VALID [2022-04-14 18:24:48,054 INFO L290 TraceCheckUtils]: 64: Hoare triple {3205#false} assume 3 == ~blastFlag~0; {3205#false} is VALID [2022-04-14 18:24:48,055 INFO L290 TraceCheckUtils]: 65: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2022-04-14 18:24:48,055 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-14 18:24:48,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:24:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288517083] [2022-04-14 18:24:48,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288517083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:24:48,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:24:48,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:24:48,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366393687] [2022-04-14 18:24:48,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:24:48,056 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-14 18:24:48,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:24:48,057 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-14 18:24:48,104 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-14 18:24:48,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:24:48,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:24:48,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:24:48,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:24:48,105 INFO L87 Difference]: Start difference. First operand 164 states and 248 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-14 18:24:50,138 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-14 18:24:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:51,118 INFO L93 Difference]: Finished difference Result 318 states and 480 transitions. [2022-04-14 18:24:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:24:51,119 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-14 18:24:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:24:51,119 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-14 18:24:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-14 18:24:51,122 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-14 18:24:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-14 18:24:51,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-14 18:24:51,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:51,413 INFO L225 Difference]: With dead ends: 318 [2022-04-14 18:24:51,413 INFO L226 Difference]: Without dead ends: 180 [2022-04-14 18:24:51,414 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-14 18:24:51,414 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:24:51,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:24:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-14 18:24:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2022-04-14 18:24:51,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:24:51,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:51,432 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:51,432 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:51,436 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2022-04-14 18:24:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 267 transitions. [2022-04-14 18:24:51,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:51,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:51,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-14 18:24:51,437 INFO L87 Difference]: Start difference. First operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 180 states. [2022-04-14 18:24:51,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:51,441 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2022-04-14 18:24:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 267 transitions. [2022-04-14 18:24:51,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:51,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:51,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:24:51,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:24:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 159 states have (on average 1.528301886792453) internal successors, (243), 159 states have internal predecessors, (243), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2022-04-14 18:24:51,446 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 66 [2022-04-14 18:24:51,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:24:51,446 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2022-04-14 18:24:51,447 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-14 18:24:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2022-04-14 18:24:51,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-14 18:24:51,447 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:24:51,447 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:24:51,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 18:24:51,448 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:24:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:24:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1867256871, now seen corresponding path program 1 times [2022-04-14 18:24:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:24:51,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875146671] [2022-04-14 18:24:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:24:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:24:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:51,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:24:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:51,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {4158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4151#true} is VALID [2022-04-14 18:24:51,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {4151#true} assume true; {4151#true} is VALID [2022-04-14 18:24:51,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4151#true} {4151#true} #661#return; {4151#true} is VALID [2022-04-14 18:24:51,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {4151#true} call ULTIMATE.init(); {4158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:24:51,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {4158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {4151#true} is VALID [2022-04-14 18:24:51,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {4151#true} assume true; {4151#true} is VALID [2022-04-14 18:24:51,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4151#true} {4151#true} #661#return; {4151#true} is VALID [2022-04-14 18:24:51,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {4151#true} call #t~ret161 := main(); {4151#true} is VALID [2022-04-14 18:24:51,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {4151#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {4151#true} is VALID [2022-04-14 18:24:51,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {4151#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {4151#true} is VALID [2022-04-14 18:24:51,585 INFO L272 TraceCheckUtils]: 7: Hoare triple {4151#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {4151#true} is VALID [2022-04-14 18:24:51,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {4151#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;~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); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} 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; {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} 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; {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} assume !false; {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {4156#(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); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {4156#(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); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {4156#(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); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {4156#(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); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {4156#(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); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {4156#(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); {4156#(not (= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8481))} is VALID [2022-04-14 18:24:51,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {4156#(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); {4157#(not (= |ssl3_accept_#t~mem53| 8481))} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {4157#(not (= |ssl3_accept_#t~mem53| 8481))} assume 8481 == #t~mem53;havoc #t~mem53; {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {4152#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; {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {4152#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); {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {4152#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {4152#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {4152#false} ~skip~0 := 0; {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {4152#false} assume !false; {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {4152#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {4152#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {4152#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {4152#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {4152#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {4152#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {4152#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {4152#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {4152#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {4152#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {4152#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {4152#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {4152#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {4152#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {4152#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {4152#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 45: Hoare triple {4152#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {4152#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 47: Hoare triple {4152#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 48: Hoare triple {4152#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 49: Hoare triple {4152#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,596 INFO L290 TraceCheckUtils]: 50: Hoare triple {4152#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 51: Hoare triple {4152#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 52: Hoare triple {4152#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 53: Hoare triple {4152#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 54: Hoare triple {4152#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 55: Hoare triple {4152#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {4152#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {4152#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {4152#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {4152#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {4152#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {4152#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {4152#false} is VALID [2022-04-14 18:24:51,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {4152#false} assume 8672 == #t~mem79;havoc #t~mem79; {4152#false} is VALID [2022-04-14 18:24:51,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {4152#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {4152#false} is VALID [2022-04-14 18:24:51,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {4152#false} assume 3 == ~blastFlag~0; {4152#false} is VALID [2022-04-14 18:24:51,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {4152#false} assume !false; {4152#false} is VALID [2022-04-14 18:24:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:24:51,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:24:51,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875146671] [2022-04-14 18:24:51,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875146671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:24:51,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:24:51,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:24:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924360939] [2022-04-14 18:24:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:24:51,600 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-14 18:24:51,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:24:51,600 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-14 18:24:51,648 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-14 18:24:51,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:24:51,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:24:51,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:24:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:24:51,649 INFO L87 Difference]: Start difference. First operand 164 states and 247 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-14 18:24:53,672 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-14 18:24:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:54,833 INFO L93 Difference]: Finished difference Result 416 states and 635 transitions. [2022-04-14 18:24:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:24:54,833 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-14 18:24:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:24:54,834 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-14 18:24:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-14 18:24:54,837 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-14 18:24:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-14 18:24:54,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-14 18:24:55,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 567 edges. 567 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:55,234 INFO L225 Difference]: With dead ends: 416 [2022-04-14 18:24:55,234 INFO L226 Difference]: Without dead ends: 278 [2022-04-14 18:24:55,234 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-14 18:24:55,235 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 136 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:24:55,235 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 312 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 463 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:24:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-14 18:24:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 181. [2022-04-14 18:24:55,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:24:55,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:55,241 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:55,242 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:55,246 INFO L93 Difference]: Finished difference Result 278 states and 421 transitions. [2022-04-14 18:24:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 421 transitions. [2022-04-14 18:24:55,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:55,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:55,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-14 18:24:55,247 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 278 states. [2022-04-14 18:24:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:55,252 INFO L93 Difference]: Finished difference Result 278 states and 421 transitions. [2022-04-14 18:24:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 421 transitions. [2022-04-14 18:24:55,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:55,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:55,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:24:55,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:24:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5340909090909092) internal successors, (270), 176 states have internal predecessors, (270), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2022-04-14 18:24:55,255 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 66 [2022-04-14 18:24:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:24:55,255 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2022-04-14 18:24:55,255 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-14 18:24:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2022-04-14 18:24:55,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-14 18:24:55,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:24:55,256 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:24:55,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-14 18:24:55,256 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:24:55,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:24:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1927058904, now seen corresponding path program 1 times [2022-04-14 18:24:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:24:55,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958853684] [2022-04-14 18:24:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:24:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:24:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:24:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:55,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {5437#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5430#true} is VALID [2022-04-14 18:24:55,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {5430#true} assume true; {5430#true} is VALID [2022-04-14 18:24:55,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5430#true} {5430#true} #661#return; {5430#true} is VALID [2022-04-14 18:24:55,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {5430#true} call ULTIMATE.init(); {5437#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:24:55,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {5437#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {5430#true} is VALID [2022-04-14 18:24:55,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2022-04-14 18:24:55,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #661#return; {5430#true} is VALID [2022-04-14 18:24:55,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret161 := main(); {5430#true} is VALID [2022-04-14 18:24:55,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {5430#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {5430#true} is VALID [2022-04-14 18:24:55,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {5430#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {5430#true} is VALID [2022-04-14 18:24:55,384 INFO L272 TraceCheckUtils]: 7: Hoare triple {5430#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {5430#true} is VALID [2022-04-14 18:24:55,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {5430#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;~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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {5435#(= 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; {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {5435#(= 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; {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {5435#(= 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)))); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {5435#(= 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; {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {5435#(= 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); {5435#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:55,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {5435#(= 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); {5436#(= 8464 |ssl3_accept_#t~mem54|)} is VALID [2022-04-14 18:24:55,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {5436#(= 8464 |ssl3_accept_#t~mem54|)} assume 8482 == #t~mem54;havoc #t~mem54; {5431#false} is VALID [2022-04-14 18:24:55,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {5431#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {5431#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {5431#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {5431#false} ~skip~0 := 0; {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {5431#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {5431#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {5431#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {5431#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {5431#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {5431#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {5431#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {5431#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {5431#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {5431#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {5431#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {5431#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {5431#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {5431#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 43: Hoare triple {5431#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {5431#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {5431#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {5431#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {5431#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 48: Hoare triple {5431#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 49: Hoare triple {5431#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {5431#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {5431#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {5431#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 53: Hoare triple {5431#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {5431#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 55: Hoare triple {5431#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 56: Hoare triple {5431#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {5431#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {5431#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {5431#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 60: Hoare triple {5431#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {5431#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 62: Hoare triple {5431#false} assume 8672 == #t~mem79;havoc #t~mem79; {5431#false} is VALID [2022-04-14 18:24:55,398 INFO L290 TraceCheckUtils]: 63: Hoare triple {5431#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {5431#false} is VALID [2022-04-14 18:24:55,399 INFO L290 TraceCheckUtils]: 64: Hoare triple {5431#false} assume 3 == ~blastFlag~0; {5431#false} is VALID [2022-04-14 18:24:55,399 INFO L290 TraceCheckUtils]: 65: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-14 18:24:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:24:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:24:55,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958853684] [2022-04-14 18:24:55,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958853684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:24:55,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:24:55,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:24:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271083566] [2022-04-14 18:24:55,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:24:55,400 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-14 18:24:55,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:24:55,400 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-14 18:24:55,450 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-14 18:24:55,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:24:55,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:24:55,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:24:55,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:24:55,451 INFO L87 Difference]: Start difference. First operand 181 states and 274 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-14 18:24:57,472 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-14 18:24:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:58,372 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2022-04-14 18:24:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:24:58,372 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-14 18:24:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:24:58,372 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-14 18:24:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-14 18:24:58,375 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-14 18:24:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-14 18:24:58,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-14 18:24:58,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:58,732 INFO L225 Difference]: With dead ends: 349 [2022-04-14 18:24:58,732 INFO L226 Difference]: Without dead ends: 194 [2022-04-14 18:24:58,733 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-14 18:24:58,733 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:24:58,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:24:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-14 18:24:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-14 18:24:58,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:24:58,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:58,739 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:58,740 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:58,746 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2022-04-14 18:24:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-04-14 18:24:58,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:58,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:58,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-14 18:24:58,747 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-14 18:24:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:24:58,751 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2022-04-14 18:24:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-04-14 18:24:58,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:24:58,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:24:58,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:24:58,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:24:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5284090909090908) internal successors, (269), 176 states have internal predecessors, (269), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2022-04-14 18:24:58,756 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 66 [2022-04-14 18:24:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:24:58,756 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2022-04-14 18:24:58,756 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-14 18:24:58,756 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2022-04-14 18:24:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-14 18:24:58,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:24:58,760 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:24:58,760 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-14 18:24:58,760 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:24:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:24:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash 527212629, now seen corresponding path program 1 times [2022-04-14 18:24:58,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:24:58,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132757347] [2022-04-14 18:24:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:24:58,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:24:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:24:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:24:58,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {6464#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6457#true} is VALID [2022-04-14 18:24:58,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {6457#true} assume true; {6457#true} is VALID [2022-04-14 18:24:58,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6457#true} {6457#true} #661#return; {6457#true} is VALID [2022-04-14 18:24:58,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {6457#true} call ULTIMATE.init(); {6464#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:24:58,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {6464#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {6457#true} is VALID [2022-04-14 18:24:58,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {6457#true} assume true; {6457#true} is VALID [2022-04-14 18:24:58,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6457#true} {6457#true} #661#return; {6457#true} is VALID [2022-04-14 18:24:58,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {6457#true} call #t~ret161 := main(); {6457#true} is VALID [2022-04-14 18:24:58,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {6457#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {6457#true} is VALID [2022-04-14 18:24:58,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {6457#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {6457#true} is VALID [2022-04-14 18:24:58,887 INFO L272 TraceCheckUtils]: 7: Hoare triple {6457#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {6457#true} is VALID [2022-04-14 18:24:58,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {6457#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;~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); {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {6462#(= 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; {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {6462#(= 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; {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {6462#(= 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)))); {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {6462#(= 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); {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {6462#(= 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; {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {6462#(= 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); {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {6462#(= 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); {6462#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:24:58,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {6462#(= 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); {6463#(= 8464 |ssl3_accept_#t~mem49|)} is VALID [2022-04-14 18:24:58,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {6463#(= 8464 |ssl3_accept_#t~mem49|)} assume 8192 == #t~mem49;havoc #t~mem49; {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {6458#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {6458#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {6458#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {6458#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); {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {6458#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {6458#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); {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {6458#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); {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {6458#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {6458#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {6458#false} is VALID [2022-04-14 18:24:58,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {6458#false} ~skip~0 := 0; {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {6458#false} assume !false; {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {6458#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 31: Hoare triple {6458#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 32: Hoare triple {6458#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {6458#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {6458#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {6458#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {6458#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {6458#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {6458#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {6458#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {6458#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {6458#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {6458#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {6458#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 44: Hoare triple {6458#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {6458#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {6458#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {6458#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {6458#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {6458#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {6458#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {6458#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {6458#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {6458#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {6458#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {6458#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {6458#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {6458#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {6458#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {6458#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,898 INFO L290 TraceCheckUtils]: 60: Hoare triple {6458#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {6458#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {6458#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {6458#false} is VALID [2022-04-14 18:24:58,898 INFO L290 TraceCheckUtils]: 63: Hoare triple {6458#false} assume 8672 == #t~mem79;havoc #t~mem79; {6458#false} is VALID [2022-04-14 18:24:58,898 INFO L290 TraceCheckUtils]: 64: Hoare triple {6458#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {6458#false} is VALID [2022-04-14 18:24:58,898 INFO L290 TraceCheckUtils]: 65: Hoare triple {6458#false} assume 3 == ~blastFlag~0; {6458#false} is VALID [2022-04-14 18:24:58,899 INFO L290 TraceCheckUtils]: 66: Hoare triple {6458#false} assume !false; {6458#false} is VALID [2022-04-14 18:24:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:24:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:24:58,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132757347] [2022-04-14 18:24:58,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132757347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:24:58,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:24:58,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:24:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272305303] [2022-04-14 18:24:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:24:58,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-14 18:24:58,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:24:58,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:24:58,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:24:58,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:24:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:24:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:24:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:24:58,945 INFO L87 Difference]: Start difference. First operand 181 states and 273 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:00,968 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-14 18:25:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:01,836 INFO L93 Difference]: Finished difference Result 349 states and 530 transitions. [2022-04-14 18:25:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:01,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-14 18:25:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-14 18:25:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-14 18:25:01,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 422 transitions. [2022-04-14 18:25:02,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:02,131 INFO L225 Difference]: With dead ends: 349 [2022-04-14 18:25:02,131 INFO L226 Difference]: Without dead ends: 194 [2022-04-14 18:25:02,132 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-14 18:25:02,132 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:02,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:25:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-14 18:25:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-14 18:25:02,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:02,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:02,137 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:02,137 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:02,140 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2022-04-14 18:25:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-04-14 18:25:02,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:02,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:02,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-14 18:25:02,141 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-14 18:25:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:02,144 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2022-04-14 18:25:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-04-14 18:25:02,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:02,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:02,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:02,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5227272727272727) internal successors, (268), 176 states have internal predecessors, (268), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2022-04-14 18:25:02,149 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 67 [2022-04-14 18:25:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:02,149 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2022-04-14 18:25:02,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2022-04-14 18:25:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-14 18:25:02,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:02,153 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:02,153 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-14 18:25:02,153 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1788390677, now seen corresponding path program 1 times [2022-04-14 18:25:02,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:02,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133351778] [2022-04-14 18:25:02,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:02,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:02,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {7491#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7484#true} is VALID [2022-04-14 18:25:02,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {7484#true} assume true; {7484#true} is VALID [2022-04-14 18:25:02,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7484#true} {7484#true} #661#return; {7484#true} is VALID [2022-04-14 18:25:02,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {7484#true} call ULTIMATE.init(); {7491#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:02,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {7491#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {7484#true} is VALID [2022-04-14 18:25:02,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#true} assume true; {7484#true} is VALID [2022-04-14 18:25:02,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#true} {7484#true} #661#return; {7484#true} is VALID [2022-04-14 18:25:02,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#true} call #t~ret161 := main(); {7484#true} is VALID [2022-04-14 18:25:02,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {7484#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {7484#true} is VALID [2022-04-14 18:25:02,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {7484#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {7484#true} is VALID [2022-04-14 18:25:02,283 INFO L272 TraceCheckUtils]: 7: Hoare triple {7484#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {7484#true} is VALID [2022-04-14 18:25:02,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {7484#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;~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); {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {7489#(= 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; {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {7489#(= 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; {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {7489#(= 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)))); {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {7489#(= 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); {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {7489#(= 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; {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {7489#(= 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); {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {7489#(= 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); {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {7489#(= 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); {7489#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:02,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {7489#(= 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); {7490#(= 8464 |ssl3_accept_#t~mem50|)} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {7490#(= 8464 |ssl3_accept_#t~mem50|)} assume 24576 == #t~mem50;havoc #t~mem50; {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {7485#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {7485#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {7485#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {7485#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); {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {7485#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {7485#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); {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {7485#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); {7485#false} is VALID [2022-04-14 18:25:02,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {7485#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,290 INFO L290 TraceCheckUtils]: 28: Hoare triple {7485#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {7485#false} is VALID [2022-04-14 18:25:02,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {7485#false} ~skip~0 := 0; {7485#false} is VALID [2022-04-14 18:25:02,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {7485#false} assume !false; {7485#false} is VALID [2022-04-14 18:25:02,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {7485#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {7485#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {7485#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {7485#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {7485#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,296 INFO L290 TraceCheckUtils]: 36: Hoare triple {7485#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {7485#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {7485#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {7485#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {7485#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {7485#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {7485#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {7485#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {7485#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {7485#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {7485#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {7485#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {7485#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {7485#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {7485#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {7485#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {7485#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {7485#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {7485#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,300 INFO L290 TraceCheckUtils]: 55: Hoare triple {7485#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,300 INFO L290 TraceCheckUtils]: 56: Hoare triple {7485#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {7485#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {7485#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 59: Hoare triple {7485#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 60: Hoare triple {7485#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 61: Hoare triple {7485#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 62: Hoare triple {7485#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {7485#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 64: Hoare triple {7485#false} assume 8672 == #t~mem79;havoc #t~mem79; {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {7485#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 66: Hoare triple {7485#false} assume 3 == ~blastFlag~0; {7485#false} is VALID [2022-04-14 18:25:02,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {7485#false} assume !false; {7485#false} is VALID [2022-04-14 18:25:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:25:02,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:02,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133351778] [2022-04-14 18:25:02,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133351778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:02,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:02,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:02,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950081555] [2022-04-14 18:25:02,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:02,304 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-14 18:25:02,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:02,304 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-14 18:25:02,373 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-14 18:25:02,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:02,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:02,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:02,375 INFO L87 Difference]: Start difference. First operand 181 states and 272 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-14 18:25:04,396 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-14 18:25:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:05,345 INFO L93 Difference]: Finished difference Result 349 states and 529 transitions. [2022-04-14 18:25:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:05,345 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-14 18:25:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:05,346 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-14 18:25:05,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-14 18:25:05,350 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-14 18:25:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-14 18:25:05,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 421 transitions. [2022-04-14 18:25:05,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:05,648 INFO L225 Difference]: With dead ends: 349 [2022-04-14 18:25:05,648 INFO L226 Difference]: Without dead ends: 194 [2022-04-14 18:25:05,649 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-14 18:25:05,649 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:05,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:25:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-14 18:25:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-14 18:25:05,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:05,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:05,662 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:05,662 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:05,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:05,666 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2022-04-14 18:25:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-04-14 18:25:05,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:05,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:05,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-14 18:25:05,667 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 194 states. [2022-04-14 18:25:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:05,670 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2022-04-14 18:25:05,671 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-04-14 18:25:05,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:05,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:05,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:05,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:05,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5170454545454546) internal successors, (267), 176 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2022-04-14 18:25:05,674 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 68 [2022-04-14 18:25:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:05,674 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2022-04-14 18:25:05,675 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-14 18:25:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2022-04-14 18:25:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-14 18:25:05,677 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:05,677 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:05,677 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-14 18:25:05,677 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:05,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:05,678 INFO L85 PathProgramCache]: Analyzing trace with hash -2103559590, now seen corresponding path program 1 times [2022-04-14 18:25:05,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:05,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101731965] [2022-04-14 18:25:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:05,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:05,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {8518#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8511#true} is VALID [2022-04-14 18:25:05,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {8511#true} assume true; {8511#true} is VALID [2022-04-14 18:25:05,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8511#true} {8511#true} #661#return; {8511#true} is VALID [2022-04-14 18:25:05,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {8511#true} call ULTIMATE.init(); {8518#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:05,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {8518#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {8511#true} is VALID [2022-04-14 18:25:05,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {8511#true} assume true; {8511#true} is VALID [2022-04-14 18:25:05,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8511#true} {8511#true} #661#return; {8511#true} is VALID [2022-04-14 18:25:05,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {8511#true} call #t~ret161 := main(); {8511#true} is VALID [2022-04-14 18:25:05,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {8511#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {8511#true} is VALID [2022-04-14 18:25:05,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {8511#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {8511#true} is VALID [2022-04-14 18:25:05,786 INFO L272 TraceCheckUtils]: 7: Hoare triple {8511#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {8511#true} is VALID [2022-04-14 18:25:05,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {8511#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;~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); {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {8516#(= 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; {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {8516#(= 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; {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {8516#(= 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)))); {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {8516#(= 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); {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {8516#(= 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; {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {8516#(= 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); {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {8516#(= 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); {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {8516#(= 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); {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {8516#(= 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); {8516#(= 8464 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:05,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {8516#(= 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); {8517#(= 8464 |ssl3_accept_#t~mem51|)} is VALID [2022-04-14 18:25:05,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {8517#(= 8464 |ssl3_accept_#t~mem51|)} assume 8195 == #t~mem51;havoc #t~mem51; {8512#false} is VALID [2022-04-14 18:25:05,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {8512#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {8512#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8512#false} is VALID [2022-04-14 18:25:05,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {8512#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {8512#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); {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {8512#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {8512#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); {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {8512#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); {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {8512#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {8512#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {8512#false} ~skip~0 := 0; {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 31: Hoare triple {8512#false} assume !false; {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {8512#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {8512#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {8512#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {8512#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {8512#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {8512#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {8512#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {8512#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {8512#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {8512#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {8512#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {8512#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {8512#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {8512#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {8512#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {8512#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {8512#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {8512#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {8512#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {8512#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {8512#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 53: Hoare triple {8512#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {8512#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {8512#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 56: Hoare triple {8512#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {8512#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 58: Hoare triple {8512#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 59: Hoare triple {8512#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 60: Hoare triple {8512#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 61: Hoare triple {8512#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 62: Hoare triple {8512#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 63: Hoare triple {8512#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 64: Hoare triple {8512#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 65: Hoare triple {8512#false} assume 8672 == #t~mem79;havoc #t~mem79; {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 66: Hoare triple {8512#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 67: Hoare triple {8512#false} assume 3 == ~blastFlag~0; {8512#false} is VALID [2022-04-14 18:25:05,796 INFO L290 TraceCheckUtils]: 68: Hoare triple {8512#false} assume !false; {8512#false} is VALID [2022-04-14 18:25:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:25:05,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:05,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101731965] [2022-04-14 18:25:05,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101731965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:05,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:05,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:05,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420194356] [2022-04-14 18:25:05,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:05,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-14 18:25:05,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:05,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:05,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:05,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:05,850 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:07,871 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-14 18:25:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:08,719 INFO L93 Difference]: Finished difference Result 339 states and 515 transitions. [2022-04-14 18:25:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:08,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-14 18:25:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-14 18:25:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-14 18:25:08,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-14 18:25:09,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:09,038 INFO L225 Difference]: With dead ends: 339 [2022-04-14 18:25:09,038 INFO L226 Difference]: Without dead ends: 184 [2022-04-14 18:25:09,039 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-14 18:25:09,039 INFO L913 BasicCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:09,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:25:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-14 18:25:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-04-14 18:25:09,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:09,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:09,044 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:09,045 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:09,050 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-14 18:25:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2022-04-14 18:25:09,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:09,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:09,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-14 18:25:09,052 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 184 states. [2022-04-14 18:25:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:09,056 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-14 18:25:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2022-04-14 18:25:09,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:09,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:09,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:09,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 176 states have internal predecessors, (266), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 270 transitions. [2022-04-14 18:25:09,061 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 270 transitions. Word has length 69 [2022-04-14 18:25:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:09,061 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 270 transitions. [2022-04-14 18:25:09,062 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-14 18:25:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-14 18:25:09,063 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:09,063 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:09,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-14 18:25:09,064 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash 890818627, now seen corresponding path program 1 times [2022-04-14 18:25:09,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:09,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117480013] [2022-04-14 18:25:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:09,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {9514#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9507#true} is VALID [2022-04-14 18:25:09,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-04-14 18:25:09,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9507#true} {9507#true} #661#return; {9507#true} is VALID [2022-04-14 18:25:09,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {9507#true} call ULTIMATE.init(); {9514#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:09,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {9514#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {9507#true} is VALID [2022-04-14 18:25:09,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-04-14 18:25:09,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9507#true} {9507#true} #661#return; {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {9507#true} call #t~ret161 := main(); {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {9507#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {9507#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L272 TraceCheckUtils]: 7: Hoare triple {9507#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {9507#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;~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); {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {9507#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; {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {9507#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; {9507#true} is VALID [2022-04-14 18:25:09,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {9507#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9507#true} is VALID [2022-04-14 18:25:09,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {9507#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {9507#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {9507#true} is VALID [2022-04-14 18:25:09,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {9507#true} assume !false; {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {9507#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {9507#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {9507#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {9507#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {9507#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {9507#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {9507#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {9507#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {9507#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9507#true} is VALID [2022-04-14 18:25:09,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {9507#true} assume 8464 == #t~mem55;havoc #t~mem55; {9507#true} is VALID [2022-04-14 18:25:09,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {9507#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; {9507#true} is VALID [2022-04-14 18:25:09,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {9507#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9507#true} is VALID [2022-04-14 18:25:09,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {9507#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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {9512#(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; {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,212 INFO L290 TraceCheckUtils]: 35: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,213 INFO L290 TraceCheckUtils]: 37: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,214 INFO L290 TraceCheckUtils]: 41: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,216 INFO L290 TraceCheckUtils]: 46: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,219 INFO L290 TraceCheckUtils]: 55: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,220 INFO L290 TraceCheckUtils]: 57: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,220 INFO L290 TraceCheckUtils]: 58: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,221 INFO L290 TraceCheckUtils]: 59: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {9512#(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); {9512#(not (= 8672 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:09,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {9512#(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); {9513#(not (= |ssl3_accept_#t~mem79| 8672))} is VALID [2022-04-14 18:25:09,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {9513#(not (= |ssl3_accept_#t~mem79| 8672))} assume 8672 == #t~mem79;havoc #t~mem79; {9508#false} is VALID [2022-04-14 18:25:09,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {9508#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {9508#false} is VALID [2022-04-14 18:25:09,225 INFO L290 TraceCheckUtils]: 67: Hoare triple {9508#false} assume 3 == ~blastFlag~0; {9508#false} is VALID [2022-04-14 18:25:09,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {9508#false} assume !false; {9508#false} is VALID [2022-04-14 18:25:09,226 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-14 18:25:09,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:09,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117480013] [2022-04-14 18:25:09,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117480013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:09,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:09,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139164417] [2022-04-14 18:25:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-14 18:25:09,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:09,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:09,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:09,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:09,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:09,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:09,277 INFO L87 Difference]: Start difference. First operand 181 states and 270 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:11,298 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-14 18:25:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:12,391 INFO L93 Difference]: Finished difference Result 450 states and 684 transitions. [2022-04-14 18:25:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-14 18:25:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-14 18:25:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-14 18:25:12,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-14 18:25:12,819 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-14 18:25:12,823 INFO L225 Difference]: With dead ends: 450 [2022-04-14 18:25:12,824 INFO L226 Difference]: Without dead ends: 295 [2022-04-14 18:25:12,824 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-14 18:25:12,824 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 109 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:12,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 313 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:25:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-14 18:25:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 224. [2022-04-14 18:25:12,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:12,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:12,832 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:12,833 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:12,840 INFO L93 Difference]: Finished difference Result 295 states and 443 transitions. [2022-04-14 18:25:12,840 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 443 transitions. [2022-04-14 18:25:12,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:12,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:12,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 295 states. [2022-04-14 18:25:12,842 INFO L87 Difference]: Start difference. First operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 295 states. [2022-04-14 18:25:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:12,848 INFO L93 Difference]: Finished difference Result 295 states and 443 transitions. [2022-04-14 18:25:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 443 transitions. [2022-04-14 18:25:12,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:12,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:12,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:12,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:12,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 219 states have (on average 1.5707762557077625) internal successors, (344), 219 states have internal predecessors, (344), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 348 transitions. [2022-04-14 18:25:12,854 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 348 transitions. Word has length 69 [2022-04-14 18:25:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:12,854 INFO L478 AbstractCegarLoop]: Abstraction has 224 states and 348 transitions. [2022-04-14 18:25:12,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 348 transitions. [2022-04-14 18:25:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-14 18:25:12,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:12,855 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:12,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-14 18:25:12,855 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1838419001, now seen corresponding path program 1 times [2022-04-14 18:25:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:12,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282841178] [2022-04-14 18:25:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:12,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:12,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {10910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10903#true} is VALID [2022-04-14 18:25:12,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {10903#true} assume true; {10903#true} is VALID [2022-04-14 18:25:12,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10903#true} {10903#true} #661#return; {10903#true} is VALID [2022-04-14 18:25:12,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {10903#true} call ULTIMATE.init(); {10910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:12,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {10910#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {10903#true} is VALID [2022-04-14 18:25:12,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {10903#true} assume true; {10903#true} is VALID [2022-04-14 18:25:12,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10903#true} {10903#true} #661#return; {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {10903#true} call #t~ret161 := main(); {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {10903#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {10903#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L272 TraceCheckUtils]: 7: Hoare triple {10903#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {10903#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;~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); {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {10903#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; {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {10903#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; {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {10903#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {10903#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {10903#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {10903#true} is VALID [2022-04-14 18:25:12,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {10903#true} assume !false; {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {10903#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {10903#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {10903#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {10903#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {10903#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {10903#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {10903#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {10903#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {10903#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {10903#true} assume 8464 == #t~mem55;havoc #t~mem55; {10903#true} is VALID [2022-04-14 18:25:12,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {10903#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; {10903#true} is VALID [2022-04-14 18:25:12,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {10903#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10903#true} is VALID [2022-04-14 18:25:12,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {10903#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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {10908#(= 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; {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,991 INFO L290 TraceCheckUtils]: 39: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,991 INFO L290 TraceCheckUtils]: 40: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,992 INFO L290 TraceCheckUtils]: 41: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,992 INFO L290 TraceCheckUtils]: 42: Hoare triple {10908#(= 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); {10908#(= 8496 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:12,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {10908#(= 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); {10909#(= |ssl3_accept_#t~mem58| 8496)} is VALID [2022-04-14 18:25:12,992 INFO L290 TraceCheckUtils]: 44: Hoare triple {10909#(= |ssl3_accept_#t~mem58| 8496)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {10904#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {10904#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {10904#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {10904#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {10904#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {10904#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {10904#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {10904#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {10904#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 54: Hoare triple {10904#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,993 INFO L290 TraceCheckUtils]: 55: Hoare triple {10904#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {10904#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {10904#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {10904#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 59: Hoare triple {10904#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {10904#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {10904#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {10904#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {10904#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {10904#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {10904#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {10904#false} is VALID [2022-04-14 18:25:12,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {10904#false} assume 8673 == #t~mem80;havoc #t~mem80; {10904#false} is VALID [2022-04-14 18:25:12,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {10904#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {10904#false} is VALID [2022-04-14 18:25:12,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {10904#false} assume 3 == ~blastFlag~0; {10904#false} is VALID [2022-04-14 18:25:12,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {10904#false} assume !false; {10904#false} is VALID [2022-04-14 18:25:12,995 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-14 18:25:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:12,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282841178] [2022-04-14 18:25:12,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282841178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:12,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:12,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580452348] [2022-04-14 18:25:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-14 18:25:12,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:12,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:13,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:13,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:13,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:13,054 INFO L87 Difference]: Start difference. First operand 224 states and 348 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:15,077 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-14 18:25:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:16,022 INFO L93 Difference]: Finished difference Result 464 states and 730 transitions. [2022-04-14 18:25:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-14 18:25:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-14 18:25:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-14 18:25:16,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-14 18:25:16,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 455 edges. 455 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:16,334 INFO L225 Difference]: With dead ends: 464 [2022-04-14 18:25:16,334 INFO L226 Difference]: Without dead ends: 266 [2022-04-14 18:25:16,335 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-14 18:25:16,335 INFO L913 BasicCegarLoop]: 186 mSDtfsCounter, 34 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:16,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 477 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 18:25:16,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-04-14 18:25:16,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 246. [2022-04-14 18:25:16,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:16,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,343 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,343 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:16,347 INFO L93 Difference]: Finished difference Result 266 states and 411 transitions. [2022-04-14 18:25:16,347 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 411 transitions. [2022-04-14 18:25:16,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:16,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:16,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-14 18:25:16,349 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 266 states. [2022-04-14 18:25:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:16,353 INFO L93 Difference]: Finished difference Result 266 states and 411 transitions. [2022-04-14 18:25:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 411 transitions. [2022-04-14 18:25:16,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:16,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:16,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:16,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5767634854771784) internal successors, (380), 241 states have internal predecessors, (380), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 384 transitions. [2022-04-14 18:25:16,357 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 384 transitions. Word has length 70 [2022-04-14 18:25:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:16,358 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 384 transitions. [2022-04-14 18:25:16,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 384 transitions. [2022-04-14 18:25:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-14 18:25:16,359 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:16,359 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:16,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 18:25:16,359 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:16,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1454749477, now seen corresponding path program 1 times [2022-04-14 18:25:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:16,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941056097] [2022-04-14 18:25:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:16,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {12274#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12267#true} is VALID [2022-04-14 18:25:16,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {12267#true} assume true; {12267#true} is VALID [2022-04-14 18:25:16,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12267#true} {12267#true} #661#return; {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {12267#true} call ULTIMATE.init(); {12274#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:16,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {12274#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {12267#true} assume true; {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12267#true} {12267#true} #661#return; {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {12267#true} call #t~ret161 := main(); {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {12267#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L272 TraceCheckUtils]: 7: Hoare triple {12267#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {12267#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;~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); {12267#true} is VALID [2022-04-14 18:25:16,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {12267#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; {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {12267#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; {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {12267#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {12267#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {12267#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {12267#true} assume !false; {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {12267#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {12267#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {12267#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {12267#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {12267#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {12267#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {12267#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {12267#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {12267#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {12267#true} assume 8464 == #t~mem55;havoc #t~mem55; {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {12267#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; {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {12267#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {12267#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); {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {12267#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); {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {12267#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {12267#true} ~skip~0 := 0; {12267#true} is VALID [2022-04-14 18:25:16,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {12267#true} assume !false; {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {12267#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {12267#true} assume 12292 == #t~mem47;havoc #t~mem47; {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {12267#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {12267#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {12267#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {12267#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {12267#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); {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {12267#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {12267#true} is VALID [2022-04-14 18:25:16,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {12267#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); {12267#true} is VALID [2022-04-14 18:25:16,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {12267#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); {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,495 INFO L290 TraceCheckUtils]: 42: Hoare triple {12272#(= 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); {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {12272#(= 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; {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,496 INFO L290 TraceCheckUtils]: 44: Hoare triple {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,497 INFO L290 TraceCheckUtils]: 46: Hoare triple {12272#(= 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); {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,497 INFO L290 TraceCheckUtils]: 47: Hoare triple {12272#(= 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); {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,497 INFO L290 TraceCheckUtils]: 48: Hoare triple {12272#(= 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); {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,498 INFO L290 TraceCheckUtils]: 49: Hoare triple {12272#(= 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); {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,498 INFO L290 TraceCheckUtils]: 50: Hoare triple {12272#(= 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); {12272#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:16,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {12272#(= 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); {12273#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-14 18:25:16,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {12273#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,499 INFO L290 TraceCheckUtils]: 53: Hoare triple {12268#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {12268#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {12268#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {12268#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 57: Hoare triple {12268#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 58: Hoare triple {12268#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 59: Hoare triple {12268#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 60: Hoare triple {12268#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 61: Hoare triple {12268#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 62: Hoare triple {12268#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 63: Hoare triple {12268#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 64: Hoare triple {12268#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,500 INFO L290 TraceCheckUtils]: 65: Hoare triple {12268#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 66: Hoare triple {12268#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 67: Hoare triple {12268#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {12268#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {12268#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {12268#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 71: Hoare triple {12268#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {12268#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {12268#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {12268#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 75: Hoare triple {12268#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {12268#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 77: Hoare triple {12268#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {12268#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 79: Hoare triple {12268#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 80: Hoare triple {12268#false} assume 8673 == #t~mem80;havoc #t~mem80; {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 81: Hoare triple {12268#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 82: Hoare triple {12268#false} assume 3 == ~blastFlag~0; {12268#false} is VALID [2022-04-14 18:25:16,502 INFO L290 TraceCheckUtils]: 83: Hoare triple {12268#false} assume !false; {12268#false} is VALID [2022-04-14 18:25:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-14 18:25:16,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941056097] [2022-04-14 18:25:16,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941056097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:16,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:16,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:16,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999712630] [2022-04-14 18:25:16,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-14 18:25:16,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:16,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:16,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:16,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:16,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:16,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:16,567 INFO L87 Difference]: Start difference. First operand 246 states and 384 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:18,589 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-14 18:25:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:19,768 INFO L93 Difference]: Finished difference Result 479 states and 754 transitions. [2022-04-14 18:25:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:19,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-14 18:25:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-14 18:25:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-14 18:25:19,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-14 18:25:20,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:20,106 INFO L225 Difference]: With dead ends: 479 [2022-04-14 18:25:20,107 INFO L226 Difference]: Without dead ends: 259 [2022-04-14 18:25:20,107 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-14 18:25:20,108 INFO L913 BasicCegarLoop]: 220 mSDtfsCounter, 22 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:20,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 544 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:25:20,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-14 18:25:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2022-04-14 18:25:20,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:20,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:20,113 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:20,114 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:20,119 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2022-04-14 18:25:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 399 transitions. [2022-04-14 18:25:20,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:20,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:20,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-14 18:25:20,121 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 259 states. [2022-04-14 18:25:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:20,125 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2022-04-14 18:25:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 399 transitions. [2022-04-14 18:25:20,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:20,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:20,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:20,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 241 states have internal predecessors, (379), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 383 transitions. [2022-04-14 18:25:20,131 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 383 transitions. Word has length 84 [2022-04-14 18:25:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:20,132 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 383 transitions. [2022-04-14 18:25:20,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 383 transitions. [2022-04-14 18:25:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-14 18:25:20,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:20,133 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:20,133 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-14 18:25:20,133 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1280749327, now seen corresponding path program 1 times [2022-04-14 18:25:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:20,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154489199] [2022-04-14 18:25:20,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:20,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:20,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:20,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {13639#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13632#true} is VALID [2022-04-14 18:25:20,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {13632#true} assume true; {13632#true} is VALID [2022-04-14 18:25:20,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13632#true} {13632#true} #661#return; {13632#true} is VALID [2022-04-14 18:25:20,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {13632#true} call ULTIMATE.init(); {13639#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:20,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {13639#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13632#true} is VALID [2022-04-14 18:25:20,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {13632#true} assume true; {13632#true} is VALID [2022-04-14 18:25:20,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13632#true} {13632#true} #661#return; {13632#true} is VALID [2022-04-14 18:25:20,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {13632#true} call #t~ret161 := main(); {13632#true} is VALID [2022-04-14 18:25:20,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {13632#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {13632#true} is VALID [2022-04-14 18:25:20,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {13632#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L272 TraceCheckUtils]: 7: Hoare triple {13632#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {13632#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;~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); {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {13632#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; {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {13632#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; {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {13632#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {13632#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {13632#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13632#true} is VALID [2022-04-14 18:25:20,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {13632#true} assume !false; {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {13632#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {13632#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {13632#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {13632#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {13632#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {13632#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {13632#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 22: Hoare triple {13632#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {13632#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13632#true} is VALID [2022-04-14 18:25:20,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {13632#true} assume 8464 == #t~mem55;havoc #t~mem55; {13632#true} is VALID [2022-04-14 18:25:20,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {13632#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; {13632#true} is VALID [2022-04-14 18:25:20,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {13632#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13632#true} is VALID [2022-04-14 18:25:20,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {13632#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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {13637#(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; {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,264 INFO L290 TraceCheckUtils]: 38: Hoare triple {13637#(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); {13637#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:20,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {13637#(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); {13638#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-14 18:25:20,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {13638#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {13633#false} is VALID [2022-04-14 18:25:20,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {13633#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,264 INFO L290 TraceCheckUtils]: 42: Hoare triple {13633#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {13633#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {13633#false} ~skip~0 := 0; {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {13633#false} assume !false; {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {13633#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 47: Hoare triple {13633#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {13633#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 49: Hoare triple {13633#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 50: Hoare triple {13633#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {13633#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {13633#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {13633#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 54: Hoare triple {13633#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {13633#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {13633#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {13633#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {13633#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 59: Hoare triple {13633#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {13633#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {13633#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {13633#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {13633#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 64: Hoare triple {13633#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {13633#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {13633#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 67: Hoare triple {13633#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {13633#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {13633#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 70: Hoare triple {13633#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,267 INFO L290 TraceCheckUtils]: 71: Hoare triple {13633#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 72: Hoare triple {13633#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 73: Hoare triple {13633#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 74: Hoare triple {13633#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 75: Hoare triple {13633#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 76: Hoare triple {13633#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 77: Hoare triple {13633#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 78: Hoare triple {13633#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 79: Hoare triple {13633#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {13633#false} is VALID [2022-04-14 18:25:20,268 INFO L290 TraceCheckUtils]: 80: Hoare triple {13633#false} assume 8673 == #t~mem80;havoc #t~mem80; {13633#false} is VALID [2022-04-14 18:25:20,269 INFO L290 TraceCheckUtils]: 81: Hoare triple {13633#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {13633#false} is VALID [2022-04-14 18:25:20,269 INFO L290 TraceCheckUtils]: 82: Hoare triple {13633#false} assume 3 == ~blastFlag~0; {13633#false} is VALID [2022-04-14 18:25:20,269 INFO L290 TraceCheckUtils]: 83: Hoare triple {13633#false} assume !false; {13633#false} is VALID [2022-04-14 18:25:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:25:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154489199] [2022-04-14 18:25:20,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154489199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:20,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:20,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382379661] [2022-04-14 18:25:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:20,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-14 18:25:20,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:20,271 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-14 18:25:20,331 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-14 18:25:20,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:20,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:20,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:20,332 INFO L87 Difference]: Start difference. First operand 246 states and 383 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-14 18:25:22,357 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-14 18:25:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:23,737 INFO L93 Difference]: Finished difference Result 562 states and 882 transitions. [2022-04-14 18:25:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-14 18:25:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:23,738 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-14 18:25:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-14 18:25:23,741 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-14 18:25:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-14 18:25:23,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-14 18:25:24,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 565 edges. 565 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:24,184 INFO L225 Difference]: With dead ends: 562 [2022-04-14 18:25:24,185 INFO L226 Difference]: Without dead ends: 342 [2022-04-14 18:25:24,185 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-14 18:25:24,186 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 135 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:24,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2022-04-14 18:25:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-14 18:25:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 247. [2022-04-14 18:25:24,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:24,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:24,197 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:24,197 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:24,204 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2022-04-14 18:25:24,204 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 526 transitions. [2022-04-14 18:25:24,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:24,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:24,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 342 states. [2022-04-14 18:25:24,206 INFO L87 Difference]: Start difference. First operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 342 states. [2022-04-14 18:25:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:24,212 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2022-04-14 18:25:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 526 transitions. [2022-04-14 18:25:24,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:24,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:24,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:24,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 242 states have (on average 1.56198347107438) internal successors, (378), 242 states have internal predecessors, (378), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 382 transitions. [2022-04-14 18:25:24,218 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 382 transitions. Word has length 84 [2022-04-14 18:25:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:24,219 INFO L478 AbstractCegarLoop]: Abstraction has 247 states and 382 transitions. [2022-04-14 18:25:24,219 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-14 18:25:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 382 transitions. [2022-04-14 18:25:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-14 18:25:24,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:24,220 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:24,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-14 18:25:24,221 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:24,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1669457340, now seen corresponding path program 1 times [2022-04-14 18:25:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:24,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255288219] [2022-04-14 18:25:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:24,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:24,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:24,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {15272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15264#true} is VALID [2022-04-14 18:25:24,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {15264#true} assume true; {15264#true} is VALID [2022-04-14 18:25:24,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15264#true} {15264#true} #661#return; {15264#true} is VALID [2022-04-14 18:25:24,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {15264#true} call ULTIMATE.init(); {15272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:24,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {15272#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15264#true} is VALID [2022-04-14 18:25:24,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {15264#true} assume true; {15264#true} is VALID [2022-04-14 18:25:24,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15264#true} {15264#true} #661#return; {15264#true} is VALID [2022-04-14 18:25:24,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {15264#true} call #t~ret161 := main(); {15264#true} is VALID [2022-04-14 18:25:24,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {15264#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {15264#true} is VALID [2022-04-14 18:25:24,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {15264#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L272 TraceCheckUtils]: 7: Hoare triple {15264#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {15264#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;~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); {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {15264#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; {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {15264#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; {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {15264#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {15264#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {15264#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {15264#true} assume !false; {15264#true} is VALID [2022-04-14 18:25:24,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {15264#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {15264#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {15264#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {15264#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {15264#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {15264#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {15264#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {15264#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {15264#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15264#true} is VALID [2022-04-14 18:25:24,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {15264#true} assume 8464 == #t~mem55;havoc #t~mem55; {15264#true} is VALID [2022-04-14 18:25:24,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {15264#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; {15264#true} is VALID [2022-04-14 18:25:24,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {15264#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15264#true} is VALID [2022-04-14 18:25:24,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {15264#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); {15264#true} is VALID [2022-04-14 18:25:24,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {15264#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); {15264#true} is VALID [2022-04-14 18:25:24,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {15264#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15264#true} is VALID [2022-04-14 18:25:24,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {15264#true} ~skip~0 := 0; {15264#true} is VALID [2022-04-14 18:25:24,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {15264#true} assume !false; {15264#true} is VALID [2022-04-14 18:25:24,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {15264#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15269#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {15269#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,371 INFO L290 TraceCheckUtils]: 36: Hoare triple {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {15270#(= 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); {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {15270#(= 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; {15270#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:24,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {15270#(= 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); {15271#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-14 18:25:24,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {15271#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {15265#false} is VALID [2022-04-14 18:25:24,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {15265#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; {15265#false} is VALID [2022-04-14 18:25:24,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {15265#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {15265#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {15265#false} ~skip~0 := 0; {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {15265#false} assume !false; {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {15265#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {15265#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {15265#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {15265#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {15265#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {15265#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {15265#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {15265#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {15265#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {15265#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {15265#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {15265#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {15265#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {15265#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {15265#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 62: Hoare triple {15265#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 63: Hoare triple {15265#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 64: Hoare triple {15265#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 65: Hoare triple {15265#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 66: Hoare triple {15265#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 67: Hoare triple {15265#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 68: Hoare triple {15265#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 69: Hoare triple {15265#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 70: Hoare triple {15265#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,377 INFO L290 TraceCheckUtils]: 71: Hoare triple {15265#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 72: Hoare triple {15265#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 73: Hoare triple {15265#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {15265#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 75: Hoare triple {15265#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {15265#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {15265#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {15265#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {15265#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {15265#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {15265#false} is VALID [2022-04-14 18:25:24,378 INFO L290 TraceCheckUtils]: 81: Hoare triple {15265#false} assume 8673 == #t~mem80;havoc #t~mem80; {15265#false} is VALID [2022-04-14 18:25:24,379 INFO L290 TraceCheckUtils]: 82: Hoare triple {15265#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {15265#false} is VALID [2022-04-14 18:25:24,379 INFO L290 TraceCheckUtils]: 83: Hoare triple {15265#false} assume 3 == ~blastFlag~0; {15265#false} is VALID [2022-04-14 18:25:24,379 INFO L290 TraceCheckUtils]: 84: Hoare triple {15265#false} assume !false; {15265#false} is VALID [2022-04-14 18:25:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 18:25:24,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:24,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255288219] [2022-04-14 18:25:24,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255288219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:24,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:24,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 18:25:24,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350099230] [2022-04-14 18:25:24,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:24,380 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 85 [2022-04-14 18:25:24,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:24,381 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-14 18:25:24,454 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-14 18:25:24,455 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 18:25:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 18:25:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 18:25:24,456 INFO L87 Difference]: Start difference. First operand 247 states and 382 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-14 18:25:26,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:25:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:27,531 INFO L93 Difference]: Finished difference Result 477 states and 746 transitions. [2022-04-14 18:25:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 18:25:27,531 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 85 [2022-04-14 18:25:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:27,532 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-14 18:25:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-14 18:25:27,534 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-14 18:25:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-14 18:25:27,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 403 transitions. [2022-04-14 18:25:27,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:27,796 INFO L225 Difference]: With dead ends: 477 [2022-04-14 18:25:27,796 INFO L226 Difference]: Without dead ends: 256 [2022-04-14 18:25:27,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 18:25:27,799 INFO L913 BasicCegarLoop]: 193 mSDtfsCounter, 3 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:27,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 593 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:25:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-14 18:25:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-04-14 18:25:27,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:27,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:27,806 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:27,807 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:27,810 INFO L93 Difference]: Finished difference Result 256 states and 393 transitions. [2022-04-14 18:25:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-14 18:25:27,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:27,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:27,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-14 18:25:27,811 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 256 states. [2022-04-14 18:25:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:27,815 INFO L93 Difference]: Finished difference Result 256 states and 393 transitions. [2022-04-14 18:25:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-14 18:25:27,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:27,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:27,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:27,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 393 transitions. [2022-04-14 18:25:27,820 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 393 transitions. Word has length 85 [2022-04-14 18:25:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:27,820 INFO L478 AbstractCegarLoop]: Abstraction has 256 states and 393 transitions. [2022-04-14 18:25:27,820 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-14 18:25:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-14 18:25:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-14 18:25:27,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:27,821 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:27,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-14 18:25:27,821 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash 500010200, now seen corresponding path program 1 times [2022-04-14 18:25:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:27,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129566615] [2022-04-14 18:25:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:27,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:27,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {16638#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16631#true} is VALID [2022-04-14 18:25:27,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {16631#true} assume true; {16631#true} is VALID [2022-04-14 18:25:27,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16631#true} {16631#true} #661#return; {16631#true} is VALID [2022-04-14 18:25:27,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {16631#true} call ULTIMATE.init(); {16638#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:27,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {16638#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16631#true} is VALID [2022-04-14 18:25:27,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {16631#true} assume true; {16631#true} is VALID [2022-04-14 18:25:27,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16631#true} {16631#true} #661#return; {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {16631#true} call #t~ret161 := main(); {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {16631#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {16631#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L272 TraceCheckUtils]: 7: Hoare triple {16631#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {16631#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;~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); {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {16631#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; {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {16631#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; {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {16631#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {16631#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {16631#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16631#true} is VALID [2022-04-14 18:25:27,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {16631#true} assume !false; {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {16631#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {16631#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {16631#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {16631#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {16631#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {16631#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {16631#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {16631#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {16631#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16631#true} is VALID [2022-04-14 18:25:27,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {16631#true} assume 8464 == #t~mem55;havoc #t~mem55; {16631#true} is VALID [2022-04-14 18:25:27,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {16631#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; {16631#true} is VALID [2022-04-14 18:25:27,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {16631#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16631#true} is VALID [2022-04-14 18:25:27,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {16631#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); {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:27,968 INFO L290 TraceCheckUtils]: 28: Hoare triple {16636#(not (= 16384 (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); {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:27,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {16636#(not (= 16384 (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; {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:27,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:27,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:27,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {16636#(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); {16636#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:27,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {16636#(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); {16637#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-14 18:25:27,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {16637#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {16632#false} is VALID [2022-04-14 18:25:27,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {16632#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,970 INFO L290 TraceCheckUtils]: 36: Hoare triple {16632#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {16632#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {16632#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); {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {16632#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {16632#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); {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {16632#false} assume 12292 != #t~mem85;havoc #t~mem85; {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {16632#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; {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {16632#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {16632#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {16632#false} ~skip~0 := 0; {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {16632#false} assume !false; {16632#false} is VALID [2022-04-14 18:25:27,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {16632#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {16632#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {16632#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 50: Hoare triple {16632#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {16632#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {16632#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {16632#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {16632#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 55: Hoare triple {16632#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {16632#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {16632#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {16632#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {16632#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {16632#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {16632#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {16632#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {16632#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {16632#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {16632#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 66: Hoare triple {16632#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 67: Hoare triple {16632#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 68: Hoare triple {16632#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,973 INFO L290 TraceCheckUtils]: 69: Hoare triple {16632#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {16632#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 71: Hoare triple {16632#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 72: Hoare triple {16632#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 73: Hoare triple {16632#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 74: Hoare triple {16632#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 75: Hoare triple {16632#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 76: Hoare triple {16632#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 77: Hoare triple {16632#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 78: Hoare triple {16632#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 79: Hoare triple {16632#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 80: Hoare triple {16632#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {16632#false} is VALID [2022-04-14 18:25:27,974 INFO L290 TraceCheckUtils]: 81: Hoare triple {16632#false} assume 8673 == #t~mem80;havoc #t~mem80; {16632#false} is VALID [2022-04-14 18:25:27,975 INFO L290 TraceCheckUtils]: 82: Hoare triple {16632#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16632#false} is VALID [2022-04-14 18:25:27,975 INFO L290 TraceCheckUtils]: 83: Hoare triple {16632#false} assume 3 == ~blastFlag~0; {16632#false} is VALID [2022-04-14 18:25:27,975 INFO L290 TraceCheckUtils]: 84: Hoare triple {16632#false} assume !false; {16632#false} is VALID [2022-04-14 18:25:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:25:27,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:27,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129566615] [2022-04-14 18:25:27,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129566615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:27,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:27,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213880475] [2022-04-14 18:25:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:27,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-14 18:25:27,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:27,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:28,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:28,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:28,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:28,042 INFO L87 Difference]: Start difference. First operand 256 states and 393 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:30,064 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-14 18:25:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:31,152 INFO L93 Difference]: Finished difference Result 590 states and 911 transitions. [2022-04-14 18:25:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-14 18:25:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-14 18:25:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-14 18:25:31,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-14 18:25:31,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 564 edges. 564 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:31,534 INFO L225 Difference]: With dead ends: 590 [2022-04-14 18:25:31,534 INFO L226 Difference]: Without dead ends: 360 [2022-04-14 18:25:31,535 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-14 18:25:31,535 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:31,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:25:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-14 18:25:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 256. [2022-04-14 18:25:31,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:31,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:31,554 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:31,554 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:31,559 INFO L93 Difference]: Finished difference Result 360 states and 544 transitions. [2022-04-14 18:25:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-04-14 18:25:31,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:31,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:31,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-14 18:25:31,560 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-14 18:25:31,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:31,565 INFO L93 Difference]: Finished difference Result 360 states and 544 transitions. [2022-04-14 18:25:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-04-14 18:25:31,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:31,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:31,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:31,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.5338645418326693) internal successors, (385), 251 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2022-04-14 18:25:31,569 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 85 [2022-04-14 18:25:31,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:31,569 INFO L478 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2022-04-14 18:25:31,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2022-04-14 18:25:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-14 18:25:31,570 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:31,570 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:31,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-14 18:25:31,571 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash -989381741, now seen corresponding path program 1 times [2022-04-14 18:25:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:31,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080029484] [2022-04-14 18:25:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:31,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:31,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {18347#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18340#true} is VALID [2022-04-14 18:25:31,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {18340#true} assume true; {18340#true} is VALID [2022-04-14 18:25:31,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18340#true} {18340#true} #661#return; {18340#true} is VALID [2022-04-14 18:25:31,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {18340#true} call ULTIMATE.init(); {18347#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:31,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {18347#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18340#true} is VALID [2022-04-14 18:25:31,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {18340#true} assume true; {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18340#true} {18340#true} #661#return; {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {18340#true} call #t~ret161 := main(); {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {18340#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {18340#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L272 TraceCheckUtils]: 7: Hoare triple {18340#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {18340#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;~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); {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {18340#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; {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {18340#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; {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {18340#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {18340#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {18340#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {18340#true} assume !false; {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {18340#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {18340#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {18340#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {18340#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {18340#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {18340#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {18340#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {18340#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {18340#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {18340#true} assume 8464 == #t~mem55;havoc #t~mem55; {18340#true} is VALID [2022-04-14 18:25:31,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {18340#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; {18340#true} is VALID [2022-04-14 18:25:31,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {18340#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18340#true} is VALID [2022-04-14 18:25:31,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {18340#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); {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:31,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {18345#(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); {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:31,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {18345#(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; {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:31,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:31,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:31,683 INFO L290 TraceCheckUtils]: 32: Hoare triple {18345#(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); {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:31,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {18345#(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); {18345#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:31,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {18345#(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); {18346#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-14 18:25:31,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {18346#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18341#false} is VALID [2022-04-14 18:25:31,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {18341#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {18341#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18341#false} is VALID [2022-04-14 18:25:31,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {18341#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,684 INFO L290 TraceCheckUtils]: 39: Hoare triple {18341#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); {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {18341#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 41: Hoare triple {18341#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); {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 42: Hoare triple {18341#false} assume 12292 != #t~mem85;havoc #t~mem85; {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 43: Hoare triple {18341#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; {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {18341#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 45: Hoare triple {18341#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 46: Hoare triple {18341#false} ~skip~0 := 0; {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 47: Hoare triple {18341#false} assume !false; {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 48: Hoare triple {18341#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 49: Hoare triple {18341#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 50: Hoare triple {18341#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,685 INFO L290 TraceCheckUtils]: 51: Hoare triple {18341#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {18341#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {18341#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {18341#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {18341#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 56: Hoare triple {18341#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 57: Hoare triple {18341#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 58: Hoare triple {18341#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {18341#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {18341#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {18341#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {18341#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {18341#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {18341#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {18341#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {18341#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {18341#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {18341#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {18341#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {18341#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {18341#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {18341#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,687 INFO L290 TraceCheckUtils]: 73: Hoare triple {18341#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 74: Hoare triple {18341#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 75: Hoare triple {18341#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 76: Hoare triple {18341#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 77: Hoare triple {18341#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 78: Hoare triple {18341#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 79: Hoare triple {18341#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 80: Hoare triple {18341#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 81: Hoare triple {18341#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 82: Hoare triple {18341#false} assume 8673 == #t~mem80;havoc #t~mem80; {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 83: Hoare triple {18341#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 84: Hoare triple {18341#false} assume 3 == ~blastFlag~0; {18341#false} is VALID [2022-04-14 18:25:31,688 INFO L290 TraceCheckUtils]: 85: Hoare triple {18341#false} assume !false; {18341#false} is VALID [2022-04-14 18:25:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:25:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:31,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080029484] [2022-04-14 18:25:31,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080029484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:31,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:31,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789163688] [2022-04-14 18:25:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:31,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-14 18:25:31,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:31,692 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-14 18:25:31,750 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-14 18:25:31,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:31,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:31,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:31,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:31,751 INFO L87 Difference]: Start difference. First operand 256 states and 389 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-14 18:25:35,768 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-14 18:25:37,772 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-14 18:25:39,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:25:41,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:25:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:42,857 INFO L93 Difference]: Finished difference Result 590 states and 903 transitions. [2022-04-14 18:25:42,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:42,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-14 18:25:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:42,858 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-14 18:25:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-14 18:25:42,860 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-14 18:25:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-14 18:25:42,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 563 transitions. [2022-04-14 18:25:43,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 563 edges. 563 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:43,231 INFO L225 Difference]: With dead ends: 590 [2022-04-14 18:25:43,231 INFO L226 Difference]: Without dead ends: 360 [2022-04-14 18:25:43,232 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-14 18:25:43,232 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:43,232 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 316 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 463 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-04-14 18:25:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-14 18:25:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 256. [2022-04-14 18:25:43,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:43,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:43,237 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:43,238 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:43,243 INFO L93 Difference]: Finished difference Result 360 states and 540 transitions. [2022-04-14 18:25:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 540 transitions. [2022-04-14 18:25:43,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:43,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:43,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-14 18:25:43,244 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-14 18:25:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:43,249 INFO L93 Difference]: Finished difference Result 360 states and 540 transitions. [2022-04-14 18:25:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 540 transitions. [2022-04-14 18:25:43,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:43,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:43,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:43,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2022-04-14 18:25:43,255 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 86 [2022-04-14 18:25:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:43,255 INFO L478 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2022-04-14 18:25:43,255 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-14 18:25:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2022-04-14 18:25:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-14 18:25:43,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:43,256 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:43,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-14 18:25:43,257 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:43,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:43,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1455094013, now seen corresponding path program 1 times [2022-04-14 18:25:43,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:43,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661491195] [2022-04-14 18:25:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:43,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:43,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {20056#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20049#true} is VALID [2022-04-14 18:25:43,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-14 18:25:43,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20049#true} {20049#true} #661#return; {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {20049#true} call ULTIMATE.init(); {20056#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:43,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {20056#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {20049#true} assume true; {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20049#true} {20049#true} #661#return; {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {20049#true} call #t~ret161 := main(); {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {20049#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {20049#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L272 TraceCheckUtils]: 7: Hoare triple {20049#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {20049#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;~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); {20049#true} is VALID [2022-04-14 18:25:43,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {20049#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; {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {20049#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; {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {20049#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {20049#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {20049#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {20049#true} assume !false; {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {20049#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {20049#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {20049#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {20049#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {20049#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {20049#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {20049#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {20049#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {20049#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20049#true} is VALID [2022-04-14 18:25:43,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {20049#true} assume 8464 == #t~mem55;havoc #t~mem55; {20049#true} is VALID [2022-04-14 18:25:43,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {20049#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; {20049#true} is VALID [2022-04-14 18:25:43,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {20049#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20049#true} is VALID [2022-04-14 18:25:43,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {20049#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); {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {20054#(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); {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {20054#(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; {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {20054#(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); {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {20054#(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); {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {20054#(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); {20054#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:43,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {20054#(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); {20055#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-14 18:25:43,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {20055#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20050#false} is VALID [2022-04-14 18:25:43,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {20050#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {20050#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {20050#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {20050#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); {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {20050#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {20050#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); {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {20050#false} assume 12292 != #t~mem85;havoc #t~mem85; {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {20050#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; {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {20050#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {20050#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20050#false} is VALID [2022-04-14 18:25:43,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {20050#false} ~skip~0 := 0; {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {20050#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {20050#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {20050#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 52: Hoare triple {20050#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 53: Hoare triple {20050#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {20050#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {20050#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {20050#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {20050#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {20050#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {20050#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {20050#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {20050#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {20050#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 63: Hoare triple {20050#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {20050#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {20050#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {20050#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 67: Hoare triple {20050#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 68: Hoare triple {20050#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 69: Hoare triple {20050#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 70: Hoare triple {20050#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {20050#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {20050#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {20050#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {20050#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {20050#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {20050#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {20050#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {20050#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {20050#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {20050#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {20050#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {20050#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {20050#false} assume 8673 == #t~mem80;havoc #t~mem80; {20050#false} is VALID [2022-04-14 18:25:43,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {20050#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {20050#false} is VALID [2022-04-14 18:25:43,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {20050#false} assume 3 == ~blastFlag~0; {20050#false} is VALID [2022-04-14 18:25:43,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {20050#false} assume !false; {20050#false} is VALID [2022-04-14 18:25:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:25:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:43,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661491195] [2022-04-14 18:25:43,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661491195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:43,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:43,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78860767] [2022-04-14 18:25:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:43,386 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 87 [2022-04-14 18:25:43,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:43,386 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-14 18:25:43,448 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-14 18:25:43,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:43,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:43,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:43,449 INFO L87 Difference]: Start difference. First operand 256 states and 385 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-14 18:25:45,467 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-14 18:25:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:46,610 INFO L93 Difference]: Finished difference Result 590 states and 895 transitions. [2022-04-14 18:25:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:46,610 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 87 [2022-04-14 18:25:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:46,610 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-14 18:25:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-14 18:25:46,613 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-14 18:25:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-14 18:25:46,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-14 18:25:46,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:46,986 INFO L225 Difference]: With dead ends: 590 [2022-04-14 18:25:46,986 INFO L226 Difference]: Without dead ends: 360 [2022-04-14 18:25:46,987 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-14 18:25:46,987 INFO L913 BasicCegarLoop]: 109 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:46,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:25:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-14 18:25:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 256. [2022-04-14 18:25:46,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:46,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:46,992 INFO L74 IsIncluded]: Start isIncluded. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:46,993 INFO L87 Difference]: Start difference. First operand 360 states. Second operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:46,998 INFO L93 Difference]: Finished difference Result 360 states and 536 transitions. [2022-04-14 18:25:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2022-04-14 18:25:46,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:46,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:46,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-14 18:25:46,999 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 360 states. [2022-04-14 18:25:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:47,004 INFO L93 Difference]: Finished difference Result 360 states and 536 transitions. [2022-04-14 18:25:47,004 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2022-04-14 18:25:47,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:47,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:47,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:47,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2022-04-14 18:25:47,009 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 87 [2022-04-14 18:25:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:47,009 INFO L478 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2022-04-14 18:25:47,009 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-14 18:25:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2022-04-14 18:25:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-14 18:25:47,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:47,010 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:47,010 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-14 18:25:47,010 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:47,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1295416728, now seen corresponding path program 1 times [2022-04-14 18:25:47,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:47,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182611239] [2022-04-14 18:25:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:47,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:47,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {21765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21758#true} is VALID [2022-04-14 18:25:47,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {21758#true} assume true; {21758#true} is VALID [2022-04-14 18:25:47,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21758#true} {21758#true} #661#return; {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {21758#true} call ULTIMATE.init(); {21765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:47,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {21765#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {21758#true} assume true; {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21758#true} {21758#true} #661#return; {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {21758#true} call #t~ret161 := main(); {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {21758#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {21758#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L272 TraceCheckUtils]: 7: Hoare triple {21758#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {21758#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;~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); {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {21758#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; {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {21758#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; {21758#true} is VALID [2022-04-14 18:25:47,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {21758#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {21758#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {21758#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {21758#true} assume !false; {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {21758#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {21758#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {21758#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {21758#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {21758#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {21758#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {21758#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {21758#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,109 INFO L290 TraceCheckUtils]: 23: Hoare triple {21758#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21758#true} is VALID [2022-04-14 18:25:47,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {21758#true} assume 8464 == #t~mem55;havoc #t~mem55; {21758#true} is VALID [2022-04-14 18:25:47,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {21758#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; {21758#true} is VALID [2022-04-14 18:25:47,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {21758#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21758#true} is VALID [2022-04-14 18:25:47,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {21758#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); {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {21763#(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); {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {21763#(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; {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,113 INFO L290 TraceCheckUtils]: 32: Hoare triple {21763#(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); {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,113 INFO L290 TraceCheckUtils]: 33: Hoare triple {21763#(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); {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {21763#(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); {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {21763#(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); {21763#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:47,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {21763#(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); {21764#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-14 18:25:47,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {21764#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {21759#false} is VALID [2022-04-14 18:25:47,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {21759#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {21759#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {21759#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {21759#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); {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {21759#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {21759#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); {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 44: Hoare triple {21759#false} assume 12292 != #t~mem85;havoc #t~mem85; {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 45: Hoare triple {21759#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; {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 46: Hoare triple {21759#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {21759#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {21759#false} ~skip~0 := 0; {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {21759#false} assume !false; {21759#false} is VALID [2022-04-14 18:25:47,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {21759#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {21759#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {21759#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {21759#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {21759#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {21759#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {21759#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {21759#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 58: Hoare triple {21759#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {21759#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {21759#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {21759#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {21759#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {21759#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {21759#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {21759#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {21759#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {21759#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 68: Hoare triple {21759#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 69: Hoare triple {21759#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 70: Hoare triple {21759#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 71: Hoare triple {21759#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,117 INFO L290 TraceCheckUtils]: 72: Hoare triple {21759#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {21759#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {21759#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {21759#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 76: Hoare triple {21759#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {21759#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 78: Hoare triple {21759#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {21759#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {21759#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {21759#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {21759#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 83: Hoare triple {21759#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {21759#false} is VALID [2022-04-14 18:25:47,118 INFO L290 TraceCheckUtils]: 84: Hoare triple {21759#false} assume 8673 == #t~mem80;havoc #t~mem80; {21759#false} is VALID [2022-04-14 18:25:47,119 INFO L290 TraceCheckUtils]: 85: Hoare triple {21759#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {21759#false} is VALID [2022-04-14 18:25:47,119 INFO L290 TraceCheckUtils]: 86: Hoare triple {21759#false} assume 3 == ~blastFlag~0; {21759#false} is VALID [2022-04-14 18:25:47,119 INFO L290 TraceCheckUtils]: 87: Hoare triple {21759#false} assume !false; {21759#false} is VALID [2022-04-14 18:25:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 18:25:47,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:47,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182611239] [2022-04-14 18:25:47,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182611239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:47,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:47,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:47,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864855385] [2022-04-14 18:25:47,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:47,120 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 88 [2022-04-14 18:25:47,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:47,120 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-14 18:25:47,196 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-14 18:25:47,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:47,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:47,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:47,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:47,197 INFO L87 Difference]: Start difference. First operand 256 states and 381 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-14 18:25:49,219 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-14 18:25:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:50,316 INFO L93 Difference]: Finished difference Result 580 states and 874 transitions. [2022-04-14 18:25:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:50,316 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 88 [2022-04-14 18:25:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:50,317 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-14 18:25:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-14 18:25:50,328 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-14 18:25:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-14 18:25:50,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 559 transitions. [2022-04-14 18:25:50,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:50,708 INFO L225 Difference]: With dead ends: 580 [2022-04-14 18:25:50,709 INFO L226 Difference]: Without dead ends: 350 [2022-04-14 18:25:50,709 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-14 18:25:50,709 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 133 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:50,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 318 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 460 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:25:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-14 18:25:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 256. [2022-04-14 18:25:50,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:50,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:50,715 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:50,715 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:50,719 INFO L93 Difference]: Finished difference Result 350 states and 519 transitions. [2022-04-14 18:25:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 519 transitions. [2022-04-14 18:25:50,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:50,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:50,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 350 states. [2022-04-14 18:25:50,721 INFO L87 Difference]: Start difference. First operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 350 states. [2022-04-14 18:25:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:50,725 INFO L93 Difference]: Finished difference Result 350 states and 519 transitions. [2022-04-14 18:25:50,726 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 519 transitions. [2022-04-14 18:25:50,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:50,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:50,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:50,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2022-04-14 18:25:50,730 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 88 [2022-04-14 18:25:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:50,730 INFO L478 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2022-04-14 18:25:50,731 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-14 18:25:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2022-04-14 18:25:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-14 18:25:50,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:50,731 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:50,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-14 18:25:50,732 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:50,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1325248613, now seen corresponding path program 1 times [2022-04-14 18:25:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:50,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915229271] [2022-04-14 18:25:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:50,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {23443#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23436#true} is VALID [2022-04-14 18:25:50,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {23436#true} assume true; {23436#true} is VALID [2022-04-14 18:25:50,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23436#true} {23436#true} #661#return; {23436#true} is VALID [2022-04-14 18:25:50,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {23436#true} call ULTIMATE.init(); {23443#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:50,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {23443#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23436#true} is VALID [2022-04-14 18:25:50,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {23436#true} assume true; {23436#true} is VALID [2022-04-14 18:25:50,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23436#true} {23436#true} #661#return; {23436#true} is VALID [2022-04-14 18:25:50,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {23436#true} call #t~ret161 := main(); {23436#true} is VALID [2022-04-14 18:25:50,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {23436#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {23436#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L272 TraceCheckUtils]: 7: Hoare triple {23436#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {23436#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;~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); {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {23436#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; {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {23436#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; {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {23436#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {23436#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {23436#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {23436#true} assume !false; {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {23436#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {23436#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {23436#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {23436#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {23436#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {23436#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {23436#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {23436#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {23436#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {23436#true} assume 8464 == #t~mem55;havoc #t~mem55; {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {23436#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; {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {23436#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {23436#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); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {23436#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); {23436#true} is VALID [2022-04-14 18:25:50,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {23436#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {23436#true} ~skip~0 := 0; {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {23436#true} assume !false; {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {23436#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {23436#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {23436#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {23436#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {23436#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {23436#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {23436#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {23436#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {23436#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {23436#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {23436#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {23436#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {23436#true} assume 8496 == #t~mem58;havoc #t~mem58; {23436#true} is VALID [2022-04-14 18:25:50,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {23436#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {23436#true} is VALID [2022-04-14 18:25:50,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {23436#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {23436#true} is VALID [2022-04-14 18:25:50,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {23436#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {23436#true} is VALID [2022-04-14 18:25:50,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {23436#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,873 INFO L290 TraceCheckUtils]: 50: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,873 INFO L290 TraceCheckUtils]: 51: Hoare triple {23441#(= 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; {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,874 INFO L290 TraceCheckUtils]: 52: Hoare triple {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,874 INFO L290 TraceCheckUtils]: 53: Hoare triple {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,875 INFO L290 TraceCheckUtils]: 57: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,876 INFO L290 TraceCheckUtils]: 59: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,876 INFO L290 TraceCheckUtils]: 60: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,879 INFO L290 TraceCheckUtils]: 68: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,880 INFO L290 TraceCheckUtils]: 71: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,882 INFO L290 TraceCheckUtils]: 76: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,882 INFO L290 TraceCheckUtils]: 77: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,882 INFO L290 TraceCheckUtils]: 78: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,883 INFO L290 TraceCheckUtils]: 79: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,883 INFO L290 TraceCheckUtils]: 80: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,884 INFO L290 TraceCheckUtils]: 82: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,884 INFO L290 TraceCheckUtils]: 83: Hoare triple {23441#(= 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); {23441#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:25:50,884 INFO L290 TraceCheckUtils]: 84: Hoare triple {23441#(= 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); {23442#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-14 18:25:50,885 INFO L290 TraceCheckUtils]: 85: Hoare triple {23442#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {23437#false} is VALID [2022-04-14 18:25:50,885 INFO L290 TraceCheckUtils]: 86: Hoare triple {23437#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {23437#false} is VALID [2022-04-14 18:25:50,885 INFO L290 TraceCheckUtils]: 87: Hoare triple {23437#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {23437#false} is VALID [2022-04-14 18:25:50,885 INFO L290 TraceCheckUtils]: 88: Hoare triple {23437#false} assume 8673 == #t~mem80;havoc #t~mem80; {23437#false} is VALID [2022-04-14 18:25:50,885 INFO L290 TraceCheckUtils]: 89: Hoare triple {23437#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {23437#false} is VALID [2022-04-14 18:25:50,885 INFO L290 TraceCheckUtils]: 90: Hoare triple {23437#false} assume 3 == ~blastFlag~0; {23437#false} is VALID [2022-04-14 18:25:50,885 INFO L290 TraceCheckUtils]: 91: Hoare triple {23437#false} assume !false; {23437#false} is VALID [2022-04-14 18:25:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-14 18:25:50,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:50,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915229271] [2022-04-14 18:25:50,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915229271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:50,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:50,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:50,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37376077] [2022-04-14 18:25:50,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:50,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-14 18:25:50,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:50,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:50,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:50,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:50,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:50,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:50,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:50,950 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:52,972 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-14 18:25:54,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:54,185 INFO L93 Difference]: Finished difference Result 578 states and 861 transitions. [2022-04-14 18:25:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:54,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-14 18:25:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-14 18:25:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-14 18:25:54,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 528 transitions. [2022-04-14 18:25:54,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 528 edges. 528 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:54,535 INFO L225 Difference]: With dead ends: 578 [2022-04-14 18:25:54,536 INFO L226 Difference]: Without dead ends: 348 [2022-04-14 18:25:54,536 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-14 18:25:54,537 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 70 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:54,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 469 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 513 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:25:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-14 18:25:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 299. [2022-04-14 18:25:54,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:54,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,544 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,544 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:54,551 INFO L93 Difference]: Finished difference Result 348 states and 513 transitions. [2022-04-14 18:25:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 513 transitions. [2022-04-14 18:25:54,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:54,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:54,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 348 states. [2022-04-14 18:25:54,553 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 348 states. [2022-04-14 18:25:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:54,564 INFO L93 Difference]: Finished difference Result 348 states and 513 transitions. [2022-04-14 18:25:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 513 transitions. [2022-04-14 18:25:54,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:54,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:54,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:54,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.510204081632653) internal successors, (444), 294 states have internal predecessors, (444), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 448 transitions. [2022-04-14 18:25:54,572 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 448 transitions. Word has length 92 [2022-04-14 18:25:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:54,573 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 448 transitions. [2022-04-14 18:25:54,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 448 transitions. [2022-04-14 18:25:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-14 18:25:54,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:54,574 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:54,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-14 18:25:54,574 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash -724139229, now seen corresponding path program 1 times [2022-04-14 18:25:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:54,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094239423] [2022-04-14 18:25:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:54,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:54,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {25158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25151#true} is VALID [2022-04-14 18:25:54,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {25151#true} assume true; {25151#true} is VALID [2022-04-14 18:25:54,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25151#true} {25151#true} #661#return; {25151#true} is VALID [2022-04-14 18:25:54,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {25151#true} call ULTIMATE.init(); {25158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:54,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {25158#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25151#true} is VALID [2022-04-14 18:25:54,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {25151#true} assume true; {25151#true} is VALID [2022-04-14 18:25:54,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25151#true} {25151#true} #661#return; {25151#true} is VALID [2022-04-14 18:25:54,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {25151#true} call #t~ret161 := main(); {25151#true} is VALID [2022-04-14 18:25:54,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {25151#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {25151#true} is VALID [2022-04-14 18:25:54,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {25151#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L272 TraceCheckUtils]: 7: Hoare triple {25151#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {25151#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;~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); {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {25151#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; {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {25151#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; {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {25151#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {25151#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {25151#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {25151#true} assume !false; {25151#true} is VALID [2022-04-14 18:25:54,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {25151#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {25151#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {25151#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {25151#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {25151#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {25151#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {25151#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {25151#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {25151#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {25151#true} assume 8464 == #t~mem55;havoc #t~mem55; {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {25151#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; {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {25151#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {25151#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); {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {25151#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); {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {25151#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {25151#true} ~skip~0 := 0; {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {25151#true} assume !false; {25151#true} is VALID [2022-04-14 18:25:54,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {25151#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {25151#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {25151#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {25151#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {25151#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {25151#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {25151#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {25151#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {25151#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {25151#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,715 INFO L290 TraceCheckUtils]: 42: Hoare triple {25151#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {25151#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {25151#true} assume 8496 == #t~mem58;havoc #t~mem58; {25151#true} is VALID [2022-04-14 18:25:54,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {25151#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {25151#true} is VALID [2022-04-14 18:25:54,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {25151#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25151#true} is VALID [2022-04-14 18:25:54,715 INFO L290 TraceCheckUtils]: 47: Hoare triple {25151#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {25151#true} is VALID [2022-04-14 18:25:54,716 INFO L290 TraceCheckUtils]: 48: Hoare triple {25151#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,717 INFO L290 TraceCheckUtils]: 49: Hoare triple {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {25156#(= (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; {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,718 INFO L290 TraceCheckUtils]: 52: Hoare triple {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,719 INFO L290 TraceCheckUtils]: 55: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,721 INFO L290 TraceCheckUtils]: 58: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {25156#(= (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); {25156#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-14 18:25:54,724 INFO L290 TraceCheckUtils]: 67: Hoare triple {25156#(= (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); {25157#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {25157#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 69: Hoare triple {25152#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 70: Hoare triple {25152#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {25152#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {25152#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 73: Hoare triple {25152#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 74: Hoare triple {25152#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 75: Hoare triple {25152#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {25152#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 77: Hoare triple {25152#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 78: Hoare triple {25152#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 79: Hoare triple {25152#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 80: Hoare triple {25152#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 81: Hoare triple {25152#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 82: Hoare triple {25152#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 83: Hoare triple {25152#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 84: Hoare triple {25152#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 85: Hoare triple {25152#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,726 INFO L290 TraceCheckUtils]: 86: Hoare triple {25152#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {25152#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {25152#false} is VALID [2022-04-14 18:25:54,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {25152#false} assume 8673 == #t~mem80;havoc #t~mem80; {25152#false} is VALID [2022-04-14 18:25:54,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {25152#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {25152#false} is VALID [2022-04-14 18:25:54,727 INFO L290 TraceCheckUtils]: 90: Hoare triple {25152#false} assume 3 == ~blastFlag~0; {25152#false} is VALID [2022-04-14 18:25:54,727 INFO L290 TraceCheckUtils]: 91: Hoare triple {25152#false} assume !false; {25152#false} is VALID [2022-04-14 18:25:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-14 18:25:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:54,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094239423] [2022-04-14 18:25:54,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094239423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:54,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:54,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418694168] [2022-04-14 18:25:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:54,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-14 18:25:54,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:54,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:54,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:54,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:54,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:54,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:54,796 INFO L87 Difference]: Start difference. First operand 299 states and 448 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:56,823 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-14 18:25:57,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:57,890 INFO L93 Difference]: Finished difference Result 618 states and 931 transitions. [2022-04-14 18:25:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:25:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-14 18:25:57,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:25:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-14 18:25:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2022-04-14 18:25:57,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 457 transitions. [2022-04-14 18:25:58,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:25:58,190 INFO L225 Difference]: With dead ends: 618 [2022-04-14 18:25:58,191 INFO L226 Difference]: Without dead ends: 345 [2022-04-14 18:25:58,191 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-14 18:25:58,193 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 34 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:25:58,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 569 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:25:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-14 18:25:58,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 323. [2022-04-14 18:25:58,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:25:58,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:58,199 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:58,200 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:58,204 INFO L93 Difference]: Finished difference Result 345 states and 512 transitions. [2022-04-14 18:25:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 512 transitions. [2022-04-14 18:25:58,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:58,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:58,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-14 18:25:58,206 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 345 states. [2022-04-14 18:25:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:25:58,211 INFO L93 Difference]: Finished difference Result 345 states and 512 transitions. [2022-04-14 18:25:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 512 transitions. [2022-04-14 18:25:58,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:25:58,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:25:58,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:25:58,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:25:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.5062893081761006) internal successors, (479), 318 states have internal predecessors, (479), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:58,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 483 transitions. [2022-04-14 18:25:58,218 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 483 transitions. Word has length 92 [2022-04-14 18:25:58,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:25:58,218 INFO L478 AbstractCegarLoop]: Abstraction has 323 states and 483 transitions. [2022-04-14 18:25:58,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:25:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 483 transitions. [2022-04-14 18:25:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-14 18:25:58,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:25:58,220 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:25:58,220 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-14 18:25:58,220 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:25:58,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:25:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1582990547, now seen corresponding path program 1 times [2022-04-14 18:25:58,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:25:58,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490205726] [2022-04-14 18:25:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:25:58,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:25:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:25:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:25:58,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {26926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26919#true} is VALID [2022-04-14 18:25:58,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {26919#true} assume true; {26919#true} is VALID [2022-04-14 18:25:58,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26919#true} {26919#true} #661#return; {26919#true} is VALID [2022-04-14 18:25:58,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {26919#true} call ULTIMATE.init(); {26926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:25:58,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {26926#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26919#true} is VALID [2022-04-14 18:25:58,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {26919#true} assume true; {26919#true} is VALID [2022-04-14 18:25:58,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26919#true} {26919#true} #661#return; {26919#true} is VALID [2022-04-14 18:25:58,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {26919#true} call #t~ret161 := main(); {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {26919#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {26919#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L272 TraceCheckUtils]: 7: Hoare triple {26919#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {26919#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;~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); {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {26919#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; {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {26919#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; {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {26919#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {26919#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {26919#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {26919#true} assume !false; {26919#true} is VALID [2022-04-14 18:25:58,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {26919#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {26919#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {26919#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {26919#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {26919#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {26919#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {26919#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {26919#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {26919#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {26919#true} assume 8464 == #t~mem55;havoc #t~mem55; {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {26919#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; {26919#true} is VALID [2022-04-14 18:25:58,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {26919#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26919#true} is VALID [2022-04-14 18:25:58,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {26919#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); {26924#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:58,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {26924#(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); {26924#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:58,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {26924#(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; {26924#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:58,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {26924#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {26924#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:58,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {26924#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {26924#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {26924#(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); {26925#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {26925#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {26920#false} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {26920#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {26920#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {26920#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26920#false} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {26920#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {26920#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); {26920#false} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 39: Hoare triple {26920#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26920#false} is VALID [2022-04-14 18:25:58,334 INFO L290 TraceCheckUtils]: 40: Hoare triple {26920#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); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 41: Hoare triple {26920#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); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 42: Hoare triple {26920#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {26920#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {26920#false} ~skip~0 := 0; {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {26920#false} assume !false; {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {26920#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {26920#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {26920#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {26920#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {26920#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {26920#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {26920#false} assume 8480 == #t~mem52;havoc #t~mem52; {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {26920#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; {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {26920#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); {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {26920#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {26920#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {26920#false} ~skip~0 := 0; {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {26920#false} assume !false; {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 59: Hoare triple {26920#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {26920#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 61: Hoare triple {26920#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 62: Hoare triple {26920#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,336 INFO L290 TraceCheckUtils]: 63: Hoare triple {26920#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {26920#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {26920#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {26920#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {26920#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {26920#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {26920#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {26920#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {26920#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {26920#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {26920#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {26920#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {26920#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 76: Hoare triple {26920#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 77: Hoare triple {26920#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {26920#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {26920#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {26920#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 81: Hoare triple {26920#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 82: Hoare triple {26920#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {26920#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {26920#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {26920#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 86: Hoare triple {26920#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,338 INFO L290 TraceCheckUtils]: 87: Hoare triple {26920#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {26920#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 89: Hoare triple {26920#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 90: Hoare triple {26920#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 91: Hoare triple {26920#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 92: Hoare triple {26920#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 93: Hoare triple {26920#false} assume 8673 == #t~mem80;havoc #t~mem80; {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 94: Hoare triple {26920#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 95: Hoare triple {26920#false} assume 3 == ~blastFlag~0; {26920#false} is VALID [2022-04-14 18:25:58,339 INFO L290 TraceCheckUtils]: 96: Hoare triple {26920#false} assume !false; {26920#false} is VALID [2022-04-14 18:25:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-14 18:25:58,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:25:58,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490205726] [2022-04-14 18:25:58,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490205726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:25:58,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:25:58,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:25:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458819997] [2022-04-14 18:25:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:25:58,341 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 97 [2022-04-14 18:25:58,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:25:58,341 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-14 18:25:58,409 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-14 18:25:58,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:25:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:25:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:25:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:25:58,410 INFO L87 Difference]: Start difference. First operand 323 states and 483 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-14 18:26:00,432 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-14 18:26:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:01,522 INFO L93 Difference]: Finished difference Result 704 states and 1066 transitions. [2022-04-14 18:26:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:26:01,523 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 97 [2022-04-14 18:26:01,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:26:01,523 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-14 18:26:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2022-04-14 18:26:01,525 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-14 18:26:01,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2022-04-14 18:26:01,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 546 transitions. [2022-04-14 18:26:01,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:01,887 INFO L225 Difference]: With dead ends: 704 [2022-04-14 18:26:01,887 INFO L226 Difference]: Without dead ends: 407 [2022-04-14 18:26:01,888 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-14 18:26:01,888 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 130 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:26:01,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 338 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 449 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:26:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-14 18:26:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 323. [2022-04-14 18:26:01,893 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:26:01,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:01,894 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:01,894 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:01,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:01,901 INFO L93 Difference]: Finished difference Result 407 states and 607 transitions. [2022-04-14 18:26:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2022-04-14 18:26:01,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:01,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:01,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 407 states. [2022-04-14 18:26:01,902 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 407 states. [2022-04-14 18:26:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:01,909 INFO L93 Difference]: Finished difference Result 407 states and 607 transitions. [2022-04-14 18:26:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2022-04-14 18:26:01,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:01,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:01,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:26:01,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:26:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 318 states have internal predecessors, (473), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 477 transitions. [2022-04-14 18:26:01,924 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 477 transitions. Word has length 97 [2022-04-14 18:26:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:26:01,924 INFO L478 AbstractCegarLoop]: Abstraction has 323 states and 477 transitions. [2022-04-14 18:26:01,924 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-14 18:26:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 477 transitions. [2022-04-14 18:26:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-14 18:26:01,925 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:26:01,925 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:26:01,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-14 18:26:01,925 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:26:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:26:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1180391555, now seen corresponding path program 1 times [2022-04-14 18:26:01,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:26:01,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62960207] [2022-04-14 18:26:01,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:26:01,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:26:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:26:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:02,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {28919#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28912#true} is VALID [2022-04-14 18:26:02,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-14 18:26:02,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28912#true} {28912#true} #661#return; {28912#true} is VALID [2022-04-14 18:26:02,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {28912#true} call ULTIMATE.init(); {28919#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:26:02,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {28919#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28912#true} is VALID [2022-04-14 18:26:02,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-14 18:26:02,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28912#true} {28912#true} #661#return; {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {28912#true} call #t~ret161 := main(); {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {28912#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {28912#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L272 TraceCheckUtils]: 7: Hoare triple {28912#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {28912#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;~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); {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {28912#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; {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {28912#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; {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {28912#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {28912#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {28912#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {28912#true} assume !false; {28912#true} is VALID [2022-04-14 18:26:02,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {28912#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {28912#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {28912#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {28912#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {28912#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {28912#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 21: Hoare triple {28912#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {28912#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {28912#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {28912#true} assume 8464 == #t~mem55;havoc #t~mem55; {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 25: Hoare triple {28912#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; {28912#true} is VALID [2022-04-14 18:26:02,052 INFO L290 TraceCheckUtils]: 26: Hoare triple {28912#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 27: Hoare triple {28912#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); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {28912#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); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {28912#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {28912#true} ~skip~0 := 0; {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {28912#true} assume !false; {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {28912#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {28912#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {28912#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {28912#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {28912#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {28912#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {28912#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 39: Hoare triple {28912#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {28912#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {28912#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {28912#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {28912#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {28912#true} assume 8496 == #t~mem58;havoc #t~mem58; {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 45: Hoare triple {28912#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {28912#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {28912#true} is VALID [2022-04-14 18:26:02,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {28912#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {28912#true} is VALID [2022-04-14 18:26:02,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {28912#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {28917#(= 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; {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,058 INFO L290 TraceCheckUtils]: 54: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,059 INFO L290 TraceCheckUtils]: 59: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,060 INFO L290 TraceCheckUtils]: 60: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,060 INFO L290 TraceCheckUtils]: 61: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,060 INFO L290 TraceCheckUtils]: 62: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,062 INFO L290 TraceCheckUtils]: 66: Hoare triple {28917#(= 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); {28917#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-14 18:26:02,062 INFO L290 TraceCheckUtils]: 67: Hoare triple {28917#(= 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); {28918#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-14 18:26:02,063 INFO L290 TraceCheckUtils]: 68: Hoare triple {28918#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {28913#false} is VALID [2022-04-14 18:26:02,063 INFO L290 TraceCheckUtils]: 69: Hoare triple {28913#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); {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {28913#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 71: Hoare triple {28913#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 72: Hoare triple {28913#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 73: Hoare triple {28913#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 74: Hoare triple {28913#false} ~skip~0 := 0; {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 75: Hoare triple {28913#false} assume !false; {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 76: Hoare triple {28913#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,064 INFO L290 TraceCheckUtils]: 77: Hoare triple {28913#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 78: Hoare triple {28913#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 79: Hoare triple {28913#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 80: Hoare triple {28913#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 81: Hoare triple {28913#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 82: Hoare triple {28913#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 83: Hoare triple {28913#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 84: Hoare triple {28913#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 85: Hoare triple {28913#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 86: Hoare triple {28913#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 87: Hoare triple {28913#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {28913#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,065 INFO L290 TraceCheckUtils]: 89: Hoare triple {28913#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 90: Hoare triple {28913#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 91: Hoare triple {28913#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 92: Hoare triple {28913#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 93: Hoare triple {28913#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 94: Hoare triple {28913#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 95: Hoare triple {28913#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 96: Hoare triple {28913#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 97: Hoare triple {28913#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 98: Hoare triple {28913#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 99: Hoare triple {28913#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {28913#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,066 INFO L290 TraceCheckUtils]: 101: Hoare triple {28913#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 102: Hoare triple {28913#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 103: Hoare triple {28913#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 104: Hoare triple {28913#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 105: Hoare triple {28913#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 106: Hoare triple {28913#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 107: Hoare triple {28913#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 108: Hoare triple {28913#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 109: Hoare triple {28913#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 110: Hoare triple {28913#false} assume 8673 == #t~mem80;havoc #t~mem80; {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 111: Hoare triple {28913#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 112: Hoare triple {28913#false} assume 3 == ~blastFlag~0; {28913#false} is VALID [2022-04-14 18:26:02,067 INFO L290 TraceCheckUtils]: 113: Hoare triple {28913#false} assume !false; {28913#false} is VALID [2022-04-14 18:26:02,068 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-14 18:26:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:26:02,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62960207] [2022-04-14 18:26:02,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62960207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:26:02,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:26:02,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 18:26:02,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682741445] [2022-04-14 18:26:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:26:02,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-14 18:26:02,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:26:02,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:02,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:02,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 18:26:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:26:02,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 18:26:02,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 18:26:02,146 INFO L87 Difference]: Start difference. First operand 323 states and 477 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:04,169 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-14 18:26:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:05,250 INFO L93 Difference]: Finished difference Result 659 states and 977 transitions. [2022-04-14 18:26:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 18:26:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-14 18:26:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:26:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-14 18:26:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-14 18:26:05,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 514 transitions. [2022-04-14 18:26:05,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:05,591 INFO L225 Difference]: With dead ends: 659 [2022-04-14 18:26:05,591 INFO L226 Difference]: Without dead ends: 362 [2022-04-14 18:26:05,592 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-14 18:26:05,592 INFO L913 BasicCegarLoop]: 182 mSDtfsCounter, 79 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-14 18:26:05,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 469 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 489 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-14 18:26:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-14 18:26:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 323. [2022-04-14 18:26:05,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:26:05,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:05,598 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:05,598 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:05,603 INFO L93 Difference]: Finished difference Result 362 states and 529 transitions. [2022-04-14 18:26:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 529 transitions. [2022-04-14 18:26:05,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:05,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:05,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 362 states. [2022-04-14 18:26:05,604 INFO L87 Difference]: Start difference. First operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 362 states. [2022-04-14 18:26:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:05,610 INFO L93 Difference]: Finished difference Result 362 states and 529 transitions. [2022-04-14 18:26:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 529 transitions. [2022-04-14 18:26:05,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:05,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:05,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:26:05,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:26:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2022-04-14 18:26:05,616 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 114 [2022-04-14 18:26:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:26:05,616 INFO L478 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2022-04-14 18:26:05,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2022-04-14 18:26:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-14 18:26:05,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:26:05,617 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:26:05,617 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-14 18:26:05,618 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:26:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:26:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1912358981, now seen corresponding path program 1 times [2022-04-14 18:26:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:26:05,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890671646] [2022-04-14 18:26:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:26:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:26:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:05,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:26:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:05,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {30772#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30766#true} is VALID [2022-04-14 18:26:05,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {30766#true} assume true; {30766#true} is VALID [2022-04-14 18:26:05,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30766#true} {30766#true} #661#return; {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {30766#true} call ULTIMATE.init(); {30772#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:26:05,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {30772#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {30766#true} assume true; {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30766#true} {30766#true} #661#return; {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {30766#true} call #t~ret161 := main(); {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {30766#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {30766#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L272 TraceCheckUtils]: 7: Hoare triple {30766#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30766#true} is VALID [2022-04-14 18:26:05,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {30766#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;~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); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {30766#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; {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {30766#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; {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {30766#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {30766#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {30766#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {30766#true} assume !false; {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {30766#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {30766#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {30766#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {30766#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {30766#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {30766#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {30766#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {30766#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {30766#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {30766#true} assume 8464 == #t~mem55;havoc #t~mem55; {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {30766#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; {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {30766#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {30766#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); {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {30766#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); {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {30766#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {30766#true} ~skip~0 := 0; {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {30766#true} assume !false; {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {30766#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {30766#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {30766#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {30766#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {30766#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {30766#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {30766#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 39: Hoare triple {30766#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {30766#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {30766#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {30766#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {30766#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30766#true} is VALID [2022-04-14 18:26:05,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {30766#true} assume 8496 == #t~mem58;havoc #t~mem58; {30766#true} is VALID [2022-04-14 18:26:05,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {30766#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {30766#true} is VALID [2022-04-14 18:26:05,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {30766#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,764 INFO L290 TraceCheckUtils]: 48: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {30771#(= 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); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {30771#(= 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); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,768 INFO L290 TraceCheckUtils]: 61: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,768 INFO L290 TraceCheckUtils]: 62: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,769 INFO L290 TraceCheckUtils]: 64: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,769 INFO L290 TraceCheckUtils]: 66: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,769 INFO L290 TraceCheckUtils]: 67: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,770 INFO L290 TraceCheckUtils]: 69: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} call #t~mem95.base, #t~mem95.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem96.base, #t~mem96.offset := read~$Pointer$(#t~mem95.base, 836 + #t~mem95.offset, 4);call #t~mem97 := read~int(#t~mem96.base, 12 + #t~mem96.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,770 INFO L290 TraceCheckUtils]: 70: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,771 INFO L290 TraceCheckUtils]: 71: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,771 INFO L290 TraceCheckUtils]: 72: Hoare triple {30771#(= 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); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,771 INFO L290 TraceCheckUtils]: 73: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,771 INFO L290 TraceCheckUtils]: 74: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,772 INFO L290 TraceCheckUtils]: 75: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,772 INFO L290 TraceCheckUtils]: 76: Hoare triple {30771#(= 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); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,772 INFO L290 TraceCheckUtils]: 78: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,773 INFO L290 TraceCheckUtils]: 79: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,773 INFO L290 TraceCheckUtils]: 82: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,774 INFO L290 TraceCheckUtils]: 83: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,774 INFO L290 TraceCheckUtils]: 84: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,774 INFO L290 TraceCheckUtils]: 85: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,774 INFO L290 TraceCheckUtils]: 86: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,775 INFO L290 TraceCheckUtils]: 87: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,775 INFO L290 TraceCheckUtils]: 88: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,775 INFO L290 TraceCheckUtils]: 89: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,775 INFO L290 TraceCheckUtils]: 90: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,776 INFO L290 TraceCheckUtils]: 91: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,777 INFO L290 TraceCheckUtils]: 94: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,778 INFO L290 TraceCheckUtils]: 98: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,778 INFO L290 TraceCheckUtils]: 99: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,778 INFO L290 TraceCheckUtils]: 101: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,779 INFO L290 TraceCheckUtils]: 102: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,779 INFO L290 TraceCheckUtils]: 103: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,779 INFO L290 TraceCheckUtils]: 104: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,779 INFO L290 TraceCheckUtils]: 105: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,780 INFO L290 TraceCheckUtils]: 106: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,780 INFO L290 TraceCheckUtils]: 107: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,781 INFO L290 TraceCheckUtils]: 110: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume 8673 == #t~mem80;havoc #t~mem80; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,781 INFO L290 TraceCheckUtils]: 111: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30771#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-14 18:26:05,781 INFO L290 TraceCheckUtils]: 112: Hoare triple {30771#(= 2 ssl3_accept_~blastFlag~0)} assume 3 == ~blastFlag~0; {30767#false} is VALID [2022-04-14 18:26:05,781 INFO L290 TraceCheckUtils]: 113: Hoare triple {30767#false} assume !false; {30767#false} is VALID [2022-04-14 18:26:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-14 18:26:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:26:05,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890671646] [2022-04-14 18:26:05,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890671646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:26:05,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:26:05,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:26:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961411576] [2022-04-14 18:26:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:26:05,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 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 114 [2022-04-14 18:26:05,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:26:05,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 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-14 18:26:05,845 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-14 18:26:05,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:26:05,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:26:05,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:26:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:26:05,846 INFO L87 Difference]: Start difference. First operand 323 states and 476 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 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-14 18:26:09,779 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-14 18:26:11,786 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-14 18:26:13,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-14 18:26:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:14,506 INFO L93 Difference]: Finished difference Result 895 states and 1342 transitions. [2022-04-14 18:26:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:26:14,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 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 114 [2022-04-14 18:26:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:26:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 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-14 18:26:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-04-14 18:26:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 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-14 18:26:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-04-14 18:26:14,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 574 transitions. [2022-04-14 18:26:14,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:14,871 INFO L225 Difference]: With dead ends: 895 [2022-04-14 18:26:14,871 INFO L226 Difference]: Without dead ends: 598 [2022-04-14 18:26:14,871 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-14 18:26:14,872 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 130 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-14 18:26:14,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 427 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-04-14 18:26:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-04-14 18:26:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-04-14 18:26:14,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:26:14,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 598 states. Second operand has 598 states, 593 states have (on average 1.4957841483979764) internal successors, (887), 593 states have internal predecessors, (887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:14,882 INFO L74 IsIncluded]: Start isIncluded. First operand 598 states. Second operand has 598 states, 593 states have (on average 1.4957841483979764) internal successors, (887), 593 states have internal predecessors, (887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:14,882 INFO L87 Difference]: Start difference. First operand 598 states. Second operand has 598 states, 593 states have (on average 1.4957841483979764) internal successors, (887), 593 states have internal predecessors, (887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:14,893 INFO L93 Difference]: Finished difference Result 598 states and 891 transitions. [2022-04-14 18:26:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 891 transitions. [2022-04-14 18:26:14,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:14,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:14,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 598 states, 593 states have (on average 1.4957841483979764) internal successors, (887), 593 states have internal predecessors, (887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 598 states. [2022-04-14 18:26:14,895 INFO L87 Difference]: Start difference. First operand has 598 states, 593 states have (on average 1.4957841483979764) internal successors, (887), 593 states have internal predecessors, (887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 598 states. [2022-04-14 18:26:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:14,907 INFO L93 Difference]: Finished difference Result 598 states and 891 transitions. [2022-04-14 18:26:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 891 transitions. [2022-04-14 18:26:14,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:14,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:14,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:26:14,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:26:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 593 states have (on average 1.4957841483979764) internal successors, (887), 593 states have internal predecessors, (887), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 891 transitions. [2022-04-14 18:26:14,921 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 891 transitions. Word has length 114 [2022-04-14 18:26:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:26:14,921 INFO L478 AbstractCegarLoop]: Abstraction has 598 states and 891 transitions. [2022-04-14 18:26:14,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 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-14 18:26:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 891 transitions. [2022-04-14 18:26:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-14 18:26:14,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:26:14,922 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:26:14,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-14 18:26:14,922 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:26:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:26:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash -510498908, now seen corresponding path program 1 times [2022-04-14 18:26:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:26:14,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621205492] [2022-04-14 18:26:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:26:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:26:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:15,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:26:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:15,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {33658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33652#true} is VALID [2022-04-14 18:26:15,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {33652#true} assume true; {33652#true} is VALID [2022-04-14 18:26:15,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33652#true} {33652#true} #661#return; {33652#true} is VALID [2022-04-14 18:26:15,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {33652#true} call ULTIMATE.init(); {33658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:26:15,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {33658#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {33652#true} assume true; {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33652#true} {33652#true} #661#return; {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {33652#true} call #t~ret161 := main(); {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {33652#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {33652#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L272 TraceCheckUtils]: 7: Hoare triple {33652#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {33652#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;~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); {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {33652#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; {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {33652#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; {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {33652#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {33652#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {33652#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {33652#true} assume !false; {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {33652#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {33652#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {33652#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {33652#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {33652#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 20: Hoare triple {33652#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {33652#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {33652#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {33652#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 24: Hoare triple {33652#true} assume 8464 == #t~mem55;havoc #t~mem55; {33652#true} is VALID [2022-04-14 18:26:15,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {33652#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; {33652#true} is VALID [2022-04-14 18:26:15,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {33652#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {33657#(= 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); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {33657#(= 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); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !false; {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {33657#(= 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); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33657#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {33657#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {33653#false} assume !(3 == ~blastFlag~0); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {33653#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {33653#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {33653#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {33653#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {33653#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {33653#false} ~skip~0 := 0; {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 54: Hoare triple {33653#false} assume !false; {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 55: Hoare triple {33653#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 56: Hoare triple {33653#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,026 INFO L290 TraceCheckUtils]: 57: Hoare triple {33653#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 58: Hoare triple {33653#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 59: Hoare triple {33653#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {33653#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {33653#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {33653#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {33653#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {33653#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 65: Hoare triple {33653#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {33653#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 67: Hoare triple {33653#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {33653#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,027 INFO L290 TraceCheckUtils]: 69: Hoare triple {33653#false} assume 8512 == #t~mem60;havoc #t~mem60; {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 70: Hoare triple {33653#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); {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 71: Hoare triple {33653#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 72: Hoare triple {33653#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {33653#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 74: Hoare triple {33653#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {33653#false} ~skip~0 := 0; {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 76: Hoare triple {33653#false} assume !false; {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {33653#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 78: Hoare triple {33653#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 79: Hoare triple {33653#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {33653#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {33653#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 82: Hoare triple {33653#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {33653#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {33653#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 85: Hoare triple {33653#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 86: Hoare triple {33653#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 87: Hoare triple {33653#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 88: Hoare triple {33653#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 89: Hoare triple {33653#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 90: Hoare triple {33653#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 91: Hoare triple {33653#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 92: Hoare triple {33653#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 93: Hoare triple {33653#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,029 INFO L290 TraceCheckUtils]: 94: Hoare triple {33653#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 95: Hoare triple {33653#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 96: Hoare triple {33653#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 97: Hoare triple {33653#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 98: Hoare triple {33653#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 99: Hoare triple {33653#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 100: Hoare triple {33653#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 101: Hoare triple {33653#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 102: Hoare triple {33653#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 103: Hoare triple {33653#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 104: Hoare triple {33653#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,030 INFO L290 TraceCheckUtils]: 105: Hoare triple {33653#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 106: Hoare triple {33653#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 107: Hoare triple {33653#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 108: Hoare triple {33653#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 109: Hoare triple {33653#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 110: Hoare triple {33653#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 111: Hoare triple {33653#false} assume 8673 == #t~mem80;havoc #t~mem80; {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 112: Hoare triple {33653#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 113: Hoare triple {33653#false} assume 3 == ~blastFlag~0; {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L290 TraceCheckUtils]: 114: Hoare triple {33653#false} assume !false; {33653#false} is VALID [2022-04-14 18:26:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 18:26:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:26:15,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621205492] [2022-04-14 18:26:15,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621205492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:26:15,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:26:15,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:26:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77816496] [2022-04-14 18:26:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:26:15,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-14 18:26:15,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:26:15,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:15,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:15,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:26:15,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:26:15,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:26:15,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:26:15,110 INFO L87 Difference]: Start difference. First operand 598 states and 891 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:17,125 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-14 18:26:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:17,748 INFO L93 Difference]: Finished difference Result 1197 states and 1789 transitions. [2022-04-14 18:26:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:26:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-14 18:26:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:26:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-04-14 18:26:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-04-14 18:26:17,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 428 transitions. [2022-04-14 18:26:18,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:18,030 INFO L225 Difference]: With dead ends: 1197 [2022-04-14 18:26:18,031 INFO L226 Difference]: Without dead ends: 625 [2022-04-14 18:26:18,033 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-14 18:26:18,034 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:26:18,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 407 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 18:26:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-04-14 18:26:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2022-04-14 18:26:18,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:26:18,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 625 states. Second operand has 625 states, 620 states have (on average 1.4870967741935484) internal successors, (922), 620 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:18,062 INFO L74 IsIncluded]: Start isIncluded. First operand 625 states. Second operand has 625 states, 620 states have (on average 1.4870967741935484) internal successors, (922), 620 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:18,063 INFO L87 Difference]: Start difference. First operand 625 states. Second operand has 625 states, 620 states have (on average 1.4870967741935484) internal successors, (922), 620 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:18,075 INFO L93 Difference]: Finished difference Result 625 states and 926 transitions. [2022-04-14 18:26:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 926 transitions. [2022-04-14 18:26:18,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:18,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:18,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 625 states, 620 states have (on average 1.4870967741935484) internal successors, (922), 620 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 625 states. [2022-04-14 18:26:18,077 INFO L87 Difference]: Start difference. First operand has 625 states, 620 states have (on average 1.4870967741935484) internal successors, (922), 620 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 625 states. [2022-04-14 18:26:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:18,089 INFO L93 Difference]: Finished difference Result 625 states and 926 transitions. [2022-04-14 18:26:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 926 transitions. [2022-04-14 18:26:18,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:18,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:18,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:26:18,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:26:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 620 states have (on average 1.4870967741935484) internal successors, (922), 620 states have internal predecessors, (922), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 926 transitions. [2022-04-14 18:26:18,105 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 926 transitions. Word has length 115 [2022-04-14 18:26:18,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:26:18,105 INFO L478 AbstractCegarLoop]: Abstraction has 625 states and 926 transitions. [2022-04-14 18:26:18,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 926 transitions. [2022-04-14 18:26:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-14 18:26:18,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:26:18,107 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 18:26:18,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-14 18:26:18,107 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:26:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:26:18,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1281232474, now seen corresponding path program 1 times [2022-04-14 18:26:18,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:26:18,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131603445] [2022-04-14 18:26:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:26:18,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:26:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:26:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:18,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {36968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36962#true} is VALID [2022-04-14 18:26:18,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {36962#true} assume true; {36962#true} is VALID [2022-04-14 18:26:18,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36962#true} {36962#true} #661#return; {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {36962#true} call ULTIMATE.init(); {36968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:26:18,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {36968#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {36962#true} assume true; {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36962#true} {36962#true} #661#return; {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {36962#true} call #t~ret161 := main(); {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {36962#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {36962#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L272 TraceCheckUtils]: 7: Hoare triple {36962#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36962#true} is VALID [2022-04-14 18:26:18,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {36962#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;~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); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {36967#(= 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; {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {36967#(= 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; {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {36967#(= 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)))); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !false; {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {36967#(= 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); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {36967#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-14 18:26:18,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {36967#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {36963#false} is VALID [2022-04-14 18:26:18,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {36963#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {36963#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {36963#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {36963#false} ~skip~0 := 0; {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {36963#false} assume !false; {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {36963#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {36963#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {36963#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {36963#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {36963#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {36963#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {36963#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {36963#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {36963#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {36963#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {36963#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {36963#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {36963#false} assume 8496 == #t~mem58;havoc #t~mem58; {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {36963#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 46: Hoare triple {36963#false} assume !(1 == ~blastFlag~0); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {36963#false} assume !(3 == ~blastFlag~0); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {36963#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {36963#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {36963#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {36963#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {36963#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36963#false} is VALID [2022-04-14 18:26:18,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {36963#false} ~skip~0 := 0; {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {36963#false} assume !false; {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 55: Hoare triple {36963#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {36963#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {36963#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {36963#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {36963#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {36963#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {36963#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {36963#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {36963#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {36963#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {36963#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {36963#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {36963#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {36963#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 69: Hoare triple {36963#false} assume 8512 == #t~mem60;havoc #t~mem60; {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 70: Hoare triple {36963#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); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {36963#false} assume 0 != (if 0 == #t~mem97 then 0 else (if 1 == #t~mem97 then 0 else ~bitwiseAnd(#t~mem97, 256))) % 4294967296;havoc #t~mem95.base, #t~mem95.offset;havoc #t~mem96.base, #t~mem96.offset;havoc #t~mem97;~skip~0 := 1; {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {36963#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 73: Hoare triple {36963#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 74: Hoare triple {36963#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 75: Hoare triple {36963#false} ~skip~0 := 0; {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 76: Hoare triple {36963#false} assume !false; {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 77: Hoare triple {36963#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 78: Hoare triple {36963#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {36963#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 80: Hoare triple {36963#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 81: Hoare triple {36963#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 82: Hoare triple {36963#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 83: Hoare triple {36963#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 84: Hoare triple {36963#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {36963#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {36963#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {36963#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 88: Hoare triple {36963#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 89: Hoare triple {36963#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 90: Hoare triple {36963#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,227 INFO L290 TraceCheckUtils]: 91: Hoare triple {36963#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {36963#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 93: Hoare triple {36963#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 94: Hoare triple {36963#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 95: Hoare triple {36963#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 96: Hoare triple {36963#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 97: Hoare triple {36963#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 98: Hoare triple {36963#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 99: Hoare triple {36963#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 100: Hoare triple {36963#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 101: Hoare triple {36963#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 102: Hoare triple {36963#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 103: Hoare triple {36963#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,228 INFO L290 TraceCheckUtils]: 104: Hoare triple {36963#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 105: Hoare triple {36963#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 106: Hoare triple {36963#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 107: Hoare triple {36963#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 108: Hoare triple {36963#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 109: Hoare triple {36963#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 110: Hoare triple {36963#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 111: Hoare triple {36963#false} assume 8673 == #t~mem80;havoc #t~mem80; {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 112: Hoare triple {36963#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 113: Hoare triple {36963#false} assume 3 == ~blastFlag~0; {36963#false} is VALID [2022-04-14 18:26:18,229 INFO L290 TraceCheckUtils]: 114: Hoare triple {36963#false} assume !false; {36963#false} is VALID [2022-04-14 18:26:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-04-14 18:26:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:26:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131603445] [2022-04-14 18:26:18,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131603445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:26:18,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:26:18,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 18:26:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668941836] [2022-04-14 18:26:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:26:18,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-14 18:26:18,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:26:18,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:18,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:18,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 18:26:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:26:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 18:26:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 18:26:18,295 INFO L87 Difference]: Start difference. First operand 625 states and 926 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:20,312 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-14 18:26:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:20,918 INFO L93 Difference]: Finished difference Result 1226 states and 1825 transitions. [2022-04-14 18:26:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 18:26:20,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2022-04-14 18:26:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:26:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-04-14 18:26:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-04-14 18:26:20,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 405 transitions. [2022-04-14 18:26:21,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:21,203 INFO L225 Difference]: With dead ends: 1226 [2022-04-14 18:26:21,203 INFO L226 Difference]: Without dead ends: 627 [2022-04-14 18:26:21,204 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-14 18:26:21,204 INFO L913 BasicCegarLoop]: 201 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 18:26:21,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 386 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 18:26:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-04-14 18:26:21,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2022-04-14 18:26:21,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:26:21,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 627 states. Second operand has 627 states, 622 states have (on average 1.4855305466237942) internal successors, (924), 622 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:21,214 INFO L74 IsIncluded]: Start isIncluded. First operand 627 states. Second operand has 627 states, 622 states have (on average 1.4855305466237942) internal successors, (924), 622 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:21,214 INFO L87 Difference]: Start difference. First operand 627 states. Second operand has 627 states, 622 states have (on average 1.4855305466237942) internal successors, (924), 622 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:21,226 INFO L93 Difference]: Finished difference Result 627 states and 928 transitions. [2022-04-14 18:26:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 928 transitions. [2022-04-14 18:26:21,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:21,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:21,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 627 states, 622 states have (on average 1.4855305466237942) internal successors, (924), 622 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 627 states. [2022-04-14 18:26:21,228 INFO L87 Difference]: Start difference. First operand has 627 states, 622 states have (on average 1.4855305466237942) internal successors, (924), 622 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 627 states. [2022-04-14 18:26:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:21,241 INFO L93 Difference]: Finished difference Result 627 states and 928 transitions. [2022-04-14 18:26:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 928 transitions. [2022-04-14 18:26:21,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:21,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:21,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:26:21,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:26:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 622 states have (on average 1.4855305466237942) internal successors, (924), 622 states have internal predecessors, (924), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 928 transitions. [2022-04-14 18:26:21,255 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 928 transitions. Word has length 115 [2022-04-14 18:26:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:26:21,256 INFO L478 AbstractCegarLoop]: Abstraction has 627 states and 928 transitions. [2022-04-14 18:26:21,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 928 transitions. [2022-04-14 18:26:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-14 18:26:21,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:26:21,257 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, 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-14 18:26:21,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-14 18:26:21,257 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:26:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:26:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash -489530676, now seen corresponding path program 1 times [2022-04-14 18:26:21,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:26:21,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440923749] [2022-04-14 18:26:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:26:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:26:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 18:26:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 18:26:21,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {40322#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40313#true} is VALID [2022-04-14 18:26:21,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {40313#true} assume true; {40313#true} is VALID [2022-04-14 18:26:21,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40313#true} {40313#true} #661#return; {40313#true} is VALID [2022-04-14 18:26:21,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {40313#true} call ULTIMATE.init(); {40322#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-14 18:26:21,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {40322#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40313#true} is VALID [2022-04-14 18:26:21,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {40313#true} assume true; {40313#true} is VALID [2022-04-14 18:26:21,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40313#true} {40313#true} #661#return; {40313#true} is VALID [2022-04-14 18:26:21,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {40313#true} call #t~ret161 := main(); {40313#true} is VALID [2022-04-14 18:26:21,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {40313#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~int(8464, ~s~0.base, 52 + ~s~0.offset, 4);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; {40313#true} is VALID [2022-04-14 18:26:21,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {40313#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40318#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} is VALID [2022-04-14 18:26:21,619 INFO L272 TraceCheckUtils]: 7: Hoare triple {40318#(and (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (+ main_~s~0.offset 136)) 0) (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (+ main_~s~0.offset 136)) 0))} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {40319#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} is VALID [2022-04-14 18:26:21,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {40319#(and (= (select (select |#memory_$Pointer$.base| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ssl3_accept_#in~s.base|) (+ |ssl3_accept_#in~s.offset| 136))))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;havoc ~l~0;havoc ~Time~0;havoc ~tmp~3;havoc ~cb~0.base, ~cb~0.offset;havoc ~num1~0;havoc ~ret~0;havoc ~new_state~0;havoc ~state~0;havoc ~skip~0;havoc ~got_new_session~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___3~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___4~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___5~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___6~0 := #t~nondet36;havoc #t~nondet36;havoc ~tmp___7~0;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp___10~0 := #t~nondet39;havoc #t~nondet39;havoc ~blastFlag~0;~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); {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-14 18:26:21,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume 0 != (#t~mem42.base + #t~mem42.offset) % 4294967296;havoc #t~mem42.base, #t~mem42.offset;call #t~mem43.base, #t~mem43.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4);~cb~0.base, ~cb~0.offset := #t~mem43.base, #t~mem43.offset;havoc #t~mem43.base, #t~mem43.offset; {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-14 18:26:21,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem44 := read~int(~s.base, 28 + ~s.offset, 4);call write~int(1 + #t~mem44, ~s.base, 28 + ~s.offset, 4);havoc #t~mem44; {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-14 18:26:21,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} is VALID [2022-04-14 18:26:21,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {40320#(and (= (select (select |#memory_$Pointer$.base| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0) (= (select (select |#memory_$Pointer$.offset| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 136)) 0))} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {40321#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-14 18:26:21,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {40321#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {40314#false} is VALID [2022-04-14 18:26:21,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {40314#false} assume !false; {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {40314#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {40314#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {40314#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {40314#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {40314#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {40314#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {40314#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {40314#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {40314#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {40314#false} assume 8464 == #t~mem55;havoc #t~mem55; {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {40314#false} call write~int(0, ~s.base, 48 + ~s.offset, 4);assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {40314#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {40314#false} assume !(~ret~0 <= 0);~got_new_session~0 := 1;call write~int(8496, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {40314#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {40314#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {40314#false} ~skip~0 := 0; {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {40314#false} assume !false; {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {40314#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {40314#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {40314#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {40314#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {40314#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {40314#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {40314#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {40314#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {40314#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {40314#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {40314#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 43: Hoare triple {40314#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 44: Hoare triple {40314#false} assume 8496 == #t~mem58;havoc #t~mem58; {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {40314#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {40314#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 47: Hoare triple {40314#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 48: Hoare triple {40314#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 49: Hoare triple {40314#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 50: Hoare triple {40314#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {40314#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40314#false} is VALID [2022-04-14 18:26:21,628 INFO L290 TraceCheckUtils]: 52: Hoare triple {40314#false} ~skip~0 := 0; {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 53: Hoare triple {40314#false} assume !false; {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 54: Hoare triple {40314#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 55: Hoare triple {40314#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 56: Hoare triple {40314#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 57: Hoare triple {40314#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 58: Hoare triple {40314#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 59: Hoare triple {40314#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {40314#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {40314#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {40314#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {40314#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {40314#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {40314#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 66: Hoare triple {40314#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 67: Hoare triple {40314#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 68: Hoare triple {40314#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 69: Hoare triple {40314#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 70: Hoare triple {40314#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,630 INFO L290 TraceCheckUtils]: 71: Hoare triple {40314#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {40314#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {40314#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 74: Hoare triple {40314#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 75: Hoare triple {40314#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 76: Hoare triple {40314#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 77: Hoare triple {40314#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 78: Hoare triple {40314#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 79: Hoare triple {40314#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 80: Hoare triple {40314#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,631 INFO L290 TraceCheckUtils]: 81: Hoare triple {40314#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 82: Hoare triple {40314#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 83: Hoare triple {40314#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 84: Hoare triple {40314#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 85: Hoare triple {40314#false} assume 8656 == #t~mem77;havoc #t~mem77; {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 86: Hoare triple {40314#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; {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 87: Hoare triple {40314#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 88: Hoare triple {40314#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 89: Hoare triple {40314#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); {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 90: Hoare triple {40314#false} assume !(0 == ~tmp___10~0); {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 91: Hoare triple {40314#false} call #t~mem150.base, #t~mem150.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem151 := read~int(#t~mem150.base, 848 + #t~mem150.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,632 INFO L290 TraceCheckUtils]: 92: Hoare triple {40314#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 93: Hoare triple {40314#false} ~skip~0 := 0; {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 94: Hoare triple {40314#false} assume !false; {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 95: Hoare triple {40314#false} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 96: Hoare triple {40314#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 97: Hoare triple {40314#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 98: Hoare triple {40314#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 99: Hoare triple {40314#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 100: Hoare triple {40314#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 101: Hoare triple {40314#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 102: Hoare triple {40314#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 103: Hoare triple {40314#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,633 INFO L290 TraceCheckUtils]: 104: Hoare triple {40314#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 105: Hoare triple {40314#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 106: Hoare triple {40314#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 107: Hoare triple {40314#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 108: Hoare triple {40314#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 109: Hoare triple {40314#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 110: Hoare triple {40314#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 111: Hoare triple {40314#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 112: Hoare triple {40314#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 113: Hoare triple {40314#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 114: Hoare triple {40314#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 115: Hoare triple {40314#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,634 INFO L290 TraceCheckUtils]: 116: Hoare triple {40314#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 117: Hoare triple {40314#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 118: Hoare triple {40314#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 119: Hoare triple {40314#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 120: Hoare triple {40314#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 121: Hoare triple {40314#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 122: Hoare triple {40314#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 123: Hoare triple {40314#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 124: Hoare triple {40314#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 125: Hoare triple {40314#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 126: Hoare triple {40314#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 127: Hoare triple {40314#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {40314#false} is VALID [2022-04-14 18:26:21,635 INFO L290 TraceCheckUtils]: 128: Hoare triple {40314#false} assume 8672 == #t~mem79;havoc #t~mem79; {40314#false} is VALID [2022-04-14 18:26:21,636 INFO L290 TraceCheckUtils]: 129: Hoare triple {40314#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {40314#false} is VALID [2022-04-14 18:26:21,636 INFO L290 TraceCheckUtils]: 130: Hoare triple {40314#false} assume 3 == ~blastFlag~0; {40314#false} is VALID [2022-04-14 18:26:21,636 INFO L290 TraceCheckUtils]: 131: Hoare triple {40314#false} assume !false; {40314#false} is VALID [2022-04-14 18:26:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-04-14 18:26:21,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 18:26:21,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440923749] [2022-04-14 18:26:21,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440923749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 18:26:21,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 18:26:21,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 18:26:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606707768] [2022-04-14 18:26:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 18:26:21,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-14 18:26:21,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 18:26:21,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:21,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:21,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 18:26:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 18:26:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 18:26:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 18:26:21,702 INFO L87 Difference]: Start difference. First operand 627 states and 928 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:23,738 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-14 18:26:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:25,232 INFO L93 Difference]: Finished difference Result 1247 states and 1848 transitions. [2022-04-14 18:26:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 18:26:25,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 132 [2022-04-14 18:26:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 18:26:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-14 18:26:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-14 18:26:25,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 402 transitions. [2022-04-14 18:26:25,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 18:26:25,536 INFO L225 Difference]: With dead ends: 1247 [2022-04-14 18:26:25,536 INFO L226 Difference]: Without dead ends: 627 [2022-04-14 18:26:25,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 18:26:25,537 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-14 18:26:25,538 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 791 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-14 18:26:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-04-14 18:26:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2022-04-14 18:26:25,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 18:26:25,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 627 states. Second operand has 627 states, 622 states have (on average 1.4839228295819935) internal successors, (923), 622 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:25,546 INFO L74 IsIncluded]: Start isIncluded. First operand 627 states. Second operand has 627 states, 622 states have (on average 1.4839228295819935) internal successors, (923), 622 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:25,546 INFO L87 Difference]: Start difference. First operand 627 states. Second operand has 627 states, 622 states have (on average 1.4839228295819935) internal successors, (923), 622 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:25,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:25,558 INFO L93 Difference]: Finished difference Result 627 states and 927 transitions. [2022-04-14 18:26:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2022-04-14 18:26:25,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:25,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:25,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 627 states, 622 states have (on average 1.4839228295819935) internal successors, (923), 622 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 627 states. [2022-04-14 18:26:25,560 INFO L87 Difference]: Start difference. First operand has 627 states, 622 states have (on average 1.4839228295819935) internal successors, (923), 622 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 627 states. [2022-04-14 18:26:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 18:26:25,573 INFO L93 Difference]: Finished difference Result 627 states and 927 transitions. [2022-04-14 18:26:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2022-04-14 18:26:25,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 18:26:25,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 18:26:25,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 18:26:25,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 18:26:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 622 states have (on average 1.4839228295819935) internal successors, (923), 622 states have internal predecessors, (923), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 927 transitions. [2022-04-14 18:26:25,588 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 927 transitions. Word has length 132 [2022-04-14 18:26:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 18:26:25,588 INFO L478 AbstractCegarLoop]: Abstraction has 627 states and 927 transitions. [2022-04-14 18:26:25,588 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 18:26:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2022-04-14 18:26:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-14 18:26:25,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 18:26:25,589 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, 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-14 18:26:25,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-14 18:26:25,589 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 18:26:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 18:26:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash -919188982, now seen corresponding path program 1 times [2022-04-14 18:26:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 18:26:25,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141066081] [2022-04-14 18:26:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 18:26:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 18:26:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:26:25,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 18:26:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 18:26:26,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 18:26:26,225 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 18:26:26,226 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 18:26:26,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-14 18:26:26,229 INFO L719 BasicCegarLoop]: Path program 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] [2022-04-14 18:26:26,232 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 18:26:26,349 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1743 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 18:26:26,350 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1743-1 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-14 18:26:26,351 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1723 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1727 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-14 18:26:26,352 WARN L170 areAnnotationChecker]: L1727-2 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-14 18:26:26,353 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1654 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1692 has no Hoare annotation [2022-04-14 18:26:26,354 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1692-1 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1696 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1694-2 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-14 18:26:26,355 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1705 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1376-2 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1376-2 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1376 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1387 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1387-2 has no Hoare annotation [2022-04-14 18:26:26,356 WARN L170 areAnnotationChecker]: L1396-2 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1400 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1400 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1412 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1412 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1412-2 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1417 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1417 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1458 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1458 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1434 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-14 18:26:26,357 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1459 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1459 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1460 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1468 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1500 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1500 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1423-1 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1469 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1469 has no Hoare annotation [2022-04-14 18:26:26,358 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1427 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1470 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1478 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1513 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1510-1 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1428 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1481 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1481 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1528 has no Hoare annotation [2022-04-14 18:26:26,359 WARN L170 areAnnotationChecker]: L1528 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1428-2 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1428-2 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1537 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1537 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1549 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1549 has no Hoare annotation [2022-04-14 18:26:26,360 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1560 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1571 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-14 18:26:26,361 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1576 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1576 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1576-2 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1586 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-14 18:26:26,362 WARN L170 areAnnotationChecker]: L1593 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1593 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1593-2 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1593-2 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1615 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1605 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1620 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-14 18:26:26,363 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-14 18:26:26,364 WARN L170 areAnnotationChecker]: L1636 has no Hoare annotation [2022-04-14 18:26:26,364 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-14 18:26:26,364 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-14 18:26:26,364 WARN L170 areAnnotationChecker]: L1640 has no Hoare annotation [2022-04-14 18:26:26,364 WARN L170 areAnnotationChecker]: L1636-1 has no Hoare annotation [2022-04-14 18:26:26,364 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 18:26:26,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 06:26:26 BoogieIcfgContainer [2022-04-14 18:26:26,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 18:26:26,367 INFO L158 Benchmark]: Toolchain (without parser) took 123638.07ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 115.3MB in the beginning and 83.1MB in the end (delta: 32.2MB). Peak memory consumption was 100.7MB. Max. memory is 8.0GB. [2022-04-14 18:26:26,367 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory was 134.7MB in the beginning and 134.5MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 18:26:26,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.74ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 115.2MB in the beginning and 156.2MB in the end (delta: -41.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-14 18:26:26,368 INFO L158 Benchmark]: Boogie Preprocessor took 105.77ms. Allocated memory is still 204.5MB. Free memory was 156.2MB in the beginning and 146.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-14 18:26:26,369 INFO L158 Benchmark]: RCFGBuilder took 3235.68ms. Allocated memory is still 204.5MB. Free memory was 146.2MB in the beginning and 151.7MB in the end (delta: -5.4MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2022-04-14 18:26:26,372 INFO L158 Benchmark]: TraceAbstraction took 119797.02ms. Allocated memory is still 204.5MB. Free memory was 151.1MB in the beginning and 83.1MB in the end (delta: 68.0MB). Peak memory consumption was 102.1MB. Max. memory is 8.0GB. [2022-04-14 18:26:26,374 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 169.9MB. Free memory was 134.7MB in the beginning and 134.5MB in the end (delta: 143.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 493.74ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 115.2MB in the beginning and 156.2MB in the end (delta: -41.0MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 105.77ms. Allocated memory is still 204.5MB. Free memory was 156.2MB in the beginning and 146.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 3235.68ms. Allocated memory is still 204.5MB. Free memory was 146.2MB in the beginning and 151.7MB in the end (delta: -5.4MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. * TraceAbstraction took 119797.02ms. Allocated memory is still 204.5MB. Free memory was 151.1MB in the beginning and 83.1MB in the end (delta: 68.0MB). Peak memory consumption was 102.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1733]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967305, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) VAL [init=1, s={-4294967299:0}, SSLv3_server_data={4:0}] [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->info_callback={0:13}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:13}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967299:0}, s={-4294967299:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:13}, blastFlag=1, got_new_session=0, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967302, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:13}, blastFlag=1, got_new_session=1, init=1, ret=18, s={-4294967299:0}, s={-4294967299:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1382] COND FALSE !(ret <= 0) [L1387] s->hit VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->hit=7, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1387] COND TRUE s->hit [L1388] s->state = 8656 VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1392] s->init_num = 0 VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967302, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:13}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1585] EXPR s->session [L1585] EXPR s->s3 [L1585] EXPR (s->s3)->tmp.new_cipher [L1585] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1586] COND FALSE !(! tmp___9) [L1592] ret = __VERIFIER_nondet_int() [L1593] COND TRUE blastFlag == 2 [L1594] blastFlag = 3 VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1598] COND FALSE !(ret <= 0) [L1603] s->state = 8672 [L1604] s->init_num = 0 VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1605] COND FALSE !(! tmp___10) VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] EXPR s->s3 [L1692] EXPR (s->s3)->tmp.reuse_message VAL [={0:13}, (s->s3)->tmp.reuse_message=4294967302, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->s3={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1692] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1721] skip = 0 VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967299:0}, s={-4294967299:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1614] ret = __VERIFIER_nondet_int() [L1615] COND TRUE blastFlag == 3 VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] [L1733] reach_error() VAL [={0:13}, blastFlag=3, got_new_session=1, init=1, ret=-14, s={-4294967299:0}, s={-4294967299:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=8, tmp=8, tmp___1=0, tmp___10=6, tmp___2=9, tmp___3=10, tmp___4=0, tmp___5=11, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 184 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 119.6s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 112.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 1751 SdHoareTripleChecker+Valid, 76.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1751 mSDsluCounter, 11606 SdHoareTripleChecker+Invalid, 76.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7135 mSDsCounter, 673 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10492 IncrementalHoareTripleChecker+Invalid, 11195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 673 mSolverCounterUnsat, 4471 mSDtfsCounter, 10492 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=627occurred in iteration=25, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 1085 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2326 NumberOfCodeBlocks, 2326 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2168 ConstructedInterpolants, 0 QuantifiedInterpolants, 5604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 818/818 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-14 18:26:26,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...