/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.03.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:25:30,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:25:30,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:25:30,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:25:30,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:25:30,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:25:30,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:25:30,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:25:30,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:25:30,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:25:30,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:25:30,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:25:30,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:25:30,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:25:30,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:25:30,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:25:30,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:25:30,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:25:30,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:25:30,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:25:30,894 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:25:30,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:25:30,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:25:30,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:25:30,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:25:30,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:25:30,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:25:30,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:25:30,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:25:30,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:25:30,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:25:30,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:25:30,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:25:30,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:25:30,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:25:30,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:25:30,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:25:30,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:25:30,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:25:30,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:25:30,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:25:30,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:25:30,909 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-27 15:25:30,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:25:30,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:25:30,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:25:30,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:25:30,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:25:30,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:25:30,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:25:30,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:25:30,930 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:25:30,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:25:30,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:25:30,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:25:30,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:25:30,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:25:30,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:25:30,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:25:30,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:25:30,931 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:25:30,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:25:30,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:25:30,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:25:30,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:25:30,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:25:30,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:25:30,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:25:30,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:25:30,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:25:30,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:25:30,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:25:30,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:25:30,933 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:25:30,934 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:25:30,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:25:30,934 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-27 15:25:31,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:25:31,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:25:31,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:25:31,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:25:31,155 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:25:31,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c [2022-04-27 15:25:31,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83efaad5/2be60352614a40429a2b48a0362625ee/FLAGafdc9b4ea [2022-04-27 15:25:31,692 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:25:31,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c [2022-04-27 15:25:31,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83efaad5/2be60352614a40429a2b48a0362625ee/FLAGafdc9b4ea [2022-04-27 15:25:32,233 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c83efaad5/2be60352614a40429a2b48a0362625ee [2022-04-27 15:25:32,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:25:32,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:25:32,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:25:32,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:25:32,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:25:32,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:32,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4ea687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32, skipping insertion in model container [2022-04-27 15:25:32,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:32,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:25:32,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:25:32,715 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.03.i.cil.c[72493,72506] [2022-04-27 15:25:32,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:25:32,737 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:25:32,880 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.03.i.cil.c[72493,72506] [2022-04-27 15:25:32,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:25:32,908 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:25:32,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32 WrapperNode [2022-04-27 15:25:32,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:25:32,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:25:32,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:25:32,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:25:32,920 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:32,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:32,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:32,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:33,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:33,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:33,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:33,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:25:33,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:25:33,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:25:33,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:25:33,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (1/1) ... [2022-04-27 15:25:33,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:25:33,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:25:33,097 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-27 15:25:33,108 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-27 15:25:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:25:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:25:33,142 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:25:33,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-04-27 15:25:33,144 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-04-27 15:25:33,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:25:33,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-27 15:25:33,144 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-27 15:25:33,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 15:25:33,144 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-27 15:25:33,144 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-27 15:25:33,145 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 15:25:33,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-27 15:25:33,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 15:25:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-27 15:25:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:25:33,302 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:25:33,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:25:35,845 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:25:36,457 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-04-27 15:25:36,457 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-04-27 15:25:36,471 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:25:36,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:25:36,480 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:25:36,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:25:36 BoogieIcfgContainer [2022-04-27 15:25:36,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:25:36,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:25:36,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:25:36,486 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:25:36,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:25:32" (1/3) ... [2022-04-27 15:25:36,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e7991c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:25:36, skipping insertion in model container [2022-04-27 15:25:36,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:25:32" (2/3) ... [2022-04-27 15:25:36,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e7991c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:25:36, skipping insertion in model container [2022-04-27 15:25:36,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:25:36" (3/3) ... [2022-04-27 15:25:36,489 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2022-04-27 15:25:36,502 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:25:36,502 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:25:36,548 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:25:36,554 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d2db125, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b372f28 [2022-04-27 15:25:36,554 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:25:36,564 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-27 15:25:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 15:25:36,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:36,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:36,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:36,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1104936065, now seen corresponding path program 1 times [2022-04-27 15:25:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:36,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358363756] [2022-04-27 15:25:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:36,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:37,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:37,157 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:37,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-27 15:25:37,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #662#return; {156#true} is VALID [2022-04-27 15:25:37,162 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-27 15:25:37,162 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:37,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-27 15:25:37,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #662#return; {156#true} is VALID [2022-04-27 15:25:37,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret161 := main(); {156#true} is VALID [2022-04-27 15:25:37,164 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-27 15:25:37,164 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-27 15:25:37,164 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-27 15:25:37,171 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-27 15:25:37,175 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-27 15:25:37,177 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-27 15:25:37,178 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-27 15:25:37,178 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-27 15:25:37,179 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-27 15:25:37,181 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-27 15:25:37,182 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-27 15:25:37,183 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-27 15:25:37,184 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-27 15:25:37,185 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-27 15:25:37,185 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-27 15:25:37,186 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-27 15:25:37,187 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-27 15:25:37,188 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-27 15:25:37,188 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-27 15:25:37,189 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-27 15:25:37,189 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-27 15:25:37,189 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-27 15:25:37,190 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-27 15:25:37,190 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-27 15:25:37,190 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-27 15:25:37,190 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-27 15:25:37,190 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-27 15:25:37,191 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-27 15:25:37,191 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-27 15:25:37,191 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-27 15:25:37,191 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-27 15:25:37,192 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-27 15:25:37,192 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-27 15:25:37,192 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-27 15:25:37,192 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-27 15:25:37,193 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-27 15:25:37,193 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-27 15:25:37,193 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-27 15:25:37,193 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-27 15:25:37,194 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-27 15:25:37,194 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-27 15:25:37,194 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-27 15:25:37,194 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-27 15:25:37,195 INFO L290 TraceCheckUtils]: 48: Hoare triple {157#false} assume 8672 == #t~mem79;havoc #t~mem79; {157#false} is VALID [2022-04-27 15:25:37,195 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-27 15:25:37,195 INFO L290 TraceCheckUtils]: 50: Hoare triple {157#false} assume 3 == ~blastFlag~0; {157#false} is VALID [2022-04-27 15:25:37,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-27 15:25:37,196 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-27 15:25:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:37,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358363756] [2022-04-27 15:25:37,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358363756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:37,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:37,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629322772] [2022-04-27 15:25:37,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:37,212 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-27 15:25:37,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:37,218 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-27 15:25:37,288 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-27 15:25:37,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:37,320 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-27 15:25:39,366 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-27 15:25:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:40,952 INFO L93 Difference]: Finished difference Result 324 states and 540 transitions. [2022-04-27 15:25:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:40,952 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-27 15:25:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:40,954 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-27 15:25:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-27 15:25:40,971 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-27 15:25:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2022-04-27 15:25:40,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 540 transitions. [2022-04-27 15:25:41,423 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-27 15:25:41,435 INFO L225 Difference]: With dead ends: 324 [2022-04-27 15:25:41,435 INFO L226 Difference]: Without dead ends: 165 [2022-04-27 15:25:41,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:41,441 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 34 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:41,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 577 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:25:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-27 15:25:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-04-27 15:25:41,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:41,476 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-27 15:25:41,477 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-27 15:25:41,478 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-27 15:25:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:41,486 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-27 15:25:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-27 15:25:41,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:41,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:41,488 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-27 15:25:41,488 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-27 15:25:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:41,496 INFO L93 Difference]: Finished difference Result 165 states and 245 transitions. [2022-04-27 15:25:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2022-04-27 15:25:41,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:41,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:41,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:41,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:41,498 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-27 15:25:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2022-04-27 15:25:41,505 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 52 [2022-04-27 15:25:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:41,505 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2022-04-27 15:25:41,506 INFO L496 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-27 15:25:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2022-04-27 15:25:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 15:25:41,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:41,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:41,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:25:41,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:41,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 133985870, now seen corresponding path program 1 times [2022-04-27 15:25:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:41,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128347360] [2022-04-27 15:25:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:41,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:41,711 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:41,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {1065#true} assume true; {1065#true} is VALID [2022-04-27 15:25:41,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1065#true} {1065#true} #662#return; {1065#true} is VALID [2022-04-27 15:25:41,713 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-27 15:25:41,713 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:41,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {1065#true} assume true; {1065#true} is VALID [2022-04-27 15:25:41,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1065#true} {1065#true} #662#return; {1065#true} is VALID [2022-04-27 15:25:41,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {1065#true} call #t~ret161 := main(); {1065#true} is VALID [2022-04-27 15:25:41,714 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-27 15:25:41,714 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-27 15:25:41,714 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-27 15:25:41,716 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-27 15:25:41,717 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-27 15:25:41,718 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-27 15:25:41,718 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-27 15:25:41,719 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-27 15:25:41,720 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-27 15:25:41,720 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-27 15:25:41,720 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-27 15:25:41,721 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-27 15:25:41,721 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-27 15:25:41,722 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-27 15:25:41,723 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-27 15:25:41,723 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-27 15:25:41,724 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-27 15:25:41,724 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-27 15:25:41,724 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-27 15:25:41,724 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-27 15:25:41,725 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-27 15:25:41,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {1066#false} ~skip~0 := 0; {1066#false} is VALID [2022-04-27 15:25:41,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2022-04-27 15:25:41,725 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-27 15:25:41,725 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-27 15:25:41,725 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-27 15:25:41,726 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-27 15:25:41,726 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-27 15:25:41,726 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-27 15:25:41,726 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-27 15:25:41,726 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-27 15:25:41,726 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-27 15:25:41,727 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-27 15:25:41,727 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-27 15:25:41,727 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-27 15:25:41,727 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-27 15:25:41,727 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-27 15:25:41,727 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-27 15:25:41,728 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-27 15:25:41,728 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-27 15:25:41,728 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-27 15:25:41,728 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-27 15:25:41,728 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-27 15:25:41,729 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-27 15:25:41,729 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-27 15:25:41,729 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-27 15:25:41,729 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-27 15:25:41,729 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-27 15:25:41,729 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-27 15:25:41,730 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-27 15:25:41,730 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-27 15:25:41,730 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-27 15:25:41,730 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-27 15:25:41,730 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-27 15:25:41,731 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-27 15:25:41,731 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-27 15:25:41,731 INFO L290 TraceCheckUtils]: 61: Hoare triple {1066#false} assume 8672 == #t~mem79;havoc #t~mem79; {1066#false} is VALID [2022-04-27 15:25:41,731 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-27 15:25:41,731 INFO L290 TraceCheckUtils]: 63: Hoare triple {1066#false} assume 3 == ~blastFlag~0; {1066#false} is VALID [2022-04-27 15:25:41,731 INFO L290 TraceCheckUtils]: 64: Hoare triple {1066#false} assume !false; {1066#false} is VALID [2022-04-27 15:25:41,732 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-27 15:25:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:41,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128347360] [2022-04-27 15:25:41,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128347360] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:41,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:41,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019470955] [2022-04-27 15:25:41,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:41,734 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-27 15:25:41,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:41,735 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-27 15:25:41,788 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-27 15:25:41,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:41,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:41,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:41,790 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-27 15:25:43,817 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-27 15:25:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:45,542 INFO L93 Difference]: Finished difference Result 384 states and 586 transitions. [2022-04-27 15:25:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:45,542 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-27 15:25:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:45,543 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-27 15:25:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-27 15:25:45,550 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-27 15:25:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-27 15:25:45,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-27 15:25:46,006 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-27 15:25:46,012 INFO L225 Difference]: With dead ends: 384 [2022-04-27 15:25:46,013 INFO L226 Difference]: Without dead ends: 262 [2022-04-27 15:25:46,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:46,015 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 137 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:46,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 584 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 602 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-27 15:25:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-04-27 15:25:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 164. [2022-04-27 15:25:46,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:46,027 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-27 15:25:46,027 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-27 15:25:46,028 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-27 15:25:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:46,036 INFO L93 Difference]: Finished difference Result 262 states and 398 transitions. [2022-04-27 15:25:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 398 transitions. [2022-04-27 15:25:46,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:46,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:46,038 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-27 15:25:46,039 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-27 15:25:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:46,047 INFO L93 Difference]: Finished difference Result 262 states and 398 transitions. [2022-04-27 15:25:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 398 transitions. [2022-04-27 15:25:46,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:46,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:46,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:46,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:46,049 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-27 15:25:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 249 transitions. [2022-04-27 15:25:46,053 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 249 transitions. Word has length 65 [2022-04-27 15:25:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:46,054 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 249 transitions. [2022-04-27 15:25:46,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:46,054 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 249 transitions. [2022-04-27 15:25:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:46,055 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:46,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:46,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:25:46,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1027752574, now seen corresponding path program 1 times [2022-04-27 15:25:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:46,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110302259] [2022-04-27 15:25:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:46,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:46,209 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:46,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-04-27 15:25:46,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2257#true} {2257#true} #662#return; {2257#true} is VALID [2022-04-27 15:25:46,211 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-27 15:25:46,211 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:46,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {2257#true} assume true; {2257#true} is VALID [2022-04-27 15:25:46,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2257#true} {2257#true} #662#return; {2257#true} is VALID [2022-04-27 15:25:46,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {2257#true} call #t~ret161 := main(); {2257#true} is VALID [2022-04-27 15:25:46,212 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-27 15:25:46,212 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-27 15:25:46,212 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-27 15:25:46,214 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-27 15:25:46,215 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-27 15:25:46,216 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-27 15:25:46,216 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-27 15:25:46,217 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-27 15:25:46,217 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-27 15:25:46,218 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-27 15:25:46,218 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-27 15:25:46,219 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-27 15:25:46,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {2258#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {2258#false} is VALID [2022-04-27 15:25:46,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {2258#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {2258#false} is VALID [2022-04-27 15:25:46,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {2258#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2258#false} is VALID [2022-04-27 15:25:46,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2258#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {2258#false} is VALID [2022-04-27 15:25:46,219 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-27 15:25:46,220 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-27 15:25:46,220 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-27 15:25:46,220 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-27 15:25:46,220 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-27 15:25:46,220 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-27 15:25:46,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {2258#false} ~skip~0 := 0; {2258#false} is VALID [2022-04-27 15:25:46,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {2258#false} assume !false; {2258#false} is VALID [2022-04-27 15:25:46,220 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-27 15:25:46,220 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-27 15:25:46,221 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-27 15:25:46,221 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-27 15:25:46,221 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-27 15:25:46,221 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-27 15:25:46,221 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-27 15:25:46,222 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-27 15:25:46,222 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-27 15:25:46,222 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-27 15:25:46,222 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-27 15:25:46,222 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-27 15:25:46,222 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-27 15:25:46,222 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-27 15:25:46,223 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-27 15:25:46,223 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-27 15:25:46,223 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-27 15:25:46,223 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-27 15:25:46,223 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-27 15:25:46,223 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-27 15:25:46,224 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-27 15:25:46,224 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-27 15:25:46,224 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-27 15:25:46,224 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-27 15:25:46,224 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-27 15:25:46,224 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-27 15:25:46,225 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-27 15:25:46,225 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-27 15:25:46,225 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-27 15:25:46,225 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-27 15:25:46,225 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-27 15:25:46,225 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-27 15:25:46,225 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-27 15:25:46,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {2258#false} assume 8672 == #t~mem79;havoc #t~mem79; {2258#false} is VALID [2022-04-27 15:25:46,226 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-27 15:25:46,226 INFO L290 TraceCheckUtils]: 64: Hoare triple {2258#false} assume 3 == ~blastFlag~0; {2258#false} is VALID [2022-04-27 15:25:46,226 INFO L290 TraceCheckUtils]: 65: Hoare triple {2258#false} assume !false; {2258#false} is VALID [2022-04-27 15:25:46,226 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-27 15:25:46,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:46,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110302259] [2022-04-27 15:25:46,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110302259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:46,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:46,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:46,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384368297] [2022-04-27 15:25:46,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:46,228 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-27 15:25:46,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:46,228 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-27 15:25:46,278 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-27 15:25:46,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:46,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:46,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:46,279 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-27 15:25:48,299 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-27 15:25:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:49,226 INFO L93 Difference]: Finished difference Result 318 states and 481 transitions. [2022-04-27 15:25:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:49,227 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-27 15:25:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:49,227 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-27 15:25:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-27 15:25:49,232 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-27 15:25:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2022-04-27 15:25:49,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 429 transitions. [2022-04-27 15:25:49,522 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-27 15:25:49,525 INFO L225 Difference]: With dead ends: 318 [2022-04-27 15:25:49,525 INFO L226 Difference]: Without dead ends: 180 [2022-04-27 15:25:49,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:49,527 INFO L413 NwaCegarLoop]: 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-27 15:25:49,528 INFO L414 NwaCegarLoop]: 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-27 15:25:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-27 15:25:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2022-04-27 15:25:49,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:49,537 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-27 15:25:49,537 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-27 15:25:49,538 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-27 15:25:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:49,543 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-27 15:25:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-27 15:25:49,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:49,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:49,544 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-27 15:25:49,544 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-27 15:25:49,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:49,549 INFO L93 Difference]: Finished difference Result 180 states and 268 transitions. [2022-04-27 15:25:49,550 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 268 transitions. [2022-04-27 15:25:49,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:49,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:49,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:49,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:49,551 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-27 15:25:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 248 transitions. [2022-04-27 15:25:49,555 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 248 transitions. Word has length 66 [2022-04-27 15:25:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:49,555 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 248 transitions. [2022-04-27 15:25:49,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 248 transitions. [2022-04-27 15:25:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:49,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:49,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:49,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:25:49,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:49,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1865763346, now seen corresponding path program 1 times [2022-04-27 15:25:49,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:49,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091967208] [2022-04-27 15:25:49,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:49,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:49,718 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:49,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-27 15:25:49,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3204#true} {3204#true} #662#return; {3204#true} is VALID [2022-04-27 15:25:49,720 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-27 15:25:49,720 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:49,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {3204#true} assume true; {3204#true} is VALID [2022-04-27 15:25:49,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3204#true} {3204#true} #662#return; {3204#true} is VALID [2022-04-27 15:25:49,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {3204#true} call #t~ret161 := main(); {3204#true} is VALID [2022-04-27 15:25:49,721 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-27 15:25:49,721 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-27 15:25:49,721 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-27 15:25:49,726 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-27 15:25:49,727 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-27 15:25:49,728 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-27 15:25:49,729 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-27 15:25:49,729 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-27 15:25:49,730 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-27 15:25:49,739 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-27 15:25:49,740 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-27 15:25:49,741 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-27 15:25:49,741 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-27 15:25:49,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {3205#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {3205#false} is VALID [2022-04-27 15:25:49,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {3205#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {3205#false} is VALID [2022-04-27 15:25:49,742 INFO L290 TraceCheckUtils]: 20: Hoare triple {3205#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {3205#false} is VALID [2022-04-27 15:25:49,742 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-27 15:25:49,742 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-27 15:25:49,742 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-27 15:25:49,742 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-27 15:25:49,742 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-27 15:25:49,742 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-27 15:25:49,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {3205#false} ~skip~0 := 0; {3205#false} is VALID [2022-04-27 15:25:49,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2022-04-27 15:25:49,743 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-27 15:25:49,743 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-27 15:25:49,743 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-27 15:25:49,743 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-27 15:25:49,743 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-27 15:25:49,743 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-27 15:25:49,743 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-27 15:25:49,744 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-27 15:25:49,744 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-27 15:25:49,744 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-27 15:25:49,744 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-27 15:25:49,744 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-27 15:25:49,744 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-27 15:25:49,744 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-27 15:25:49,744 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-27 15:25:49,745 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-27 15:25:49,745 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-27 15:25:49,745 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-27 15:25:49,745 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-27 15:25:49,745 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-27 15:25:49,745 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-27 15:25:49,745 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-27 15:25:49,745 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-27 15:25:49,746 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-27 15:25:49,746 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-27 15:25:49,746 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-27 15:25:49,746 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-27 15:25:49,746 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-27 15:25:49,746 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-27 15:25:49,746 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-27 15:25:49,746 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-27 15:25:49,747 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-27 15:25:49,747 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-27 15:25:49,747 INFO L290 TraceCheckUtils]: 62: Hoare triple {3205#false} assume 8672 == #t~mem79;havoc #t~mem79; {3205#false} is VALID [2022-04-27 15:25:49,747 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-27 15:25:49,747 INFO L290 TraceCheckUtils]: 64: Hoare triple {3205#false} assume 3 == ~blastFlag~0; {3205#false} is VALID [2022-04-27 15:25:49,747 INFO L290 TraceCheckUtils]: 65: Hoare triple {3205#false} assume !false; {3205#false} is VALID [2022-04-27 15:25:49,748 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-27 15:25:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:49,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091967208] [2022-04-27 15:25:49,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091967208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:49,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:49,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:49,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020970405] [2022-04-27 15:25:49,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:49,749 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-27 15:25:49,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:49,749 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-27 15:25:49,803 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-27 15:25:49,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:49,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:49,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:49,804 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-27 15:25:51,825 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-27 15:25:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:52,855 INFO L93 Difference]: Finished difference Result 318 states and 480 transitions. [2022-04-27 15:25:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:52,855 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-27 15:25:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:52,855 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-27 15:25:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-27 15:25:52,859 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-27 15:25:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2022-04-27 15:25:52,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 428 transitions. [2022-04-27 15:25:53,164 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-27 15:25:53,166 INFO L225 Difference]: With dead ends: 318 [2022-04-27 15:25:53,166 INFO L226 Difference]: Without dead ends: 180 [2022-04-27 15:25:53,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:53,168 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:25:53,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:25:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-04-27 15:25:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2022-04-27 15:25:53,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:53,178 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-27 15:25:53,178 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-27 15:25:53,179 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-27 15:25:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:53,184 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2022-04-27 15:25:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 267 transitions. [2022-04-27 15:25:53,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:53,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:53,185 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-27 15:25:53,185 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-27 15:25:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:53,193 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2022-04-27 15:25:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 267 transitions. [2022-04-27 15:25:53,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:53,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:53,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:53,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:53,195 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-27 15:25:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2022-04-27 15:25:53,199 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 66 [2022-04-27 15:25:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:53,199 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2022-04-27 15:25:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2022-04-27 15:25:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:53,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:53,200 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:53,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:25:53,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash -354488375, now seen corresponding path program 1 times [2022-04-27 15:25:53,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:53,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425883832] [2022-04-27 15:25:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:53,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:53,355 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:53,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {4151#true} assume true; {4151#true} is VALID [2022-04-27 15:25:53,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4151#true} {4151#true} #662#return; {4151#true} is VALID [2022-04-27 15:25:53,356 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-27 15:25:53,357 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:53,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {4151#true} assume true; {4151#true} is VALID [2022-04-27 15:25:53,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4151#true} {4151#true} #662#return; {4151#true} is VALID [2022-04-27 15:25:53,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {4151#true} call #t~ret161 := main(); {4151#true} is VALID [2022-04-27 15:25:53,358 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-27 15:25:53,358 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-27 15:25:53,358 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-27 15:25:53,360 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-27 15:25:53,360 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-27 15:25:53,361 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-27 15:25:53,363 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-27 15:25:53,363 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-27 15:25:53,363 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-27 15:25:53,364 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-27 15:25:53,364 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-27 15:25:53,365 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-27 15:25:53,365 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-27 15:25:53,366 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-27 15:25:53,366 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-27 15:25:53,367 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-27 15:25:53,367 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-27 15:25:53,368 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-27 15:25:53,368 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-27 15:25:53,368 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-27 15:25:53,368 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-27 15:25:53,368 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-27 15:25:53,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {4152#false} ~skip~0 := 0; {4152#false} is VALID [2022-04-27 15:25:53,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {4152#false} assume !false; {4152#false} is VALID [2022-04-27 15:25:53,368 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-27 15:25:53,368 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-27 15:25:53,369 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-27 15:25:53,369 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-27 15:25:53,369 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-27 15:25:53,369 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-27 15:25:53,369 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-27 15:25:53,370 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-27 15:25:53,370 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-27 15:25:53,371 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-27 15:25:53,371 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-27 15:25:53,371 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-27 15:25:53,371 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-27 15:25:53,372 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-27 15:25:53,372 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-27 15:25:53,372 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-27 15:25:53,372 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-27 15:25:53,372 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,373 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-27 15:25:53,374 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-27 15:25:53,374 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-27 15:25:53,374 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-27 15:25:53,374 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-27 15:25:53,374 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-27 15:25:53,374 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-27 15:25:53,374 INFO L290 TraceCheckUtils]: 62: Hoare triple {4152#false} assume 8672 == #t~mem79;havoc #t~mem79; {4152#false} is VALID [2022-04-27 15:25:53,374 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-27 15:25:53,374 INFO L290 TraceCheckUtils]: 64: Hoare triple {4152#false} assume 3 == ~blastFlag~0; {4152#false} is VALID [2022-04-27 15:25:53,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {4152#false} assume !false; {4152#false} is VALID [2022-04-27 15:25:53,376 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-27 15:25:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:53,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425883832] [2022-04-27 15:25:53,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425883832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:53,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:53,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187190558] [2022-04-27 15:25:53,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:53,378 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-27 15:25:53,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:53,379 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-27 15:25:53,432 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-27 15:25:53,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:53,433 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-27 15:25:55,471 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-27 15:25:56,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:56,791 INFO L93 Difference]: Finished difference Result 416 states and 635 transitions. [2022-04-27 15:25:56,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:25:56,792 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-27 15:25:56,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:25:56,792 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-27 15:25:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-27 15:25:56,797 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-27 15:25:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2022-04-27 15:25:56,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 567 transitions. [2022-04-27 15:25:57,195 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-27 15:25:57,201 INFO L225 Difference]: With dead ends: 416 [2022-04-27 15:25:57,201 INFO L226 Difference]: Without dead ends: 278 [2022-04-27 15:25:57,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:25:57,202 INFO L413 NwaCegarLoop]: 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-27 15:25:57,207 INFO L414 NwaCegarLoop]: 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-27 15:25:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-04-27 15:25:57,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 181. [2022-04-27 15:25:57,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:25:57,216 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-27 15:25:57,217 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-27 15:25:57,217 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-27 15:25:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:57,233 INFO L93 Difference]: Finished difference Result 278 states and 421 transitions. [2022-04-27 15:25:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 421 transitions. [2022-04-27 15:25:57,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:57,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:57,234 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-27 15:25:57,235 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-27 15:25:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:25:57,241 INFO L93 Difference]: Finished difference Result 278 states and 421 transitions. [2022-04-27 15:25:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 421 transitions. [2022-04-27 15:25:57,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:25:57,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:25:57,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:25:57,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:25:57,242 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-27 15:25:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 274 transitions. [2022-04-27 15:25:57,246 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 274 transitions. Word has length 66 [2022-04-27 15:25:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:25:57,246 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 274 transitions. [2022-04-27 15:25:57,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:25:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 274 transitions. [2022-04-27 15:25:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 15:25:57,247 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:25:57,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:25:57,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:25:57,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:25:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:25:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash 146163146, now seen corresponding path program 1 times [2022-04-27 15:25:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:25:57,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192552576] [2022-04-27 15:25:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:25:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:25:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:25:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:25:57,381 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:57,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {5430#true} assume true; {5430#true} is VALID [2022-04-27 15:25:57,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5430#true} {5430#true} #662#return; {5430#true} is VALID [2022-04-27 15:25:57,382 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-27 15:25:57,382 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:25:57,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {5430#true} assume true; {5430#true} is VALID [2022-04-27 15:25:57,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5430#true} {5430#true} #662#return; {5430#true} is VALID [2022-04-27 15:25:57,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {5430#true} call #t~ret161 := main(); {5430#true} is VALID [2022-04-27 15:25:57,383 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-27 15:25:57,383 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-27 15:25:57,383 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-27 15:25:57,386 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-27 15:25:57,387 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-27 15:25:57,387 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-27 15:25:57,388 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-27 15:25:57,388 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-27 15:25:57,389 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-27 15:25:57,392 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-27 15:25:57,392 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-27 15:25:57,393 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-27 15:25:57,393 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-27 15:25:57,394 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-27 15:25:57,394 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-27 15:25:57,395 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-27 15:25:57,395 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-27 15:25:57,395 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-27 15:25:57,396 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-27 15:25:57,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {5431#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {5431#false} is VALID [2022-04-27 15:25:57,396 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-27 15:25:57,396 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-27 15:25:57,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {5431#false} ~skip~0 := 0; {5431#false} is VALID [2022-04-27 15:25:57,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,397 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,398 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-27 15:25:57,399 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-27 15:25:57,399 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-27 15:25:57,399 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-27 15:25:57,399 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-27 15:25:57,399 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-27 15:25:57,411 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-27 15:25:57,411 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-27 15:25:57,411 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-27 15:25:57,411 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-27 15:25:57,411 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-27 15:25:57,411 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-27 15:25:57,411 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-27 15:25:57,411 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-27 15:25:57,412 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-27 15:25:57,412 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-27 15:25:57,412 INFO L290 TraceCheckUtils]: 62: Hoare triple {5431#false} assume 8672 == #t~mem79;havoc #t~mem79; {5431#false} is VALID [2022-04-27 15:25:57,412 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-27 15:25:57,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {5431#false} assume 3 == ~blastFlag~0; {5431#false} is VALID [2022-04-27 15:25:57,412 INFO L290 TraceCheckUtils]: 65: Hoare triple {5431#false} assume !false; {5431#false} is VALID [2022-04-27 15:25:57,412 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-27 15:25:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:25:57,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192552576] [2022-04-27 15:25:57,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192552576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:25:57,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:25:57,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:25:57,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544474848] [2022-04-27 15:25:57,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:25:57,414 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-27 15:25:57,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:25:57,414 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-27 15:25:57,467 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-27 15:25:57,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:25:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:25:57,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:25:57,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:25:57,472 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-27 15:26:02,040 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-27 15:26:04,061 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-27 15:26:06,085 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-27 15:26:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:07,077 INFO L93 Difference]: Finished difference Result 349 states and 531 transitions. [2022-04-27 15:26:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:07,078 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-27 15:26:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:07,078 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-27 15:26:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-27 15:26:07,081 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-27 15:26:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2022-04-27 15:26:07,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 423 transitions. [2022-04-27 15:26:07,423 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-27 15:26:07,426 INFO L225 Difference]: With dead ends: 349 [2022-04-27 15:26:07,426 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 15:26:07,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:07,427 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:07,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 461 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 343 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-04-27 15:26:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 15:26:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-27 15:26:07,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:07,435 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-27 15:26:07,435 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-27 15:26:07,436 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-27 15:26:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:07,440 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2022-04-27 15:26:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-04-27 15:26:07,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:07,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:07,441 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-27 15:26:07,442 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-27 15:26:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:07,446 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2022-04-27 15:26:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2022-04-27 15:26:07,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:07,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:07,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:07,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:07,447 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-27 15:26:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 273 transitions. [2022-04-27 15:26:07,450 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 273 transitions. Word has length 66 [2022-04-27 15:26:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:07,450 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 273 transitions. [2022-04-27 15:26:07,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 273 transitions. [2022-04-27 15:26:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 15:26:07,451 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:07,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:07,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:26:07,452 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash -674199881, now seen corresponding path program 1 times [2022-04-27 15:26:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:07,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304298621] [2022-04-27 15:26:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:07,575 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:07,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {6457#true} assume true; {6457#true} is VALID [2022-04-27 15:26:07,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6457#true} {6457#true} #662#return; {6457#true} is VALID [2022-04-27 15:26:07,576 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-27 15:26:07,576 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:07,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {6457#true} assume true; {6457#true} is VALID [2022-04-27 15:26:07,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6457#true} {6457#true} #662#return; {6457#true} is VALID [2022-04-27 15:26:07,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {6457#true} call #t~ret161 := main(); {6457#true} is VALID [2022-04-27 15:26:07,577 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-27 15:26:07,577 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-27 15:26:07,577 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-27 15:26:07,579 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-27 15:26:07,580 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-27 15:26:07,580 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-27 15:26:07,581 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-27 15:26:07,581 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-27 15:26:07,582 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-27 15:26:07,582 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-27 15:26:07,583 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-27 15:26:07,583 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-27 15:26:07,583 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-27 15:26:07,584 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-27 15:26:07,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {6458#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {6458#false} is VALID [2022-04-27 15:26:07,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {6458#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {6458#false} is VALID [2022-04-27 15:26:07,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {6458#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {6458#false} is VALID [2022-04-27 15:26:07,584 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-27 15:26:07,584 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-27 15:26:07,585 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-27 15:26:07,585 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-27 15:26:07,585 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-27 15:26:07,585 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-27 15:26:07,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {6458#false} ~skip~0 := 0; {6458#false} is VALID [2022-04-27 15:26:07,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {6458#false} assume !false; {6458#false} is VALID [2022-04-27 15:26:07,585 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-27 15:26:07,585 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-27 15:26:07,585 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-27 15:26:07,585 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,586 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,587 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-27 15:26:07,588 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-27 15:26:07,588 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-27 15:26:07,588 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-27 15:26:07,588 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-27 15:26:07,588 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-27 15:26:07,588 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-27 15:26:07,588 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-27 15:26:07,588 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-27 15:26:07,588 INFO L290 TraceCheckUtils]: 63: Hoare triple {6458#false} assume 8672 == #t~mem79;havoc #t~mem79; {6458#false} is VALID [2022-04-27 15:26:07,589 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-27 15:26:07,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {6458#false} assume 3 == ~blastFlag~0; {6458#false} is VALID [2022-04-27 15:26:07,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {6458#false} assume !false; {6458#false} is VALID [2022-04-27 15:26:07,589 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-27 15:26:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:07,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304298621] [2022-04-27 15:26:07,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304298621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:07,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:07,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873110066] [2022-04-27 15:26:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:07,590 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-27 15:26:07,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:07,591 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-27 15:26:07,676 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-27 15:26:07,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:07,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:07,677 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-27 15:26:09,703 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-27 15:26:10,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:10,671 INFO L93 Difference]: Finished difference Result 349 states and 530 transitions. [2022-04-27 15:26:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:10,671 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-27 15:26:10,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:10,672 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-27 15:26:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-27 15:26:10,675 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-27 15:26:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 422 transitions. [2022-04-27 15:26:10,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 422 transitions. [2022-04-27 15:26:11,023 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-27 15:26:11,026 INFO L225 Difference]: With dead ends: 349 [2022-04-27 15:26:11,026 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 15:26:11,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:11,027 INFO L413 NwaCegarLoop]: 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-27 15:26:11,028 INFO L414 NwaCegarLoop]: 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-27 15:26:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 15:26:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-27 15:26:11,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:11,034 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-27 15:26:11,034 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-27 15:26:11,034 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-27 15:26:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:11,046 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2022-04-27 15:26:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-04-27 15:26:11,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:11,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:11,049 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-27 15:26:11,049 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-27 15:26:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:11,053 INFO L93 Difference]: Finished difference Result 194 states and 289 transitions. [2022-04-27 15:26:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2022-04-27 15:26:11,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:11,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:11,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:11,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:11,055 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-27 15:26:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2022-04-27 15:26:11,058 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 67 [2022-04-27 15:26:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:11,058 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2022-04-27 15:26:11,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2022-04-27 15:26:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-27 15:26:11,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:11,060 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:11,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:26:11,060 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:11,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2142445385, now seen corresponding path program 1 times [2022-04-27 15:26:11,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:11,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371883831] [2022-04-27 15:26:11,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:11,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:11,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:11,211 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:11,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {7484#true} assume true; {7484#true} is VALID [2022-04-27 15:26:11,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7484#true} {7484#true} #662#return; {7484#true} is VALID [2022-04-27 15:26:11,213 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-27 15:26:11,213 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:11,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {7484#true} assume true; {7484#true} is VALID [2022-04-27 15:26:11,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7484#true} {7484#true} #662#return; {7484#true} is VALID [2022-04-27 15:26:11,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {7484#true} call #t~ret161 := main(); {7484#true} is VALID [2022-04-27 15:26:11,213 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-27 15:26:11,213 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-27 15:26:11,213 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-27 15:26:11,215 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-27 15:26:11,216 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-27 15:26:11,217 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-27 15:26:11,217 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-27 15:26:11,218 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-27 15:26:11,218 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-27 15:26:11,219 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-27 15:26:11,219 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-27 15:26:11,219 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-27 15:26:11,220 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-27 15:26:11,220 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-27 15:26:11,221 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-27 15:26:11,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {7485#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {7485#false} is VALID [2022-04-27 15:26:11,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {7485#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7485#false} is VALID [2022-04-27 15:26:11,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {7485#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {7485#false} is VALID [2022-04-27 15:26:11,222 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-27 15:26:11,224 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-27 15:26:11,224 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-27 15:26:11,225 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-27 15:26:11,225 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-27 15:26:11,225 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-27 15:26:11,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {7485#false} ~skip~0 := 0; {7485#false} is VALID [2022-04-27 15:26:11,226 INFO L290 TraceCheckUtils]: 30: Hoare triple {7485#false} assume !false; {7485#false} is VALID [2022-04-27 15:26:11,227 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-27 15:26:11,227 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-27 15:26:11,227 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-27 15:26:11,227 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-27 15:26:11,227 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-27 15:26:11,227 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-27 15:26:11,228 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-27 15:26:11,228 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-27 15:26:11,230 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,231 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,232 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-27 15:26:11,233 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-27 15:26:11,233 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-27 15:26:11,233 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-27 15:26:11,233 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-27 15:26:11,233 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-27 15:26:11,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {7485#false} assume 8672 == #t~mem79;havoc #t~mem79; {7485#false} is VALID [2022-04-27 15:26:11,233 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-27 15:26:11,233 INFO L290 TraceCheckUtils]: 66: Hoare triple {7485#false} assume 3 == ~blastFlag~0; {7485#false} is VALID [2022-04-27 15:26:11,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {7485#false} assume !false; {7485#false} is VALID [2022-04-27 15:26:11,235 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-27 15:26:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:11,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371883831] [2022-04-27 15:26:11,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371883831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:11,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:11,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539474549] [2022-04-27 15:26:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:11,236 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-27 15:26:11,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:11,237 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-27 15:26:11,293 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-27 15:26:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:11,295 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-27 15:26:13,323 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-27 15:26:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:14,353 INFO L93 Difference]: Finished difference Result 349 states and 529 transitions. [2022-04-27 15:26:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:14,354 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-27 15:26:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:14,354 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-27 15:26:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-27 15:26:14,358 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-27 15:26:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2022-04-27 15:26:14,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 421 transitions. [2022-04-27 15:26:14,707 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-27 15:26:14,710 INFO L225 Difference]: With dead ends: 349 [2022-04-27 15:26:14,710 INFO L226 Difference]: Without dead ends: 194 [2022-04-27 15:26:14,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:14,711 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:14,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:26:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-27 15:26:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2022-04-27 15:26:14,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:14,717 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-27 15:26:14,718 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-27 15:26:14,718 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-27 15:26:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:14,723 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2022-04-27 15:26:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-04-27 15:26:14,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:14,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:14,724 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-27 15:26:14,725 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-27 15:26:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:14,729 INFO L93 Difference]: Finished difference Result 194 states and 288 transitions. [2022-04-27 15:26:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2022-04-27 15:26:14,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:14,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:14,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:14,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:14,730 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-27 15:26:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2022-04-27 15:26:14,733 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 68 [2022-04-27 15:26:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:14,734 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2022-04-27 15:26:14,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2022-04-27 15:26:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 15:26:14,735 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:14,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:26:14,735 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:14,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:14,735 INFO L85 PathProgramCache]: Analyzing trace with hash -452212548, now seen corresponding path program 1 times [2022-04-27 15:26:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146412973] [2022-04-27 15:26:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:14,855 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:14,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {8511#true} assume true; {8511#true} is VALID [2022-04-27 15:26:14,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8511#true} {8511#true} #662#return; {8511#true} is VALID [2022-04-27 15:26:14,856 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-27 15:26:14,856 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:14,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {8511#true} assume true; {8511#true} is VALID [2022-04-27 15:26:14,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8511#true} {8511#true} #662#return; {8511#true} is VALID [2022-04-27 15:26:14,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {8511#true} call #t~ret161 := main(); {8511#true} is VALID [2022-04-27 15:26:14,857 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-27 15:26:14,857 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-27 15:26:14,857 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-27 15:26:14,859 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-27 15:26:14,859 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-27 15:26:14,860 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-27 15:26:14,861 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-27 15:26:14,861 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-27 15:26:14,862 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-27 15:26:14,862 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-27 15:26:14,862 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-27 15:26:14,863 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-27 15:26:14,863 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-27 15:26:14,864 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-27 15:26:14,864 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-27 15:26:14,864 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-27 15:26:14,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {8512#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {8512#false} is VALID [2022-04-27 15:26:14,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {8512#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {8512#false} is VALID [2022-04-27 15:26:14,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {8512#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {8512#false} is VALID [2022-04-27 15:26:14,865 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-27 15:26:14,865 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-27 15:26:14,865 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-27 15:26:14,865 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-27 15:26:14,865 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-27 15:26:14,865 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-27 15:26:14,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {8512#false} ~skip~0 := 0; {8512#false} is VALID [2022-04-27 15:26:14,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {8512#false} assume !false; {8512#false} is VALID [2022-04-27 15:26:14,865 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,866 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,867 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-27 15:26:14,868 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-27 15:26:14,868 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-27 15:26:14,868 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-27 15:26:14,868 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-27 15:26:14,868 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-27 15:26:14,868 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-27 15:26:14,868 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-27 15:26:14,868 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-27 15:26:14,868 INFO L290 TraceCheckUtils]: 65: Hoare triple {8512#false} assume 8672 == #t~mem79;havoc #t~mem79; {8512#false} is VALID [2022-04-27 15:26:14,868 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-27 15:26:14,868 INFO L290 TraceCheckUtils]: 67: Hoare triple {8512#false} assume 3 == ~blastFlag~0; {8512#false} is VALID [2022-04-27 15:26:14,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {8512#false} assume !false; {8512#false} is VALID [2022-04-27 15:26:14,869 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-27 15:26:14,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:14,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146412973] [2022-04-27 15:26:14,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146412973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:14,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:14,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279834753] [2022-04-27 15:26:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:14,870 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-27 15:26:14,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:14,870 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-27 15:26:14,933 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-27 15:26:14,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:14,935 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-27 15:26:16,961 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-27 15:26:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:17,806 INFO L93 Difference]: Finished difference Result 339 states and 515 transitions. [2022-04-27 15:26:17,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:17,806 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-27 15:26:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:17,806 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-27 15:26:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-27 15:26:17,809 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-27 15:26:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 407 transitions. [2022-04-27 15:26:17,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 407 transitions. [2022-04-27 15:26:18,137 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-27 15:26:18,140 INFO L225 Difference]: With dead ends: 339 [2022-04-27 15:26:18,140 INFO L226 Difference]: Without dead ends: 184 [2022-04-27 15:26:18,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:18,141 INFO L413 NwaCegarLoop]: 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-27 15:26:18,141 INFO L414 NwaCegarLoop]: 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-27 15:26:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-27 15:26:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-04-27 15:26:18,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:18,145 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-27 15:26:18,146 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-27 15:26:18,146 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-27 15:26:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:18,149 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-27 15:26:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2022-04-27 15:26:18,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:18,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:18,150 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-27 15:26:18,151 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-27 15:26:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:18,155 INFO L93 Difference]: Finished difference Result 184 states and 274 transitions. [2022-04-27 15:26:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 274 transitions. [2022-04-27 15:26:18,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:18,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:18,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:18,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:18,157 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-27 15:26:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 270 transitions. [2022-04-27 15:26:18,160 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 270 transitions. Word has length 69 [2022-04-27 15:26:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:18,160 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 270 transitions. [2022-04-27 15:26:18,161 INFO L496 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-27 15:26:18,161 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 270 transitions. [2022-04-27 15:26:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-27 15:26:18,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:18,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:18,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:26:18,162 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:18,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1752801627, now seen corresponding path program 1 times [2022-04-27 15:26:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:18,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037477636] [2022-04-27 15:26:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:18,322 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:18,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-04-27 15:26:18,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9507#true} {9507#true} #662#return; {9507#true} is VALID [2022-04-27 15:26:18,323 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-27 15:26:18,323 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:18,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {9507#true} assume true; {9507#true} is VALID [2022-04-27 15:26:18,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9507#true} {9507#true} #662#return; {9507#true} is VALID [2022-04-27 15:26:18,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {9507#true} call #t~ret161 := main(); {9507#true} is VALID [2022-04-27 15:26:18,323 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-27 15:26:18,323 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-27 15:26:18,324 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-27 15:26:18,325 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-27 15:26:18,326 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-27 15:26:18,327 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-27 15:26:18,327 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-27 15:26:18,327 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-27 15:26:18,327 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-27 15:26:18,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {9507#true} assume !false; {9507#true} is VALID [2022-04-27 15:26:18,327 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-27 15:26:18,327 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-27 15:26:18,327 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-27 15:26:18,327 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-27 15:26:18,327 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-27 15:26:18,328 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-27 15:26:18,328 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-27 15:26:18,328 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-27 15:26:18,328 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-27 15:26:18,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {9507#true} assume 8464 == #t~mem55;havoc #t~mem55; {9507#true} is VALID [2022-04-27 15:26:18,328 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-27 15:26:18,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {9507#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9507#true} is VALID [2022-04-27 15:26:18,329 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-27 15:26:18,330 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-27 15:26:18,330 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-27 15:26:18,331 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-27 15:26:18,331 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-27 15:26:18,331 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-27 15:26:18,332 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-27 15:26:18,332 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-27 15:26:18,333 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-27 15:26:18,333 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-27 15:26:18,333 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-27 15:26:18,334 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-27 15:26:18,334 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-27 15:26:18,335 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-27 15:26:18,335 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-27 15:26:18,335 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-27 15:26:18,336 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-27 15:26:18,336 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-27 15:26:18,337 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-27 15:26:18,337 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-27 15:26:18,338 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-27 15:26:18,338 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-27 15:26:18,338 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-27 15:26:18,339 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-27 15:26:18,339 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-27 15:26:18,339 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-27 15:26:18,340 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-27 15:26:18,340 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-27 15:26:18,341 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-27 15:26:18,341 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-27 15:26:18,342 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-27 15:26:18,342 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-27 15:26:18,342 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-27 15:26:18,343 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-27 15:26:18,343 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-27 15:26:18,344 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-27 15:26:18,344 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-27 15:26:18,345 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-27 15:26:18,345 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-27 15:26:18,345 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-27 15:26:18,345 INFO L290 TraceCheckUtils]: 67: Hoare triple {9508#false} assume 3 == ~blastFlag~0; {9508#false} is VALID [2022-04-27 15:26:18,345 INFO L290 TraceCheckUtils]: 68: Hoare triple {9508#false} assume !false; {9508#false} is VALID [2022-04-27 15:26:18,346 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-27 15:26:18,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:18,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037477636] [2022-04-27 15:26:18,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037477636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:18,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:18,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:18,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236820048] [2022-04-27 15:26:18,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:18,347 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-27 15:26:18,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:18,348 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-27 15:26:18,416 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-27 15:26:18,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:18,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:18,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:18,417 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-27 15:26:21,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:23,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:25,892 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-27 15:26:27,913 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-27 15:26:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:29,048 INFO L93 Difference]: Finished difference Result 450 states and 684 transitions. [2022-04-27 15:26:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:29,049 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-27 15:26:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:29,049 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-27 15:26:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-27 15:26:29,053 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-27 15:26:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-04-27 15:26:29,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 566 transitions. [2022-04-27 15:26:29,503 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-27 15:26:29,509 INFO L225 Difference]: With dead ends: 450 [2022-04-27 15:26:29,509 INFO L226 Difference]: Without dead ends: 295 [2022-04-27 15:26:29,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:29,510 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 109 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 63 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:29,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 313 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 465 Invalid, 3 Unknown, 0 Unchecked, 7.9s Time] [2022-04-27 15:26:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-27 15:26:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 224. [2022-04-27 15:26:29,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:29,517 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-27 15:26:29,518 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-27 15:26:29,518 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-27 15:26:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:29,524 INFO L93 Difference]: Finished difference Result 295 states and 443 transitions. [2022-04-27 15:26:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 443 transitions. [2022-04-27 15:26:29,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:29,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:29,526 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-27 15:26:29,526 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-27 15:26:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:29,532 INFO L93 Difference]: Finished difference Result 295 states and 443 transitions. [2022-04-27 15:26:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 443 transitions. [2022-04-27 15:26:29,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:29,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:29,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:29,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:29,534 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-27 15:26:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 348 transitions. [2022-04-27 15:26:29,538 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 348 transitions. Word has length 69 [2022-04-27 15:26:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:29,539 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 348 transitions. [2022-04-27 15:26:29,539 INFO L496 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-27 15:26:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 348 transitions. [2022-04-27 15:26:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 15:26:29,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:29,540 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:29,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:26:29,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1490539961, now seen corresponding path program 1 times [2022-04-27 15:26:29,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:29,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265603145] [2022-04-27 15:26:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:29,714 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:29,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {10903#true} assume true; {10903#true} is VALID [2022-04-27 15:26:29,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10903#true} {10903#true} #662#return; {10903#true} is VALID [2022-04-27 15:26:29,718 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-27 15:26:29,719 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(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$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-27 15:26:29,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {10903#true} assume true; {10903#true} is VALID [2022-04-27 15:26:29,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10903#true} {10903#true} #662#return; {10903#true} is VALID [2022-04-27 15:26:29,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {10903#true} call #t~ret161 := main(); {10903#true} is VALID [2022-04-27 15:26:29,719 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-27 15:26:29,719 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-27 15:26:29,719 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-27 15:26:29,719 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-27 15:26:29,719 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-27 15:26:29,719 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-27 15:26:29,719 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {10903#true} assume !false; {10903#true} is VALID [2022-04-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,720 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-27 15:26:29,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {10903#true} assume 8464 == #t~mem55;havoc #t~mem55; {10903#true} is VALID [2022-04-27 15:26:29,721 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-27 15:26:29,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {10903#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {10903#true} is VALID [2022-04-27 15:26:29,722 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-27 15:26:29,722 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-27 15:26:29,723 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-27 15:26:29,723 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-27 15:26:29,723 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-27 15:26:29,724 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-27 15:26:29,724 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-27 15:26:29,725 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-27 15:26:29,725 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-27 15:26:29,725 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-27 15:26:29,726 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-27 15:26:29,726 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-27 15:26:29,727 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-27 15:26:29,727 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-27 15:26:29,727 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-27 15:26:29,728 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-27 15:26:29,728 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-27 15:26:29,728 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,729 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 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-27 15:26:29,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {10904#false} assume 8673 == #t~mem80;havoc #t~mem80; {10904#false} is VALID [2022-04-27 15:26:29,730 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-27 15:26:29,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {10904#false} assume 3 == ~blastFlag~0; {10904#false} is VALID [2022-04-27 15:26:29,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {10904#false} assume !false; {10904#false} is VALID [2022-04-27 15:26:29,731 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-27 15:26:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:29,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265603145] [2022-04-27 15:26:29,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265603145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:29,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:29,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900372166] [2022-04-27 15:26:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:29,732 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-27 15:26:29,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:29,732 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-27 15:26:29,783 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-27 15:26:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:29,784 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-27 15:26:31,807 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-27 15:26:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:32,742 INFO L93 Difference]: Finished difference Result 463 states and 728 transitions. [2022-04-27 15:26:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:32,743 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-27 15:26:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:32,743 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-27 15:26:32,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-27 15:26:32,746 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-27 15:26:32,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 453 transitions. [2022-04-27 15:26:32,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 453 transitions. [2022-04-27 15:26:33,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:26:33,055 INFO L225 Difference]: With dead ends: 463 [2022-04-27 15:26:33,055 INFO L226 Difference]: Without dead ends: 265 [2022-04-27 15:26:33,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:33,057 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 32 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 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-27 15:26:33,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 477 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-27 15:26:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-04-27 15:26:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 246. [2022-04-27 15:26:33,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:33,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 265 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-27 15:26:33,063 INFO L74 IsIncluded]: Start isIncluded. First operand 265 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-27 15:26:33,064 INFO L87 Difference]: Start difference. First operand 265 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-27 15:26:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:33,068 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2022-04-27 15:26:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 409 transitions. [2022-04-27 15:26:33,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:33,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:33,070 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 265 states. [2022-04-27 15:26:33,070 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 265 states. [2022-04-27 15:26:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:33,075 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2022-04-27 15:26:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 409 transitions. [2022-04-27 15:26:33,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:33,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:33,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:33,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:33,076 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-27 15:26:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 384 transitions. [2022-04-27 15:26:33,081 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 384 transitions. Word has length 70 [2022-04-27 15:26:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:33,081 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 384 transitions. [2022-04-27 15:26:33,081 INFO L496 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-27 15:26:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 384 transitions. [2022-04-27 15:26:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:26:33,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:33,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:33,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:26:33,083 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:33,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1233411814, now seen corresponding path program 1 times [2022-04-27 15:26:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:33,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526584952] [2022-04-27 15:26:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:33,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {12271#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12264#true} is VALID [2022-04-27 15:26:33,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {12264#true} assume true; {12264#true} is VALID [2022-04-27 15:26:33,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12264#true} {12264#true} #662#return; {12264#true} is VALID [2022-04-27 15:26:33,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {12264#true} call ULTIMATE.init(); {12271#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:33,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {12271#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {12264#true} is VALID [2022-04-27 15:26:33,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {12264#true} assume true; {12264#true} is VALID [2022-04-27 15:26:33,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12264#true} {12264#true} #662#return; {12264#true} is VALID [2022-04-27 15:26:33,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {12264#true} call #t~ret161 := main(); {12264#true} is VALID [2022-04-27 15:26:33,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {12264#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; {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {12264#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L272 TraceCheckUtils]: 7: Hoare triple {12264#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {12264#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); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {12264#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; {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {12264#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; {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {12264#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {12264#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {12264#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 14: Hoare triple {12264#true} assume !false; {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {12264#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {12264#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {12264#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {12264#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {12264#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {12264#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {12264#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {12264#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {12264#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {12264#true} assume 8464 == #t~mem55;havoc #t~mem55; {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {12264#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; {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {12264#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {12264#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); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 28: Hoare triple {12264#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); {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {12264#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {12264#true} is VALID [2022-04-27 15:26:33,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {12264#true} ~skip~0 := 0; {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {12264#true} assume !false; {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {12264#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {12264#true} assume 12292 == #t~mem47;havoc #t~mem47; {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {12264#true} call write~int(1, ~s.base, 40 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {12264#true} call write~int(1, ~s.base, 36 + ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 36: Hoare triple {12264#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 37: Hoare triple {12264#true} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 38: Hoare triple {12264#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); {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {12264#true} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {12264#true} is VALID [2022-04-27 15:26:33,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {12264#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); {12264#true} is VALID [2022-04-27 15:26:33,253 INFO L290 TraceCheckUtils]: 41: Hoare triple {12264#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); {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,253 INFO L290 TraceCheckUtils]: 42: Hoare triple {12269#(= 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); {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,253 INFO L290 TraceCheckUtils]: 43: Hoare triple {12269#(= 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; {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,254 INFO L290 TraceCheckUtils]: 46: Hoare triple {12269#(= 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); {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {12269#(= 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); {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,255 INFO L290 TraceCheckUtils]: 48: Hoare triple {12269#(= 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); {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {12269#(= 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); {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,256 INFO L290 TraceCheckUtils]: 50: Hoare triple {12269#(= 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); {12269#(= 8480 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:33,256 INFO L290 TraceCheckUtils]: 51: Hoare triple {12269#(= 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); {12270#(= |ssl3_accept_#t~mem52| 8480)} is VALID [2022-04-27 15:26:33,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {12270#(= |ssl3_accept_#t~mem52| 8480)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {12265#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,257 INFO L290 TraceCheckUtils]: 54: Hoare triple {12265#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,257 INFO L290 TraceCheckUtils]: 55: Hoare triple {12265#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,257 INFO L290 TraceCheckUtils]: 56: Hoare triple {12265#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,257 INFO L290 TraceCheckUtils]: 57: Hoare triple {12265#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {12265#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {12265#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 60: Hoare triple {12265#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {12265#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {12265#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {12265#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 64: Hoare triple {12265#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 65: Hoare triple {12265#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,265 INFO L290 TraceCheckUtils]: 66: Hoare triple {12265#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 67: Hoare triple {12265#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 68: Hoare triple {12265#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 69: Hoare triple {12265#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 70: Hoare triple {12265#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 71: Hoare triple {12265#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {12265#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 73: Hoare triple {12265#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {12265#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {12265#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {12265#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 77: Hoare triple {12265#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {12265#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {12265#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {12265#false} is VALID [2022-04-27 15:26:33,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {12265#false} assume 8673 == #t~mem80;havoc #t~mem80; {12265#false} is VALID [2022-04-27 15:26:33,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {12265#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {12265#false} is VALID [2022-04-27 15:26:33,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {12265#false} assume 3 == ~blastFlag~0; {12265#false} is VALID [2022-04-27 15:26:33,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {12265#false} assume !false; {12265#false} is VALID [2022-04-27 15:26:33,267 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-27 15:26:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:33,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526584952] [2022-04-27 15:26:33,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526584952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:33,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:33,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244701985] [2022-04-27 15:26:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:33,268 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-27 15:26:33,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:33,269 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-27 15:26:33,341 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-27 15:26:33,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:33,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:33,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:33,342 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-27 15:26:35,367 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-27 15:26:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:36,398 INFO L93 Difference]: Finished difference Result 479 states and 754 transitions. [2022-04-27 15:26:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:36,398 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-27 15:26:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:36,399 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-27 15:26:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-27 15:26:36,402 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-27 15:26:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2022-04-27 15:26:36,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 434 transitions. [2022-04-27 15:26:36,744 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-27 15:26:36,749 INFO L225 Difference]: With dead ends: 479 [2022-04-27 15:26:36,749 INFO L226 Difference]: Without dead ends: 259 [2022-04-27 15:26:36,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:36,750 INFO L413 NwaCegarLoop]: 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-27 15:26:36,751 INFO L414 NwaCegarLoop]: 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-27 15:26:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-04-27 15:26:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 246. [2022-04-27 15:26:36,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:36,759 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-27 15:26:36,760 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-27 15:26:36,760 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-27 15:26:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:36,765 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2022-04-27 15:26:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 399 transitions. [2022-04-27 15:26:36,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:36,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:36,766 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-27 15:26:36,767 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-27 15:26:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:36,772 INFO L93 Difference]: Finished difference Result 259 states and 399 transitions. [2022-04-27 15:26:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 399 transitions. [2022-04-27 15:26:36,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:36,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:36,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:36,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:36,774 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-27 15:26:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 383 transitions. [2022-04-27 15:26:36,794 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 383 transitions. Word has length 84 [2022-04-27 15:26:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:36,794 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 383 transitions. [2022-04-27 15:26:36,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 383 transitions. [2022-04-27 15:26:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-27 15:26:36,795 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:36,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:36,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:26:36,796 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1502086990, now seen corresponding path program 1 times [2022-04-27 15:26:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:36,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212050611] [2022-04-27 15:26:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:36,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:36,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:36,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {13636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13629#true} is VALID [2022-04-27 15:26:36,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {13629#true} assume true; {13629#true} is VALID [2022-04-27 15:26:36,927 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13629#true} {13629#true} #662#return; {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {13629#true} call ULTIMATE.init(); {13636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:36,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {13636#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {13629#true} assume true; {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13629#true} {13629#true} #662#return; {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {13629#true} call #t~ret161 := main(); {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {13629#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; {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {13629#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L272 TraceCheckUtils]: 7: Hoare triple {13629#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {13629#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); {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {13629#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; {13629#true} is VALID [2022-04-27 15:26:36,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {13629#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; {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {13629#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {13629#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {13629#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {13629#true} assume !false; {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {13629#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {13629#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {13629#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {13629#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {13629#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {13629#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {13629#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {13629#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {13629#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13629#true} is VALID [2022-04-27 15:26:36,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {13629#true} assume 8464 == #t~mem55;havoc #t~mem55; {13629#true} is VALID [2022-04-27 15:26:36,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {13629#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; {13629#true} is VALID [2022-04-27 15:26:36,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {13629#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13629#true} is VALID [2022-04-27 15:26:36,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {13629#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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {13634#(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; {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,933 INFO L290 TraceCheckUtils]: 32: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,934 INFO L290 TraceCheckUtils]: 35: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,934 INFO L290 TraceCheckUtils]: 36: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {13634#(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); {13634#(not (= 8482 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {13634#(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); {13635#(not (= |ssl3_accept_#t~mem54| 8482))} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {13635#(not (= |ssl3_accept_#t~mem54| 8482))} assume 8482 == #t~mem54;havoc #t~mem54; {13630#false} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {13630#false} call write~int(3, ~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {13630#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); {13630#false} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 43: Hoare triple {13630#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {13630#false} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 44: Hoare triple {13630#false} ~skip~0 := 0; {13630#false} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {13630#false} assume !false; {13630#false} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 46: Hoare triple {13630#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); {13630#false} is VALID [2022-04-27 15:26:36,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {13630#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 48: Hoare triple {13630#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {13630#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {13630#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {13630#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {13630#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {13630#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {13630#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {13630#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {13630#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 57: Hoare triple {13630#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 58: Hoare triple {13630#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {13630#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {13630#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {13630#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {13630#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {13630#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {13630#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 65: Hoare triple {13630#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {13630#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {13630#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {13630#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 69: Hoare triple {13630#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 70: Hoare triple {13630#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,938 INFO L290 TraceCheckUtils]: 71: Hoare triple {13630#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 72: Hoare triple {13630#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 73: Hoare triple {13630#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 74: Hoare triple {13630#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 75: Hoare triple {13630#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 76: Hoare triple {13630#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 77: Hoare triple {13630#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 78: Hoare triple {13630#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 79: Hoare triple {13630#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 80: Hoare triple {13630#false} assume 8673 == #t~mem80;havoc #t~mem80; {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 81: Hoare triple {13630#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {13630#false} is VALID [2022-04-27 15:26:36,939 INFO L290 TraceCheckUtils]: 82: Hoare triple {13630#false} assume 3 == ~blastFlag~0; {13630#false} is VALID [2022-04-27 15:26:36,940 INFO L290 TraceCheckUtils]: 83: Hoare triple {13630#false} assume !false; {13630#false} is VALID [2022-04-27 15:26:36,940 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-27 15:26:36,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:36,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212050611] [2022-04-27 15:26:36,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212050611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:36,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:36,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095851890] [2022-04-27 15:26:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:36,941 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-27 15:26:36,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:36,945 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-27 15:26:37,012 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-27 15:26:37,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:37,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:37,013 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-27 15:26:39,037 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-27 15:26:40,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:40,156 INFO L93 Difference]: Finished difference Result 562 states and 882 transitions. [2022-04-27 15:26:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:40,157 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-27 15:26:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:40,157 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-27 15:26:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-27 15:26:40,160 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-27 15:26:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2022-04-27 15:26:40,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 565 transitions. [2022-04-27 15:26:40,575 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-27 15:26:40,582 INFO L225 Difference]: With dead ends: 562 [2022-04-27 15:26:40,582 INFO L226 Difference]: Without dead ends: 342 [2022-04-27 15:26:40,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:40,583 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 135 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-27 15:26:40,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:26:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-04-27 15:26:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 247. [2022-04-27 15:26:40,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:40,589 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-27 15:26:40,590 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-27 15:26:40,590 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-27 15:26:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:40,597 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2022-04-27 15:26:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 526 transitions. [2022-04-27 15:26:40,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:40,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:40,598 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-27 15:26:40,599 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-27 15:26:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:40,606 INFO L93 Difference]: Finished difference Result 342 states and 526 transitions. [2022-04-27 15:26:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 526 transitions. [2022-04-27 15:26:40,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:40,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:40,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:40,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:40,607 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-27 15:26:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 382 transitions. [2022-04-27 15:26:40,612 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 382 transitions. Word has length 84 [2022-04-27 15:26:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:40,612 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 382 transitions. [2022-04-27 15:26:40,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 382 transitions. [2022-04-27 15:26:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 15:26:40,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:40,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:40,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:26:40,614 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1487677531, now seen corresponding path program 1 times [2022-04-27 15:26:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:40,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546602177] [2022-04-27 15:26:40,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:40,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:40,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:40,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {15269#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15261#true} is VALID [2022-04-27 15:26:40,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {15261#true} assume true; {15261#true} is VALID [2022-04-27 15:26:40,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15261#true} {15261#true} #662#return; {15261#true} is VALID [2022-04-27 15:26:40,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {15261#true} call ULTIMATE.init(); {15269#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:40,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {15269#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {15261#true} is VALID [2022-04-27 15:26:40,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {15261#true} assume true; {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15261#true} {15261#true} #662#return; {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {15261#true} call #t~ret161 := main(); {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {15261#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; {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {15261#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L272 TraceCheckUtils]: 7: Hoare triple {15261#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {15261#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); {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {15261#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; {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {15261#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; {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {15261#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {15261#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {15261#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {15261#true} assume !false; {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {15261#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {15261#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {15261#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {15261#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {15261#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {15261#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {15261#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {15261#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {15261#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15261#true} is VALID [2022-04-27 15:26:40,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {15261#true} assume 8464 == #t~mem55;havoc #t~mem55; {15261#true} is VALID [2022-04-27 15:26:40,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {15261#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; {15261#true} is VALID [2022-04-27 15:26:40,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {15261#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15261#true} is VALID [2022-04-27 15:26:40,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {15261#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); {15261#true} is VALID [2022-04-27 15:26:40,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {15261#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); {15261#true} is VALID [2022-04-27 15:26:40,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {15261#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15261#true} is VALID [2022-04-27 15:26:40,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {15261#true} ~skip~0 := 0; {15261#true} is VALID [2022-04-27 15:26:40,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {15261#true} assume !false; {15261#true} is VALID [2022-04-27 15:26:40,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {15261#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15266#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {15266#(= |ssl3_accept_#t~mem47| (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 12292 == #t~mem47;havoc #t~mem47; {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 40 + ~s.offset, 4); {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(1, ~s.base, 36 + ~s.offset, 4); {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {15267#(= 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); {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {15267#(= 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; {15267#(= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:40,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {15267#(= 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); {15268#(= 12292 |ssl3_accept_#t~mem85|)} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {15268#(= 12292 |ssl3_accept_#t~mem85|)} assume 12292 != #t~mem85;havoc #t~mem85; {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {15262#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; {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {15262#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); {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {15262#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {15262#false} ~skip~0 := 0; {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {15262#false} assume !false; {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {15262#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); {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {15262#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {15262#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {15262#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {15262#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {15262#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {15262#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {15262#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {15262#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {15262#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {15262#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {15262#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {15262#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {15262#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {15262#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {15262#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {15262#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {15262#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {15262#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {15262#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {15262#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {15262#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 69: Hoare triple {15262#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 70: Hoare triple {15262#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 71: Hoare triple {15262#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 72: Hoare triple {15262#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 73: Hoare triple {15262#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 74: Hoare triple {15262#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,770 INFO L290 TraceCheckUtils]: 75: Hoare triple {15262#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 76: Hoare triple {15262#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 77: Hoare triple {15262#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 78: Hoare triple {15262#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 79: Hoare triple {15262#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 80: Hoare triple {15262#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 81: Hoare triple {15262#false} assume 8673 == #t~mem80;havoc #t~mem80; {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 82: Hoare triple {15262#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 83: Hoare triple {15262#false} assume 3 == ~blastFlag~0; {15262#false} is VALID [2022-04-27 15:26:40,771 INFO L290 TraceCheckUtils]: 84: Hoare triple {15262#false} assume !false; {15262#false} is VALID [2022-04-27 15:26:40,772 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-27 15:26:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:40,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546602177] [2022-04-27 15:26:40,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546602177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:40,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:40,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:26:40,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359897121] [2022-04-27 15:26:40,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:40,773 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-27 15:26:40,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:40,773 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-27 15:26:40,837 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-27 15:26:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:26:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:26:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:40,838 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-27 15:26:42,870 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-27 15:26:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:43,918 INFO L93 Difference]: Finished difference Result 477 states and 746 transitions. [2022-04-27 15:26:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 15:26:43,918 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-27 15:26:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:43,919 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-27 15:26:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-27 15:26:43,921 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-27 15:26:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 403 transitions. [2022-04-27 15:26:43,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 403 transitions. [2022-04-27 15:26:44,226 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-27 15:26:44,231 INFO L225 Difference]: With dead ends: 477 [2022-04-27 15:26:44,231 INFO L226 Difference]: Without dead ends: 256 [2022-04-27 15:26:44,231 INFO L412 NwaCegarLoop]: 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-27 15:26:44,232 INFO L413 NwaCegarLoop]: 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-27 15:26:44,232 INFO L414 NwaCegarLoop]: 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-27 15:26:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-27 15:26:44,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-04-27 15:26:44,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:44,238 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-27 15:26:44,238 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-27 15:26:44,239 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-27 15:26:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:44,243 INFO L93 Difference]: Finished difference Result 256 states and 393 transitions. [2022-04-27 15:26:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-27 15:26:44,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:44,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:44,244 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-27 15:26:44,244 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-27 15:26:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:44,249 INFO L93 Difference]: Finished difference Result 256 states and 393 transitions. [2022-04-27 15:26:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-27 15:26:44,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:44,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:44,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:44,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:44,250 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-27 15:26:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 393 transitions. [2022-04-27 15:26:44,255 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 393 transitions. Word has length 85 [2022-04-27 15:26:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:44,255 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 393 transitions. [2022-04-27 15:26:44,255 INFO L496 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-27 15:26:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 393 transitions. [2022-04-27 15:26:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 15:26:44,256 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:44,256 INFO L195 NwaCegarLoop]: 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-27 15:26:44,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:26:44,256 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 681790009, now seen corresponding path program 1 times [2022-04-27 15:26:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:44,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5018939] [2022-04-27 15:26:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:44,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {16635#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16628#true} is VALID [2022-04-27 15:26:44,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {16628#true} assume true; {16628#true} is VALID [2022-04-27 15:26:44,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16628#true} {16628#true} #662#return; {16628#true} is VALID [2022-04-27 15:26:44,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {16628#true} call ULTIMATE.init(); {16635#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:44,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {16635#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {16628#true} is VALID [2022-04-27 15:26:44,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {16628#true} assume true; {16628#true} is VALID [2022-04-27 15:26:44,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16628#true} {16628#true} #662#return; {16628#true} is VALID [2022-04-27 15:26:44,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {16628#true} call #t~ret161 := main(); {16628#true} is VALID [2022-04-27 15:26:44,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {16628#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; {16628#true} is VALID [2022-04-27 15:26:44,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {16628#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,398 INFO L272 TraceCheckUtils]: 7: Hoare triple {16628#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {16628#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); {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {16628#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; {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {16628#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; {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {16628#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {16628#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {16628#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {16628#true} assume !false; {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {16628#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {16628#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {16628#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {16628#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {16628#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {16628#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {16628#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {16628#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {16628#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {16628#true} assume 8464 == #t~mem55;havoc #t~mem55; {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {16628#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; {16628#true} is VALID [2022-04-27 15:26:44,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {16628#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {16628#true} is VALID [2022-04-27 15:26:44,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {16628#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); {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:44,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {16633#(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); {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:44,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {16633#(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; {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:44,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:44,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:44,403 INFO L290 TraceCheckUtils]: 32: Hoare triple {16633#(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); {16633#(not (= 16384 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {16633#(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); {16634#(not (= |ssl3_accept_#t~mem48| 16384))} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {16634#(not (= |ssl3_accept_#t~mem48| 16384))} assume 16384 == #t~mem48;havoc #t~mem48; {16629#false} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {16629#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {16629#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {16629#false} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {16629#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 38: Hoare triple {16629#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); {16629#false} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 39: Hoare triple {16629#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {16629#false} is VALID [2022-04-27 15:26:44,404 INFO L290 TraceCheckUtils]: 40: Hoare triple {16629#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); {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {16629#false} assume 12292 != #t~mem85;havoc #t~mem85; {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {16629#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; {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {16629#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); {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {16629#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {16629#false} ~skip~0 := 0; {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {16629#false} assume !false; {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 47: Hoare triple {16629#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); {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {16629#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {16629#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 50: Hoare triple {16629#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 51: Hoare triple {16629#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {16629#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {16629#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {16629#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 55: Hoare triple {16629#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {16629#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {16629#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {16629#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 59: Hoare triple {16629#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {16629#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {16629#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {16629#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {16629#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {16629#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {16629#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {16629#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {16629#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {16629#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {16629#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {16629#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 71: Hoare triple {16629#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 72: Hoare triple {16629#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 73: Hoare triple {16629#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 74: Hoare triple {16629#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,407 INFO L290 TraceCheckUtils]: 75: Hoare triple {16629#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 76: Hoare triple {16629#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 77: Hoare triple {16629#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 78: Hoare triple {16629#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 79: Hoare triple {16629#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 80: Hoare triple {16629#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 81: Hoare triple {16629#false} assume 8673 == #t~mem80;havoc #t~mem80; {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 82: Hoare triple {16629#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 83: Hoare triple {16629#false} assume 3 == ~blastFlag~0; {16629#false} is VALID [2022-04-27 15:26:44,408 INFO L290 TraceCheckUtils]: 84: Hoare triple {16629#false} assume !false; {16629#false} is VALID [2022-04-27 15:26:44,409 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-27 15:26:44,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:44,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5018939] [2022-04-27 15:26:44,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5018939] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:44,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:44,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049104234] [2022-04-27 15:26:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:44,410 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-27 15:26:44,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:44,410 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-27 15:26:44,479 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-27 15:26:44,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:44,480 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-27 15:26:46,505 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-27 15:26:47,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:47,675 INFO L93 Difference]: Finished difference Result 590 states and 911 transitions. [2022-04-27 15:26:47,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:47,675 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-27 15:26:47,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:47,675 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-27 15:26:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-27 15:26:47,678 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-27 15:26:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-04-27 15:26:47,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 564 transitions. [2022-04-27 15:26:48,062 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-27 15:26:48,068 INFO L225 Difference]: With dead ends: 590 [2022-04-27 15:26:48,068 INFO L226 Difference]: Without dead ends: 360 [2022-04-27 15:26:48,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:48,069 INFO L413 NwaCegarLoop]: 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-27 15:26:48,069 INFO L414 NwaCegarLoop]: 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-27 15:26:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-27 15:26:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 256. [2022-04-27 15:26:48,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:48,076 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-27 15:26:48,077 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-27 15:26:48,077 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-27 15:26:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:48,084 INFO L93 Difference]: Finished difference Result 360 states and 544 transitions. [2022-04-27 15:26:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-04-27 15:26:48,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:48,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:48,086 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-27 15:26:48,086 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-27 15:26:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:48,094 INFO L93 Difference]: Finished difference Result 360 states and 544 transitions. [2022-04-27 15:26:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 544 transitions. [2022-04-27 15:26:48,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:48,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:48,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:48,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:48,095 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-27 15:26:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2022-04-27 15:26:48,100 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 85 [2022-04-27 15:26:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:48,100 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2022-04-27 15:26:48,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2022-04-27 15:26:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-27 15:26:48,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:48,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:48,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:26:48,102 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2033895406, now seen corresponding path program 1 times [2022-04-27 15:26:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:48,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008466569] [2022-04-27 15:26:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:48,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {18344#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18337#true} is VALID [2022-04-27 15:26:48,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {18337#true} assume true; {18337#true} is VALID [2022-04-27 15:26:48,226 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18337#true} {18337#true} #662#return; {18337#true} is VALID [2022-04-27 15:26:48,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {18337#true} call ULTIMATE.init(); {18344#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:48,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {18344#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {18337#true} is VALID [2022-04-27 15:26:48,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {18337#true} assume true; {18337#true} is VALID [2022-04-27 15:26:48,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18337#true} {18337#true} #662#return; {18337#true} is VALID [2022-04-27 15:26:48,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {18337#true} call #t~ret161 := main(); {18337#true} is VALID [2022-04-27 15:26:48,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {18337#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; {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {18337#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L272 TraceCheckUtils]: 7: Hoare triple {18337#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {18337#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); {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {18337#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; {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {18337#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; {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {18337#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {18337#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {18337#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {18337#true} assume !false; {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {18337#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {18337#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {18337#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {18337#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {18337#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {18337#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {18337#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {18337#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {18337#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {18337#true} assume 8464 == #t~mem55;havoc #t~mem55; {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {18337#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; {18337#true} is VALID [2022-04-27 15:26:48,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {18337#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18337#true} is VALID [2022-04-27 15:26:48,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {18337#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); {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:48,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {18342#(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); {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:48,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {18342#(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; {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:48,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:48,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:48,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {18342#(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); {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:48,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {18342#(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); {18342#(not (= 8192 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:48,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {18342#(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); {18343#(not (= 8192 |ssl3_accept_#t~mem49|))} is VALID [2022-04-27 15:26:48,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {18343#(not (= 8192 |ssl3_accept_#t~mem49|))} assume 8192 == #t~mem49;havoc #t~mem49; {18338#false} is VALID [2022-04-27 15:26:48,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {18338#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {18338#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {18338#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {18338#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); {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {18338#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {18338#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); {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {18338#false} assume 12292 != #t~mem85;havoc #t~mem85; {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {18338#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; {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 44: Hoare triple {18338#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); {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 45: Hoare triple {18338#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 46: Hoare triple {18338#false} ~skip~0 := 0; {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 47: Hoare triple {18338#false} assume !false; {18338#false} is VALID [2022-04-27 15:26:48,234 INFO L290 TraceCheckUtils]: 48: Hoare triple {18338#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); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 49: Hoare triple {18338#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 50: Hoare triple {18338#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 51: Hoare triple {18338#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {18338#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {18338#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {18338#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {18338#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {18338#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {18338#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 58: Hoare triple {18338#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,235 INFO L290 TraceCheckUtils]: 59: Hoare triple {18338#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {18338#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {18338#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 62: Hoare triple {18338#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {18338#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 64: Hoare triple {18338#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {18338#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {18338#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 67: Hoare triple {18338#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 68: Hoare triple {18338#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 69: Hoare triple {18338#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 70: Hoare triple {18338#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,236 INFO L290 TraceCheckUtils]: 71: Hoare triple {18338#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 72: Hoare triple {18338#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {18338#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {18338#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 75: Hoare triple {18338#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 76: Hoare triple {18338#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 77: Hoare triple {18338#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 78: Hoare triple {18338#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 79: Hoare triple {18338#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 80: Hoare triple {18338#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 81: Hoare triple {18338#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 82: Hoare triple {18338#false} assume 8673 == #t~mem80;havoc #t~mem80; {18338#false} is VALID [2022-04-27 15:26:48,237 INFO L290 TraceCheckUtils]: 83: Hoare triple {18338#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {18338#false} is VALID [2022-04-27 15:26:48,238 INFO L290 TraceCheckUtils]: 84: Hoare triple {18338#false} assume 3 == ~blastFlag~0; {18338#false} is VALID [2022-04-27 15:26:48,238 INFO L290 TraceCheckUtils]: 85: Hoare triple {18338#false} assume !false; {18338#false} is VALID [2022-04-27 15:26:48,238 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-27 15:26:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008466569] [2022-04-27 15:26:48,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008466569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:48,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:48,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970450783] [2022-04-27 15:26:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:48,239 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-27 15:26:48,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:48,240 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-27 15:26:48,307 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-27 15:26:48,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:48,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:48,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:48,308 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-27 15:26:50,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:26:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:51,468 INFO L93 Difference]: Finished difference Result 590 states and 903 transitions. [2022-04-27 15:26:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:51,468 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-27 15:26:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:51,468 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-27 15:26:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-27 15:26:51,472 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-27 15:26:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-04-27 15:26:51,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 563 transitions. [2022-04-27 15:26:51,853 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-27 15:26:51,860 INFO L225 Difference]: With dead ends: 590 [2022-04-27 15:26:51,860 INFO L226 Difference]: Without dead ends: 360 [2022-04-27 15:26:51,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:51,862 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 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-27 15:26:51,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 15:26:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-27 15:26:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 256. [2022-04-27 15:26:51,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:51,869 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-27 15:26:51,869 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-27 15:26:51,870 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-27 15:26:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:51,877 INFO L93 Difference]: Finished difference Result 360 states and 540 transitions. [2022-04-27 15:26:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 540 transitions. [2022-04-27 15:26:51,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:51,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:51,878 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-27 15:26:51,878 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-27 15:26:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:51,886 INFO L93 Difference]: Finished difference Result 360 states and 540 transitions. [2022-04-27 15:26:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 540 transitions. [2022-04-27 15:26:51,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:51,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:51,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:51,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:51,887 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-27 15:26:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2022-04-27 15:26:51,892 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 86 [2022-04-27 15:26:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:51,892 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2022-04-27 15:26:51,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2022-04-27 15:26:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 15:26:51,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:51,894 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:51,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:26:51,894 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:51,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1050188318, now seen corresponding path program 1 times [2022-04-27 15:26:51,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:51,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806762093] [2022-04-27 15:26:51,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:51,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:52,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:52,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {20053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20046#true} is VALID [2022-04-27 15:26:52,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {20046#true} assume true; {20046#true} is VALID [2022-04-27 15:26:52,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20046#true} {20046#true} #662#return; {20046#true} is VALID [2022-04-27 15:26:52,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {20046#true} call ULTIMATE.init(); {20053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:52,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {20053#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {20046#true} is VALID [2022-04-27 15:26:52,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {20046#true} assume true; {20046#true} is VALID [2022-04-27 15:26:52,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20046#true} {20046#true} #662#return; {20046#true} is VALID [2022-04-27 15:26:52,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {20046#true} call #t~ret161 := main(); {20046#true} is VALID [2022-04-27 15:26:52,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {20046#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; {20046#true} is VALID [2022-04-27 15:26:52,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {20046#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,035 INFO L272 TraceCheckUtils]: 7: Hoare triple {20046#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {20046#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); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {20046#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; {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {20046#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; {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {20046#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {20046#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {20046#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {20046#true} assume !false; {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {20046#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {20046#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {20046#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {20046#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {20046#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {20046#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {20046#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {20046#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {20046#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20046#true} is VALID [2022-04-27 15:26:52,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {20046#true} assume 8464 == #t~mem55;havoc #t~mem55; {20046#true} is VALID [2022-04-27 15:26:52,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {20046#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; {20046#true} is VALID [2022-04-27 15:26:52,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {20046#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {20046#true} is VALID [2022-04-27 15:26:52,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {20046#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); {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {20051#(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); {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {20051#(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; {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {20051#(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); {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {20051#(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); {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {20051#(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); {20051#(not (= 24576 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:52,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {20051#(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); {20052#(not (= 24576 |ssl3_accept_#t~mem50|))} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 36: Hoare triple {20052#(not (= 24576 |ssl3_accept_#t~mem50|))} assume 24576 == #t~mem50;havoc #t~mem50; {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {20047#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {20047#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {20047#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {20047#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); {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 41: Hoare triple {20047#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {20047#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); {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {20047#false} assume 12292 != #t~mem85;havoc #t~mem85; {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {20047#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; {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 45: Hoare triple {20047#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); {20047#false} is VALID [2022-04-27 15:26:52,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {20047#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {20047#false} ~skip~0 := 0; {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {20047#false} assume !false; {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {20047#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); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {20047#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {20047#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {20047#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {20047#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 54: Hoare triple {20047#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {20047#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {20047#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {20047#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {20047#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 59: Hoare triple {20047#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 60: Hoare triple {20047#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 61: Hoare triple {20047#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {20047#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {20047#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {20047#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {20047#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {20047#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {20047#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 68: Hoare triple {20047#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {20047#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {20047#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {20047#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 72: Hoare triple {20047#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 73: Hoare triple {20047#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {20047#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {20047#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {20047#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {20047#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {20047#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {20047#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {20047#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {20047#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {20047#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {20047#false} is VALID [2022-04-27 15:26:52,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {20047#false} assume 8673 == #t~mem80;havoc #t~mem80; {20047#false} is VALID [2022-04-27 15:26:52,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {20047#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {20047#false} is VALID [2022-04-27 15:26:52,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {20047#false} assume 3 == ~blastFlag~0; {20047#false} is VALID [2022-04-27 15:26:52,046 INFO L290 TraceCheckUtils]: 86: Hoare triple {20047#false} assume !false; {20047#false} is VALID [2022-04-27 15:26:52,046 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-27 15:26:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:52,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806762093] [2022-04-27 15:26:52,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806762093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:52,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:52,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:52,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727344875] [2022-04-27 15:26:52,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:52,048 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-27 15:26:52,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:52,048 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-27 15:26:52,121 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-27 15:26:52,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:52,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:52,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:52,122 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-27 15:26:54,148 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-27 15:26:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:55,267 INFO L93 Difference]: Finished difference Result 590 states and 895 transitions. [2022-04-27 15:26:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:55,267 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-27 15:26:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:55,267 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-27 15:26:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-27 15:26:55,270 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-27 15:26:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-04-27 15:26:55,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 562 transitions. [2022-04-27 15:26:55,655 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-27 15:26:55,660 INFO L225 Difference]: With dead ends: 590 [2022-04-27 15:26:55,660 INFO L226 Difference]: Without dead ends: 360 [2022-04-27 15:26:55,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:55,661 INFO L413 NwaCegarLoop]: 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-27 15:26:55,661 INFO L414 NwaCegarLoop]: 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-27 15:26:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-04-27 15:26:55,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 256. [2022-04-27 15:26:55,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:55,668 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-27 15:26:55,668 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-27 15:26:55,669 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-27 15:26:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:55,675 INFO L93 Difference]: Finished difference Result 360 states and 536 transitions. [2022-04-27 15:26:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2022-04-27 15:26:55,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:55,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:55,677 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-27 15:26:55,677 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-27 15:26:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:55,685 INFO L93 Difference]: Finished difference Result 360 states and 536 transitions. [2022-04-27 15:26:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2022-04-27 15:26:55,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:55,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:55,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:55,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:55,686 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-27 15:26:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2022-04-27 15:26:55,690 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 87 [2022-04-27 15:26:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:55,691 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2022-04-27 15:26:55,691 INFO L496 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-27 15:26:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2022-04-27 15:26:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 15:26:55,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:55,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:55,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:26:55,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:55,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:55,692 INFO L85 PathProgramCache]: Analyzing trace with hash -756478377, now seen corresponding path program 1 times [2022-04-27 15:26:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:55,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972610444] [2022-04-27 15:26:55,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:55,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:55,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:55,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {21762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21755#true} is VALID [2022-04-27 15:26:55,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {21755#true} assume true; {21755#true} is VALID [2022-04-27 15:26:55,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21755#true} {21755#true} #662#return; {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {21755#true} call ULTIMATE.init(); {21762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:55,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {21762#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {21755#true} assume true; {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21755#true} {21755#true} #662#return; {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {21755#true} call #t~ret161 := main(); {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {21755#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; {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {21755#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L272 TraceCheckUtils]: 7: Hoare triple {21755#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {21755#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); {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {21755#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; {21755#true} is VALID [2022-04-27 15:26:55,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {21755#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; {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {21755#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {21755#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {21755#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {21755#true} assume !false; {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {21755#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {21755#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {21755#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {21755#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {21755#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {21755#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {21755#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {21755#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {21755#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21755#true} is VALID [2022-04-27 15:26:55,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {21755#true} assume 8464 == #t~mem55;havoc #t~mem55; {21755#true} is VALID [2022-04-27 15:26:55,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {21755#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; {21755#true} is VALID [2022-04-27 15:26:55,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {21755#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21755#true} is VALID [2022-04-27 15:26:55,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {21755#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); {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {21760#(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); {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {21760#(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; {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {21760#(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); {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {21760#(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); {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {21760#(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); {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {21760#(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); {21760#(not (= 8195 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:26:55,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {21760#(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); {21761#(not (= |ssl3_accept_#t~mem51| 8195))} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {21761#(not (= |ssl3_accept_#t~mem51| 8195))} assume 8195 == #t~mem51;havoc #t~mem51; {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {21756#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 39: Hoare triple {21756#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 40: Hoare triple {21756#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 41: Hoare triple {21756#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); {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 42: Hoare triple {21756#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 43: Hoare triple {21756#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); {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 44: Hoare triple {21756#false} assume 12292 != #t~mem85;havoc #t~mem85; {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {21756#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; {21756#false} is VALID [2022-04-27 15:26:55,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {21756#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); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {21756#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {21756#false} ~skip~0 := 0; {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {21756#false} assume !false; {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 50: Hoare triple {21756#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); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {21756#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {21756#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {21756#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {21756#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {21756#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {21756#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 57: Hoare triple {21756#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,823 INFO L290 TraceCheckUtils]: 58: Hoare triple {21756#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {21756#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 60: Hoare triple {21756#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {21756#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 62: Hoare triple {21756#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 63: Hoare triple {21756#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 64: Hoare triple {21756#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 65: Hoare triple {21756#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {21756#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {21756#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {21756#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {21756#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {21756#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 71: Hoare triple {21756#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 72: Hoare triple {21756#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {21756#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {21756#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {21756#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {21756#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 77: Hoare triple {21756#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 78: Hoare triple {21756#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 79: Hoare triple {21756#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 80: Hoare triple {21756#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {21756#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {21756#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {21756#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {21756#false} is VALID [2022-04-27 15:26:55,826 INFO L290 TraceCheckUtils]: 84: Hoare triple {21756#false} assume 8673 == #t~mem80;havoc #t~mem80; {21756#false} is VALID [2022-04-27 15:26:55,826 INFO L290 TraceCheckUtils]: 85: Hoare triple {21756#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {21756#false} is VALID [2022-04-27 15:26:55,826 INFO L290 TraceCheckUtils]: 86: Hoare triple {21756#false} assume 3 == ~blastFlag~0; {21756#false} is VALID [2022-04-27 15:26:55,826 INFO L290 TraceCheckUtils]: 87: Hoare triple {21756#false} assume !false; {21756#false} is VALID [2022-04-27 15:26:55,826 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-27 15:26:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:55,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972610444] [2022-04-27 15:26:55,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972610444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:55,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:55,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:55,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298360020] [2022-04-27 15:26:55,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:55,827 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-27 15:26:55,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:55,828 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-27 15:26:55,894 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-27 15:26:55,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:55,895 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-27 15:26:57,921 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-27 15:26:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:59,051 INFO L93 Difference]: Finished difference Result 580 states and 874 transitions. [2022-04-27 15:26:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:26:59,052 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-27 15:26:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:26:59,052 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-27 15:26:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-27 15:26:59,055 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-27 15:26:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2022-04-27 15:26:59,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 559 transitions. [2022-04-27 15:26:59,434 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-27 15:26:59,439 INFO L225 Difference]: With dead ends: 580 [2022-04-27 15:26:59,439 INFO L226 Difference]: Without dead ends: 350 [2022-04-27 15:26:59,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:26:59,440 INFO L413 NwaCegarLoop]: 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-27 15:26:59,442 INFO L414 NwaCegarLoop]: 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-27 15:26:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-27 15:26:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 256. [2022-04-27 15:26:59,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:26:59,449 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-27 15:26:59,450 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-27 15:26:59,450 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-27 15:26:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:59,457 INFO L93 Difference]: Finished difference Result 350 states and 519 transitions. [2022-04-27 15:26:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 519 transitions. [2022-04-27 15:26:59,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:59,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:59,458 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-27 15:26:59,458 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-27 15:26:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:26:59,465 INFO L93 Difference]: Finished difference Result 350 states and 519 transitions. [2022-04-27 15:26:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 519 transitions. [2022-04-27 15:26:59,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:26:59,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:26:59,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:26:59,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:26:59,467 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-27 15:26:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2022-04-27 15:26:59,471 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 88 [2022-04-27 15:26:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:26:59,471 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2022-04-27 15:26:59,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:26:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2022-04-27 15:26:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 15:26:59,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:26:59,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:26:59,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:26:59,473 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:26:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:26:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -220711809, now seen corresponding path program 1 times [2022-04-27 15:26:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:26:59,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813350091] [2022-04-27 15:26:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:26:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:26:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:59,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:26:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:26:59,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {23440#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23433#true} is VALID [2022-04-27 15:26:59,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {23433#true} assume true; {23433#true} is VALID [2022-04-27 15:26:59,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23433#true} {23433#true} #662#return; {23433#true} is VALID [2022-04-27 15:26:59,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {23433#true} call ULTIMATE.init(); {23440#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:26:59,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {23440#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {23433#true} is VALID [2022-04-27 15:26:59,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {23433#true} assume true; {23433#true} is VALID [2022-04-27 15:26:59,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23433#true} {23433#true} #662#return; {23433#true} is VALID [2022-04-27 15:26:59,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {23433#true} call #t~ret161 := main(); {23433#true} is VALID [2022-04-27 15:26:59,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {23433#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; {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {23433#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L272 TraceCheckUtils]: 7: Hoare triple {23433#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {23433#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); {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {23433#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; {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {23433#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; {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {23433#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {23433#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {23433#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {23433#true} assume !false; {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {23433#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {23433#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {23433#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {23433#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {23433#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {23433#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {23433#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {23433#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {23433#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {23433#true} assume 8464 == #t~mem55;havoc #t~mem55; {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {23433#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; {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {23433#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {23433#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); {23433#true} is VALID [2022-04-27 15:26:59,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {23433#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); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {23433#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {23433#true} ~skip~0 := 0; {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {23433#true} assume !false; {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {23433#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {23433#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {23433#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {23433#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {23433#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {23433#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {23433#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 39: Hoare triple {23433#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {23433#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {23433#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {23433#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {23433#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {23433#true} assume 8496 == #t~mem58;havoc #t~mem58; {23433#true} is VALID [2022-04-27 15:26:59,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {23433#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {23433#true} is VALID [2022-04-27 15:26:59,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {23433#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {23433#true} is VALID [2022-04-27 15:26:59,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {23433#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {23433#true} is VALID [2022-04-27 15:26:59,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {23433#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,666 INFO L290 TraceCheckUtils]: 51: Hoare triple {23438#(= 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; {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,667 INFO L290 TraceCheckUtils]: 54: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,668 INFO L290 TraceCheckUtils]: 56: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,668 INFO L290 TraceCheckUtils]: 57: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,669 INFO L290 TraceCheckUtils]: 59: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,669 INFO L290 TraceCheckUtils]: 60: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,670 INFO L290 TraceCheckUtils]: 61: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,670 INFO L290 TraceCheckUtils]: 62: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,670 INFO L290 TraceCheckUtils]: 63: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,672 INFO L290 TraceCheckUtils]: 67: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,672 INFO L290 TraceCheckUtils]: 68: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,674 INFO L290 TraceCheckUtils]: 71: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,674 INFO L290 TraceCheckUtils]: 72: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,675 INFO L290 TraceCheckUtils]: 73: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,675 INFO L290 TraceCheckUtils]: 74: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,676 INFO L290 TraceCheckUtils]: 75: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,676 INFO L290 TraceCheckUtils]: 76: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,676 INFO L290 TraceCheckUtils]: 77: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,677 INFO L290 TraceCheckUtils]: 79: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,678 INFO L290 TraceCheckUtils]: 80: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,678 INFO L290 TraceCheckUtils]: 81: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,678 INFO L290 TraceCheckUtils]: 82: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,679 INFO L290 TraceCheckUtils]: 83: Hoare triple {23438#(= 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); {23438#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:26:59,679 INFO L290 TraceCheckUtils]: 84: Hoare triple {23438#(= 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); {23439#(= |ssl3_accept_#t~mem77| 8656)} is VALID [2022-04-27 15:26:59,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {23439#(= |ssl3_accept_#t~mem77| 8656)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {23434#false} is VALID [2022-04-27 15:26:59,680 INFO L290 TraceCheckUtils]: 86: Hoare triple {23434#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {23434#false} is VALID [2022-04-27 15:26:59,680 INFO L290 TraceCheckUtils]: 87: Hoare triple {23434#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {23434#false} is VALID [2022-04-27 15:26:59,680 INFO L290 TraceCheckUtils]: 88: Hoare triple {23434#false} assume 8673 == #t~mem80;havoc #t~mem80; {23434#false} is VALID [2022-04-27 15:26:59,680 INFO L290 TraceCheckUtils]: 89: Hoare triple {23434#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {23434#false} is VALID [2022-04-27 15:26:59,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {23434#false} assume 3 == ~blastFlag~0; {23434#false} is VALID [2022-04-27 15:26:59,680 INFO L290 TraceCheckUtils]: 91: Hoare triple {23434#false} assume !false; {23434#false} is VALID [2022-04-27 15:26:59,681 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-27 15:26:59,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:26:59,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813350091] [2022-04-27 15:26:59,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813350091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:26:59,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:26:59,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:26:59,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458979147] [2022-04-27 15:26:59,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:26:59,683 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-27 15:26:59,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:26:59,683 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-27 15:26:59,750 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-27 15:26:59,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:26:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:26:59,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:26:59,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:26:59,751 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-27 15:27:01,770 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-27 15:27:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:02,923 INFO L93 Difference]: Finished difference Result 578 states and 861 transitions. [2022-04-27 15:27:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:02,923 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-27 15:27:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:02,924 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-27 15:27:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-27 15:27:02,926 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-27 15:27:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-04-27 15:27:02,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 528 transitions. [2022-04-27 15:27:03,264 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-27 15:27:03,269 INFO L225 Difference]: With dead ends: 578 [2022-04-27 15:27:03,269 INFO L226 Difference]: Without dead ends: 348 [2022-04-27 15:27:03,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:03,270 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 70 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:03,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 465 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 511 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:27:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-27 15:27:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 299. [2022-04-27 15:27:03,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:03,276 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-27 15:27:03,277 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-27 15:27:03,277 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-27 15:27:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:03,284 INFO L93 Difference]: Finished difference Result 348 states and 513 transitions. [2022-04-27 15:27:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 513 transitions. [2022-04-27 15:27:03,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:03,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:03,285 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-27 15:27:03,286 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-27 15:27:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:03,292 INFO L93 Difference]: Finished difference Result 348 states and 513 transitions. [2022-04-27 15:27:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 513 transitions. [2022-04-27 15:27:03,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:03,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:03,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:03,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:03,294 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-27 15:27:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 448 transitions. [2022-04-27 15:27:03,299 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 448 transitions. Word has length 92 [2022-04-27 15:27:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:03,299 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 448 transitions. [2022-04-27 15:27:03,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 448 transitions. [2022-04-27 15:27:03,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 15:27:03,301 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:03,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:03,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:27:03,301 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:03,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2024867645, now seen corresponding path program 1 times [2022-04-27 15:27:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:03,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792313182] [2022-04-27 15:27:03,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:03,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:03,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {25155#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25148#true} is VALID [2022-04-27 15:27:03,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {25148#true} assume true; {25148#true} is VALID [2022-04-27 15:27:03,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25148#true} {25148#true} #662#return; {25148#true} is VALID [2022-04-27 15:27:03,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {25148#true} call ULTIMATE.init(); {25155#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:27:03,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {25155#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {25148#true} assume true; {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25148#true} {25148#true} #662#return; {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {25148#true} call #t~ret161 := main(); {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {25148#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; {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {25148#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L272 TraceCheckUtils]: 7: Hoare triple {25148#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {25148#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); {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {25148#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; {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {25148#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; {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {25148#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25148#true} is VALID [2022-04-27 15:27:03,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {25148#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {25148#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {25148#true} assume !false; {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {25148#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {25148#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {25148#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {25148#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {25148#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {25148#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {25148#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {25148#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {25148#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,443 INFO L290 TraceCheckUtils]: 24: Hoare triple {25148#true} assume 8464 == #t~mem55;havoc #t~mem55; {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {25148#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; {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 26: Hoare triple {25148#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {25148#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); {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {25148#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); {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {25148#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {25148#true} ~skip~0 := 0; {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {25148#true} assume !false; {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {25148#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {25148#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {25148#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {25148#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {25148#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {25148#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {25148#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {25148#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {25148#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {25148#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 42: Hoare triple {25148#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 43: Hoare triple {25148#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {25148#true} assume 8496 == #t~mem58;havoc #t~mem58; {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {25148#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {25148#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25148#true} is VALID [2022-04-27 15:27:03,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {25148#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {25148#true} is VALID [2022-04-27 15:27:03,446 INFO L290 TraceCheckUtils]: 48: Hoare triple {25148#true} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,448 INFO L290 TraceCheckUtils]: 51: Hoare triple {25153#(= (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; {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,448 INFO L290 TraceCheckUtils]: 52: Hoare triple {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} ~skip~0 := 0; {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} assume !false; {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,449 INFO L290 TraceCheckUtils]: 54: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,449 INFO L290 TraceCheckUtils]: 55: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,450 INFO L290 TraceCheckUtils]: 56: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,450 INFO L290 TraceCheckUtils]: 57: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,450 INFO L290 TraceCheckUtils]: 58: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,451 INFO L290 TraceCheckUtils]: 59: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,451 INFO L290 TraceCheckUtils]: 60: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,452 INFO L290 TraceCheckUtils]: 61: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,452 INFO L290 TraceCheckUtils]: 62: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,452 INFO L290 TraceCheckUtils]: 63: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,453 INFO L290 TraceCheckUtils]: 65: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,453 INFO L290 TraceCheckUtils]: 66: Hoare triple {25153#(= (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); {25153#(= (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)) 8512)} is VALID [2022-04-27 15:27:03,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {25153#(= (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); {25154#(= |ssl3_accept_#t~mem60| 8512)} is VALID [2022-04-27 15:27:03,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {25154#(= |ssl3_accept_#t~mem60| 8512)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,454 INFO L290 TraceCheckUtils]: 69: Hoare triple {25149#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,454 INFO L290 TraceCheckUtils]: 70: Hoare triple {25149#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,454 INFO L290 TraceCheckUtils]: 71: Hoare triple {25149#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {25149#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {25149#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {25149#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 75: Hoare triple {25149#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {25149#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 77: Hoare triple {25149#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 78: Hoare triple {25149#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 79: Hoare triple {25149#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 80: Hoare triple {25149#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 81: Hoare triple {25149#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 82: Hoare triple {25149#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 83: Hoare triple {25149#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,455 INFO L290 TraceCheckUtils]: 84: Hoare triple {25149#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,456 INFO L290 TraceCheckUtils]: 85: Hoare triple {25149#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,456 INFO L290 TraceCheckUtils]: 86: Hoare triple {25149#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,456 INFO L290 TraceCheckUtils]: 87: Hoare triple {25149#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {25149#false} is VALID [2022-04-27 15:27:03,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {25149#false} assume 8673 == #t~mem80;havoc #t~mem80; {25149#false} is VALID [2022-04-27 15:27:03,456 INFO L290 TraceCheckUtils]: 89: Hoare triple {25149#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {25149#false} is VALID [2022-04-27 15:27:03,456 INFO L290 TraceCheckUtils]: 90: Hoare triple {25149#false} assume 3 == ~blastFlag~0; {25149#false} is VALID [2022-04-27 15:27:03,456 INFO L290 TraceCheckUtils]: 91: Hoare triple {25149#false} assume !false; {25149#false} is VALID [2022-04-27 15:27:03,456 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-27 15:27:03,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:03,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792313182] [2022-04-27 15:27:03,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792313182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:03,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:03,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804124899] [2022-04-27 15:27:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:03,457 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-27 15:27:03,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:03,458 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-27 15:27:03,522 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-27 15:27:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:03,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:03,527 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-27 15:27:05,552 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-27 15:27:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:06,589 INFO L93 Difference]: Finished difference Result 617 states and 929 transitions. [2022-04-27 15:27:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:06,590 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-27 15:27:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:06,590 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-27 15:27:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-27 15:27:06,593 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-27 15:27:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 455 transitions. [2022-04-27 15:27:06,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 455 transitions. [2022-04-27 15:27:06,886 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-27 15:27:06,890 INFO L225 Difference]: With dead ends: 617 [2022-04-27 15:27:06,890 INFO L226 Difference]: Without dead ends: 344 [2022-04-27 15:27:06,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:06,892 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 32 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:06,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 565 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:27:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-27 15:27:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 323. [2022-04-27 15:27:06,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:06,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 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-27 15:27:06,907 INFO L74 IsIncluded]: Start isIncluded. First operand 344 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-27 15:27:06,907 INFO L87 Difference]: Start difference. First operand 344 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-27 15:27:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:06,924 INFO L93 Difference]: Finished difference Result 344 states and 510 transitions. [2022-04-27 15:27:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 510 transitions. [2022-04-27 15:27:06,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:06,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:06,925 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 344 states. [2022-04-27 15:27:06,926 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 344 states. [2022-04-27 15:27:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:06,932 INFO L93 Difference]: Finished difference Result 344 states and 510 transitions. [2022-04-27 15:27:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 510 transitions. [2022-04-27 15:27:06,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:06,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:06,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:06,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:06,933 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-27 15:27:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 483 transitions. [2022-04-27 15:27:06,941 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 483 transitions. Word has length 92 [2022-04-27 15:27:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:06,941 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 483 transitions. [2022-04-27 15:27:06,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 483 transitions. [2022-04-27 15:27:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-27 15:27:06,942 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:06,943 INFO L195 NwaCegarLoop]: 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-27 15:27:06,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:27:06,943 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1450897899, now seen corresponding path program 1 times [2022-04-27 15:27:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346235375] [2022-04-27 15:27:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:07,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:07,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {26920#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26913#true} is VALID [2022-04-27 15:27:07,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-27 15:27:07,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26913#true} {26913#true} #662#return; {26913#true} is VALID [2022-04-27 15:27:07,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {26913#true} call ULTIMATE.init(); {26920#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:27:07,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {26920#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {26913#true} is VALID [2022-04-27 15:27:07,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {26913#true} assume true; {26913#true} is VALID [2022-04-27 15:27:07,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26913#true} {26913#true} #662#return; {26913#true} is VALID [2022-04-27 15:27:07,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {26913#true} call #t~ret161 := main(); {26913#true} is VALID [2022-04-27 15:27:07,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {26913#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; {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {26913#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L272 TraceCheckUtils]: 7: Hoare triple {26913#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {26913#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); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {26913#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; {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {26913#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; {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {26913#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {26913#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {26913#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {26913#true} assume !false; {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {26913#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {26913#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {26913#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,072 INFO L290 TraceCheckUtils]: 18: Hoare triple {26913#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 19: Hoare triple {26913#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 20: Hoare triple {26913#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 21: Hoare triple {26913#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {26913#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {26913#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {26913#true} assume 8464 == #t~mem55;havoc #t~mem55; {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {26913#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; {26913#true} is VALID [2022-04-27 15:27:07,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {26913#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {26913#true} is VALID [2022-04-27 15:27:07,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {26913#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); {26918#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:07,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {26918#(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); {26918#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:07,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {26918#(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; {26918#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:07,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {26918#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} ~skip~0 := 0; {26918#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:07,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {26918#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} assume !false; {26918#(not (= 12292 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52))))} is VALID [2022-04-27 15:27:07,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {26918#(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); {26919#(not (= 12292 |ssl3_accept_#t~mem47|))} is VALID [2022-04-27 15:27:07,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {26919#(not (= 12292 |ssl3_accept_#t~mem47|))} assume 12292 == #t~mem47;havoc #t~mem47; {26914#false} is VALID [2022-04-27 15:27:07,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {26914#false} call write~int(1, ~s.base, 40 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {26914#false} call write~int(1, ~s.base, 36 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {26914#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {26914#false} call #t~mem82 := read~int(~s.base, ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {26914#false} assume !(0 == (#t~mem83.base + #t~mem83.offset) % 4294967296);havoc #t~mem83.base, #t~mem83.offset; {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {26914#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {26914#false} ~skip~0 := 0; {26914#false} is VALID [2022-04-27 15:27:07,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 46: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 47: Hoare triple {26914#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {26914#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 49: Hoare triple {26914#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 50: Hoare triple {26914#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 51: Hoare triple {26914#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {26914#false} assume 8480 == #t~mem52;havoc #t~mem52; {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 53: Hoare triple {26914#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; {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {26914#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {26914#false} ~skip~0 := 0; {26914#false} is VALID [2022-04-27 15:27:07,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 59: Hoare triple {26914#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); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {26914#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {26914#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {26914#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 63: Hoare triple {26914#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {26914#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {26914#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {26914#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {26914#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {26914#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 69: Hoare triple {26914#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,079 INFO L290 TraceCheckUtils]: 70: Hoare triple {26914#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 71: Hoare triple {26914#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {26914#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 73: Hoare triple {26914#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 74: Hoare triple {26914#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 75: Hoare triple {26914#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 76: Hoare triple {26914#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {26914#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {26914#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 79: Hoare triple {26914#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 80: Hoare triple {26914#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 81: Hoare triple {26914#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {26914#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 83: Hoare triple {26914#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 84: Hoare triple {26914#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {26914#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {26914#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 87: Hoare triple {26914#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 88: Hoare triple {26914#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {26914#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 90: Hoare triple {26914#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 91: Hoare triple {26914#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 92: Hoare triple {26914#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 93: Hoare triple {26914#false} assume 8673 == #t~mem80;havoc #t~mem80; {26914#false} is VALID [2022-04-27 15:27:07,081 INFO L290 TraceCheckUtils]: 94: Hoare triple {26914#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {26914#false} is VALID [2022-04-27 15:27:07,082 INFO L290 TraceCheckUtils]: 95: Hoare triple {26914#false} assume 3 == ~blastFlag~0; {26914#false} is VALID [2022-04-27 15:27:07,082 INFO L290 TraceCheckUtils]: 96: Hoare triple {26914#false} assume !false; {26914#false} is VALID [2022-04-27 15:27:07,082 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-27 15:27:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:07,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346235375] [2022-04-27 15:27:07,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346235375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:07,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:07,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664866936] [2022-04-27 15:27:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:07,083 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-27 15:27:07,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:07,084 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-27 15:27:07,155 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-27 15:27:07,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:07,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:07,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:07,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:07,156 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-27 15:27:09,181 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-27 15:27:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:10,263 INFO L93 Difference]: Finished difference Result 704 states and 1066 transitions. [2022-04-27 15:27:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:10,264 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-27 15:27:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:10,264 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-27 15:27:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2022-04-27 15:27:10,266 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-27 15:27:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2022-04-27 15:27:10,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 546 transitions. [2022-04-27 15:27:10,632 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-27 15:27:10,639 INFO L225 Difference]: With dead ends: 704 [2022-04-27 15:27:10,639 INFO L226 Difference]: Without dead ends: 407 [2022-04-27 15:27:10,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:10,641 INFO L413 NwaCegarLoop]: 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-27 15:27:10,641 INFO L414 NwaCegarLoop]: 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-27 15:27:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-04-27 15:27:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 323. [2022-04-27 15:27:10,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:10,648 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-27 15:27:10,648 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-27 15:27:10,649 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-27 15:27:10,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:10,657 INFO L93 Difference]: Finished difference Result 407 states and 607 transitions. [2022-04-27 15:27:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2022-04-27 15:27:10,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:10,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:10,659 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-27 15:27:10,659 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-27 15:27:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:10,668 INFO L93 Difference]: Finished difference Result 407 states and 607 transitions. [2022-04-27 15:27:10,669 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 607 transitions. [2022-04-27 15:27:10,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:10,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:10,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:10,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:10,670 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-27 15:27:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 477 transitions. [2022-04-27 15:27:10,676 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 477 transitions. Word has length 97 [2022-04-27 15:27:10,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:10,676 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 477 transitions. [2022-04-27 15:27:10,677 INFO L496 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-27 15:27:10,677 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 477 transitions. [2022-04-27 15:27:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:10,678 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:10,678 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:10,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:27:10,678 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:10,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1933273423, now seen corresponding path program 1 times [2022-04-27 15:27:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:10,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509439864] [2022-04-27 15:27:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:10,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:10,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {28913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28906#true} is VALID [2022-04-27 15:27:10,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-27 15:27:10,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28906#true} {28906#true} #662#return; {28906#true} is VALID [2022-04-27 15:27:10,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {28906#true} call ULTIMATE.init(); {28913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:27:10,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {28913#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {28906#true} is VALID [2022-04-27 15:27:10,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-27 15:27:10,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28906#true} {28906#true} #662#return; {28906#true} is VALID [2022-04-27 15:27:10,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {28906#true} call #t~ret161 := main(); {28906#true} is VALID [2022-04-27 15:27:10,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {28906#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; {28906#true} is VALID [2022-04-27 15:27:10,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {28906#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,811 INFO L272 TraceCheckUtils]: 7: Hoare triple {28906#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {28906#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); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {28906#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; {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {28906#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; {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {28906#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {28906#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {28906#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {28906#true} assume !false; {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {28906#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {28906#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {28906#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {28906#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {28906#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {28906#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {28906#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {28906#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {28906#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {28906#true} assume 8464 == #t~mem55;havoc #t~mem55; {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {28906#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; {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {28906#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {28906#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); {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {28906#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); {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {28906#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {28906#true} ~skip~0 := 0; {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {28906#true} assume !false; {28906#true} is VALID [2022-04-27 15:27:10,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {28906#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {28906#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {28906#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 35: Hoare triple {28906#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {28906#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {28906#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {28906#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {28906#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {28906#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {28906#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {28906#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {28906#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {28906#true} assume 8496 == #t~mem58;havoc #t~mem58; {28906#true} is VALID [2022-04-27 15:27:10,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {28906#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {28906#true} is VALID [2022-04-27 15:27:10,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {28906#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {28906#true} is VALID [2022-04-27 15:27:10,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {28906#true} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {28906#true} is VALID [2022-04-27 15:27:10,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {28906#true} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {28911#(= 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; {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} ~skip~0 := 0; {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} assume !false; {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,820 INFO L290 TraceCheckUtils]: 59: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {28911#(= 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); {28911#(= 8656 (select (select |#memory_int| ssl3_accept_~s.base) (+ ssl3_accept_~s.offset 52)))} is VALID [2022-04-27 15:27:10,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {28911#(= 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); {28912#(= |ssl3_accept_#t~mem60| 8656)} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {28912#(= |ssl3_accept_#t~mem60| 8656)} assume 8512 == #t~mem60;havoc #t~mem60; {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {28907#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); {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {28907#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; {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 71: Hoare triple {28907#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 72: Hoare triple {28907#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); {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 73: Hoare triple {28907#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 74: Hoare triple {28907#false} ~skip~0 := 0; {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 75: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-27 15:27:10,824 INFO L290 TraceCheckUtils]: 76: Hoare triple {28907#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); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 77: Hoare triple {28907#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 78: Hoare triple {28907#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 79: Hoare triple {28907#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 80: Hoare triple {28907#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {28907#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 82: Hoare triple {28907#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 83: Hoare triple {28907#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 84: Hoare triple {28907#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {28907#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 86: Hoare triple {28907#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 87: Hoare triple {28907#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,825 INFO L290 TraceCheckUtils]: 88: Hoare triple {28907#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 89: Hoare triple {28907#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 90: Hoare triple {28907#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 91: Hoare triple {28907#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 92: Hoare triple {28907#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 93: Hoare triple {28907#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 94: Hoare triple {28907#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 95: Hoare triple {28907#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 96: Hoare triple {28907#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 97: Hoare triple {28907#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 98: Hoare triple {28907#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 99: Hoare triple {28907#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,826 INFO L290 TraceCheckUtils]: 100: Hoare triple {28907#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 101: Hoare triple {28907#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 102: Hoare triple {28907#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 103: Hoare triple {28907#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 104: Hoare triple {28907#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 105: Hoare triple {28907#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 106: Hoare triple {28907#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 107: Hoare triple {28907#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 108: Hoare triple {28907#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 109: Hoare triple {28907#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 110: Hoare triple {28907#false} assume 8673 == #t~mem80;havoc #t~mem80; {28907#false} is VALID [2022-04-27 15:27:10,827 INFO L290 TraceCheckUtils]: 111: Hoare triple {28907#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {28907#false} is VALID [2022-04-27 15:27:10,828 INFO L290 TraceCheckUtils]: 112: Hoare triple {28907#false} assume 3 == ~blastFlag~0; {28907#false} is VALID [2022-04-27 15:27:10,828 INFO L290 TraceCheckUtils]: 113: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-27 15:27:10,828 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-27 15:27:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:10,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509439864] [2022-04-27 15:27:10,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509439864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:10,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:10,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:27:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112404026] [2022-04-27 15:27:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:10,829 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-27 15:27:10,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:10,830 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-27 15:27:10,907 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-27 15:27:10,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:27:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:10,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:27:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:27:10,908 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-27 15:27:12,934 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-27 15:27:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:14,034 INFO L93 Difference]: Finished difference Result 659 states and 977 transitions. [2022-04-27 15:27:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:27:14,035 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-27 15:27:14,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:14,035 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-27 15:27:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-27 15:27:14,037 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-27 15:27:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 514 transitions. [2022-04-27 15:27:14,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 514 transitions. [2022-04-27 15:27:14,370 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-27 15:27:14,375 INFO L225 Difference]: With dead ends: 659 [2022-04-27 15:27:14,375 INFO L226 Difference]: Without dead ends: 362 [2022-04-27 15:27:14,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:27:14,377 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 79 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:14,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 465 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 487 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 15:27:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-27 15:27:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 323. [2022-04-27 15:27:14,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:14,384 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-27 15:27:14,384 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-27 15:27:14,384 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-27 15:27:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:14,391 INFO L93 Difference]: Finished difference Result 362 states and 529 transitions. [2022-04-27 15:27:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 529 transitions. [2022-04-27 15:27:14,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:14,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:14,392 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-27 15:27:14,393 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-27 15:27:14,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:14,400 INFO L93 Difference]: Finished difference Result 362 states and 529 transitions. [2022-04-27 15:27:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 529 transitions. [2022-04-27 15:27:14,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:14,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:14,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:14,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:14,401 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-27 15:27:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 476 transitions. [2022-04-27 15:27:14,407 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 476 transitions. Word has length 114 [2022-04-27 15:27:14,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:14,407 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 476 transitions. [2022-04-27 15:27:14,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 476 transitions. [2022-04-27 15:27:14,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:14,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:14,408 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:14,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:27:14,409 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:14,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1629726447, now seen corresponding path program 1 times [2022-04-27 15:27:14,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:14,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642374579] [2022-04-27 15:27:14,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:14,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {30766#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30760#true} is VALID [2022-04-27 15:27:14,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {30760#true} assume true; {30760#true} is VALID [2022-04-27 15:27:14,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30760#true} {30760#true} #662#return; {30760#true} is VALID [2022-04-27 15:27:14,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {30760#true} call ULTIMATE.init(); {30766#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:27:14,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {30766#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {30760#true} assume true; {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30760#true} {30760#true} #662#return; {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {30760#true} call #t~ret161 := main(); {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {30760#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; {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {30760#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L272 TraceCheckUtils]: 7: Hoare triple {30760#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {30760#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); {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {30760#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; {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {30760#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; {30760#true} is VALID [2022-04-27 15:27:14,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {30760#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {30760#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {30760#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {30760#true} assume !false; {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {30760#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {30760#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {30760#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {30760#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {30760#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {30760#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {30760#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {30760#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {30760#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {30760#true} assume 8464 == #t~mem55;havoc #t~mem55; {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {30760#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; {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {30760#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {30760#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); {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {30760#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); {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {30760#true} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {30760#true} ~skip~0 := 0; {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {30760#true} assume !false; {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {30760#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {30760#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {30760#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 35: Hoare triple {30760#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {30760#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 37: Hoare triple {30760#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {30760#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {30760#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 40: Hoare triple {30760#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 41: Hoare triple {30760#true} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 42: Hoare triple {30760#true} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {30760#true} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {30760#true} assume 8496 == #t~mem58;havoc #t~mem58; {30760#true} is VALID [2022-04-27 15:27:14,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {30760#true} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {30760#true} is VALID [2022-04-27 15:27:14,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {30760#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {30765#(= 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); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {30765#(= 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); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,577 INFO L290 TraceCheckUtils]: 55: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,577 INFO L290 TraceCheckUtils]: 56: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,578 INFO L290 TraceCheckUtils]: 57: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,578 INFO L290 TraceCheckUtils]: 58: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,578 INFO L290 TraceCheckUtils]: 59: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,579 INFO L290 TraceCheckUtils]: 60: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,579 INFO L290 TraceCheckUtils]: 61: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,579 INFO L290 TraceCheckUtils]: 62: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,579 INFO L290 TraceCheckUtils]: 63: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,580 INFO L290 TraceCheckUtils]: 64: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,580 INFO L290 TraceCheckUtils]: 65: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,580 INFO L290 TraceCheckUtils]: 66: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,580 INFO L290 TraceCheckUtils]: 67: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume 8512 == #t~mem60;havoc #t~mem60; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {30765#(= 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); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,581 INFO L290 TraceCheckUtils]: 70: Hoare triple {30765#(= 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; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,582 INFO L290 TraceCheckUtils]: 71: Hoare triple {30765#(= 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); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {30765#(= 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); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} ~skip~0 := 0; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,583 INFO L290 TraceCheckUtils]: 75: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !false; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,583 INFO L290 TraceCheckUtils]: 76: Hoare triple {30765#(= 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); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,583 INFO L290 TraceCheckUtils]: 77: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,584 INFO L290 TraceCheckUtils]: 78: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,584 INFO L290 TraceCheckUtils]: 79: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,584 INFO L290 TraceCheckUtils]: 80: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,584 INFO L290 TraceCheckUtils]: 81: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,585 INFO L290 TraceCheckUtils]: 82: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,585 INFO L290 TraceCheckUtils]: 83: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,585 INFO L290 TraceCheckUtils]: 84: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,586 INFO L290 TraceCheckUtils]: 85: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,586 INFO L290 TraceCheckUtils]: 86: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,586 INFO L290 TraceCheckUtils]: 87: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,587 INFO L290 TraceCheckUtils]: 89: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,587 INFO L290 TraceCheckUtils]: 90: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,587 INFO L290 TraceCheckUtils]: 91: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,588 INFO L290 TraceCheckUtils]: 92: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,588 INFO L290 TraceCheckUtils]: 93: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,588 INFO L290 TraceCheckUtils]: 94: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,588 INFO L290 TraceCheckUtils]: 95: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,589 INFO L290 TraceCheckUtils]: 96: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,589 INFO L290 TraceCheckUtils]: 97: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,589 INFO L290 TraceCheckUtils]: 98: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,590 INFO L290 TraceCheckUtils]: 99: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,591 INFO L290 TraceCheckUtils]: 103: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,591 INFO L290 TraceCheckUtils]: 104: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,591 INFO L290 TraceCheckUtils]: 105: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,591 INFO L290 TraceCheckUtils]: 106: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,592 INFO L290 TraceCheckUtils]: 107: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,592 INFO L290 TraceCheckUtils]: 108: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,592 INFO L290 TraceCheckUtils]: 109: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,593 INFO L290 TraceCheckUtils]: 110: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume 8673 == #t~mem80;havoc #t~mem80; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,593 INFO L290 TraceCheckUtils]: 111: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {30765#(= 2 ssl3_accept_~blastFlag~0)} is VALID [2022-04-27 15:27:14,593 INFO L290 TraceCheckUtils]: 112: Hoare triple {30765#(= 2 ssl3_accept_~blastFlag~0)} assume 3 == ~blastFlag~0; {30761#false} is VALID [2022-04-27 15:27:14,593 INFO L290 TraceCheckUtils]: 113: Hoare triple {30761#false} assume !false; {30761#false} is VALID [2022-04-27 15:27:14,594 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-27 15:27:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:14,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642374579] [2022-04-27 15:27:14,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642374579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:14,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:14,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:27:14,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827159877] [2022-04-27 15:27:14,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:14,595 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-27 15:27:14,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:14,595 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-27 15:27:14,663 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-27 15:27:14,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:27:14,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:14,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:27:14,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:14,665 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-27 15:27:16,685 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-27 15:27:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:17,447 INFO L93 Difference]: Finished difference Result 895 states and 1342 transitions. [2022-04-27 15:27:17,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:27:17,448 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-27 15:27:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:17,448 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-27 15:27:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-04-27 15:27:17,450 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-27 15:27:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-04-27 15:27:17,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 574 transitions. [2022-04-27 15:27:17,819 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-27 15:27:17,833 INFO L225 Difference]: With dead ends: 895 [2022-04-27 15:27:17,833 INFO L226 Difference]: Without dead ends: 598 [2022-04-27 15:27:17,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:17,834 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 130 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:27:17,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 426 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 252 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 15:27:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-04-27 15:27:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-04-27 15:27:17,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:17,846 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-27 15:27:17,847 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-27 15:27:17,848 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-27 15:27:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:17,864 INFO L93 Difference]: Finished difference Result 598 states and 891 transitions. [2022-04-27 15:27:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 891 transitions. [2022-04-27 15:27:17,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:17,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:17,866 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-27 15:27:17,867 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-27 15:27:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:17,884 INFO L93 Difference]: Finished difference Result 598 states and 891 transitions. [2022-04-27 15:27:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 891 transitions. [2022-04-27 15:27:17,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:17,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:17,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:17,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:17,886 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-27 15:27:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 891 transitions. [2022-04-27 15:27:17,903 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 891 transitions. Word has length 114 [2022-04-27 15:27:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:17,903 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 891 transitions. [2022-04-27 15:27:17,904 INFO L496 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-27 15:27:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 891 transitions. [2022-04-27 15:27:17,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:17,905 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:17,905 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:17,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:27:17,905 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:17,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1711300691, now seen corresponding path program 1 times [2022-04-27 15:27:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:17,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707925399] [2022-04-27 15:27:17,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:18,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {33652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33646#true} is VALID [2022-04-27 15:27:18,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {33646#true} assume true; {33646#true} is VALID [2022-04-27 15:27:18,017 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33646#true} {33646#true} #662#return; {33646#true} is VALID [2022-04-27 15:27:18,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {33646#true} call ULTIMATE.init(); {33652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:27:18,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {33652#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {33646#true} is VALID [2022-04-27 15:27:18,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {33646#true} assume true; {33646#true} is VALID [2022-04-27 15:27:18,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33646#true} {33646#true} #662#return; {33646#true} is VALID [2022-04-27 15:27:18,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {33646#true} call #t~ret161 := main(); {33646#true} is VALID [2022-04-27 15:27:18,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {33646#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; {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {33646#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L272 TraceCheckUtils]: 7: Hoare triple {33646#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {33646#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); {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {33646#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; {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {33646#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; {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {33646#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {33646#true} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {33646#true} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {33646#true} assume !false; {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {33646#true} call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4);~state~0 := #t~mem46;havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {33646#true} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {33646#true} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {33646#true} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {33646#true} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {33646#true} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {33646#true} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {33646#true} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {33646#true} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {33646#true} assume 8464 == #t~mem55;havoc #t~mem55; {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {33646#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; {33646#true} is VALID [2022-04-27 15:27:18,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {33646#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {33651#(= 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); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {33651#(= 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); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} ~skip~0 := 0; {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !false; {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {33651#(= 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); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume 8496 == #t~mem58;havoc #t~mem58; {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {33651#(= ssl3_accept_~blastFlag~0 1)} is VALID [2022-04-27 15:27:18,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {33651#(= ssl3_accept_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {33647#false} is VALID [2022-04-27 15:27:18,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {33647#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {33647#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {33647#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {33647#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); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {33647#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {33647#false} ~skip~0 := 0; {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {33647#false} assume !false; {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 54: Hoare triple {33647#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); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 55: Hoare triple {33647#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 56: Hoare triple {33647#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 57: Hoare triple {33647#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 58: Hoare triple {33647#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 59: Hoare triple {33647#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 60: Hoare triple {33647#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {33647#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,049 INFO L290 TraceCheckUtils]: 62: Hoare triple {33647#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 63: Hoare triple {33647#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {33647#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {33647#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {33647#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 67: Hoare triple {33647#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 68: Hoare triple {33647#false} assume 8512 == #t~mem60;havoc #t~mem60; {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 69: Hoare triple {33647#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); {33647#false} is VALID [2022-04-27 15:27:18,050 INFO L290 TraceCheckUtils]: 70: Hoare triple {33647#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; {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 71: Hoare triple {33647#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 72: Hoare triple {33647#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); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {33647#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 74: Hoare triple {33647#false} ~skip~0 := 0; {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 75: Hoare triple {33647#false} assume !false; {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 76: Hoare triple {33647#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); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 77: Hoare triple {33647#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 78: Hoare triple {33647#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {33647#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 80: Hoare triple {33647#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 81: Hoare triple {33647#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {33647#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 83: Hoare triple {33647#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 84: Hoare triple {33647#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 85: Hoare triple {33647#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 86: Hoare triple {33647#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 87: Hoare triple {33647#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {33647#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {33647#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 90: Hoare triple {33647#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 91: Hoare triple {33647#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 92: Hoare triple {33647#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 93: Hoare triple {33647#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,052 INFO L290 TraceCheckUtils]: 94: Hoare triple {33647#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 95: Hoare triple {33647#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 96: Hoare triple {33647#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 97: Hoare triple {33647#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 98: Hoare triple {33647#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 99: Hoare triple {33647#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 100: Hoare triple {33647#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 101: Hoare triple {33647#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 102: Hoare triple {33647#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 103: Hoare triple {33647#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 104: Hoare triple {33647#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 105: Hoare triple {33647#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 106: Hoare triple {33647#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,053 INFO L290 TraceCheckUtils]: 107: Hoare triple {33647#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,054 INFO L290 TraceCheckUtils]: 108: Hoare triple {33647#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,054 INFO L290 TraceCheckUtils]: 109: Hoare triple {33647#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {33647#false} is VALID [2022-04-27 15:27:18,054 INFO L290 TraceCheckUtils]: 110: Hoare triple {33647#false} assume 8673 == #t~mem80;havoc #t~mem80; {33647#false} is VALID [2022-04-27 15:27:18,054 INFO L290 TraceCheckUtils]: 111: Hoare triple {33647#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {33647#false} is VALID [2022-04-27 15:27:18,054 INFO L290 TraceCheckUtils]: 112: Hoare triple {33647#false} assume 3 == ~blastFlag~0; {33647#false} is VALID [2022-04-27 15:27:18,054 INFO L290 TraceCheckUtils]: 113: Hoare triple {33647#false} assume !false; {33647#false} is VALID [2022-04-27 15:27:18,054 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-27 15:27:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:18,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707925399] [2022-04-27 15:27:18,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707925399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:18,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:18,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:27:18,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920621647] [2022-04-27 15:27:18,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:18,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:18,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:18,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:18,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:18,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:27:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:18,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:27:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:18,132 INFO L87 Difference]: Start difference. First operand 598 states and 891 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:20,151 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-27 15:27:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:20,800 INFO L93 Difference]: Finished difference Result 1197 states and 1789 transitions. [2022-04-27 15:27:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:27:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-04-27 15:27:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-04-27 15:27:20,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 428 transitions. [2022-04-27 15:27:21,077 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-27 15:27:21,090 INFO L225 Difference]: With dead ends: 1197 [2022-04-27 15:27:21,091 INFO L226 Difference]: Without dead ends: 625 [2022-04-27 15:27:21,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:21,092 INFO L413 NwaCegarLoop]: 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-27 15:27:21,092 INFO L414 NwaCegarLoop]: 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-27 15:27:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-04-27 15:27:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2022-04-27 15:27:21,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:21,104 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-27 15:27:21,105 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-27 15:27:21,105 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-27 15:27:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:21,123 INFO L93 Difference]: Finished difference Result 625 states and 926 transitions. [2022-04-27 15:27:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 926 transitions. [2022-04-27 15:27:21,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:21,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:21,125 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-27 15:27:21,125 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-27 15:27:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:21,143 INFO L93 Difference]: Finished difference Result 625 states and 926 transitions. [2022-04-27 15:27:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 926 transitions. [2022-04-27 15:27:21,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:21,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:21,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:21,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:21,145 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-27 15:27:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 926 transitions. [2022-04-27 15:27:21,164 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 926 transitions. Word has length 114 [2022-04-27 15:27:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:21,164 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 926 transitions. [2022-04-27 15:27:21,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 926 transitions. [2022-04-27 15:27:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-27 15:27:21,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:21,166 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:27:21,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:27:21,166 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1588972907, now seen corresponding path program 1 times [2022-04-27 15:27:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647621036] [2022-04-27 15:27:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:21,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {36962#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36956#true} is VALID [2022-04-27 15:27:21,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {36956#true} assume true; {36956#true} is VALID [2022-04-27 15:27:21,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36956#true} {36956#true} #662#return; {36956#true} is VALID [2022-04-27 15:27:21,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {36956#true} call ULTIMATE.init(); {36962#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:27:21,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {36962#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {36956#true} is VALID [2022-04-27 15:27:21,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {36956#true} assume true; {36956#true} is VALID [2022-04-27 15:27:21,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36956#true} {36956#true} #662#return; {36956#true} is VALID [2022-04-27 15:27:21,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {36956#true} call #t~ret161 := main(); {36956#true} is VALID [2022-04-27 15:27:21,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {36956#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; {36956#true} is VALID [2022-04-27 15:27:21,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {36956#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {36956#true} is VALID [2022-04-27 15:27:21,292 INFO L272 TraceCheckUtils]: 7: Hoare triple {36956#true} call #t~ret30 := ssl3_accept(~s~0.base, ~s~0.offset); {36956#true} is VALID [2022-04-27 15:27:21,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {36956#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); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {36961#(= 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; {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {36961#(= 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; {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {36961#(= 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)))); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} call #t~mem45.base, #t~mem45.offset := read~$Pointer$(~s.base, 136 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == (#t~mem45.base + #t~mem45.offset) % 4294967296);havoc #t~mem45.base, #t~mem45.offset; {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !false; {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {36961#(= 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); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume 8464 == #t~mem55;havoc #t~mem55; {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {36961#(= 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; {36961#(= ssl3_accept_~blastFlag~0 0)} is VALID [2022-04-27 15:27:21,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {36961#(= ssl3_accept_~blastFlag~0 0)} assume !(0 == ~blastFlag~0); {36957#false} is VALID [2022-04-27 15:27:21,297 INFO L290 TraceCheckUtils]: 27: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {36957#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {36957#false} ~skip~0 := 0; {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {36957#false} assume !false; {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {36957#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {36957#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {36957#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {36957#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {36957#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {36957#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {36957#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {36957#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {36957#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 42: Hoare triple {36957#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {36957#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 44: Hoare triple {36957#false} assume 8496 == #t~mem58;havoc #t~mem58; {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {36957#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 46: Hoare triple {36957#false} assume !(1 == ~blastFlag~0); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {36957#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {36957#false} assume !(0 != #t~mem94);havoc #t~mem94;call write~int(8512, ~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {36957#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {36957#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {36957#false} ~skip~0 := 0; {36957#false} is VALID [2022-04-27 15:27:21,299 INFO L290 TraceCheckUtils]: 53: Hoare triple {36957#false} assume !false; {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 55: Hoare triple {36957#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 56: Hoare triple {36957#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {36957#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {36957#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 59: Hoare triple {36957#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 60: Hoare triple {36957#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 61: Hoare triple {36957#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 62: Hoare triple {36957#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {36957#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {36957#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {36957#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 66: Hoare triple {36957#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 67: Hoare triple {36957#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 68: Hoare triple {36957#false} assume 8512 == #t~mem60;havoc #t~mem60; {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 69: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 70: Hoare triple {36957#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; {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 71: Hoare triple {36957#false} call write~int(8528, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 72: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 73: Hoare triple {36957#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 74: Hoare triple {36957#false} ~skip~0 := 0; {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 75: Hoare triple {36957#false} assume !false; {36957#false} is VALID [2022-04-27 15:27:21,301 INFO L290 TraceCheckUtils]: 76: Hoare triple {36957#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); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 77: Hoare triple {36957#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 78: Hoare triple {36957#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 79: Hoare triple {36957#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 80: Hoare triple {36957#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 81: Hoare triple {36957#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 82: Hoare triple {36957#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 83: Hoare triple {36957#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 84: Hoare triple {36957#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {36957#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {36957#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 87: Hoare triple {36957#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,302 INFO L290 TraceCheckUtils]: 88: Hoare triple {36957#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {36957#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {36957#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 91: Hoare triple {36957#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 92: Hoare triple {36957#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 93: Hoare triple {36957#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 94: Hoare triple {36957#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 95: Hoare triple {36957#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 96: Hoare triple {36957#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 97: Hoare triple {36957#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,303 INFO L290 TraceCheckUtils]: 98: Hoare triple {36957#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 99: Hoare triple {36957#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 100: Hoare triple {36957#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 101: Hoare triple {36957#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 102: Hoare triple {36957#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 103: Hoare triple {36957#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 104: Hoare triple {36957#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 105: Hoare triple {36957#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 106: Hoare triple {36957#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 107: Hoare triple {36957#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 108: Hoare triple {36957#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 109: Hoare triple {36957#false} assume !(8672 == #t~mem79);havoc #t~mem79;call #t~mem80 := read~int(~s.base, 52 + ~s.offset, 4); {36957#false} is VALID [2022-04-27 15:27:21,304 INFO L290 TraceCheckUtils]: 110: Hoare triple {36957#false} assume 8673 == #t~mem80;havoc #t~mem80; {36957#false} is VALID [2022-04-27 15:27:21,305 INFO L290 TraceCheckUtils]: 111: Hoare triple {36957#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {36957#false} is VALID [2022-04-27 15:27:21,305 INFO L290 TraceCheckUtils]: 112: Hoare triple {36957#false} assume 3 == ~blastFlag~0; {36957#false} is VALID [2022-04-27 15:27:21,305 INFO L290 TraceCheckUtils]: 113: Hoare triple {36957#false} assume !false; {36957#false} is VALID [2022-04-27 15:27:21,305 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-27 15:27:21,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:21,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647621036] [2022-04-27 15:27:21,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647621036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:21,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:21,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:27:21,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138544804] [2022-04-27 15:27:21,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:21,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:21,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:21,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:27:21,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:27:21,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:21,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:27:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:21,364 INFO L87 Difference]: Start difference. First operand 625 states and 926 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:23,380 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-27 15:27:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:23,987 INFO L93 Difference]: Finished difference Result 1226 states and 1825 transitions. [2022-04-27 15:27:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:27:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2022-04-27 15:27:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-04-27 15:27:23,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-04-27 15:27:23,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 405 transitions. [2022-04-27 15:27:24,318 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-27 15:27:24,339 INFO L225 Difference]: With dead ends: 1226 [2022-04-27 15:27:24,339 INFO L226 Difference]: Without dead ends: 627 [2022-04-27 15:27:24,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:27:24,340 INFO L413 NwaCegarLoop]: 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-27 15:27:24,341 INFO L414 NwaCegarLoop]: 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-27 15:27:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-04-27 15:27:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2022-04-27 15:27:24,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:24,353 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-27 15:27:24,353 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-27 15:27:24,354 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-27 15:27:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:24,371 INFO L93 Difference]: Finished difference Result 627 states and 928 transitions. [2022-04-27 15:27:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 928 transitions. [2022-04-27 15:27:24,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:24,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:24,373 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-27 15:27:24,374 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-27 15:27:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:24,392 INFO L93 Difference]: Finished difference Result 627 states and 928 transitions. [2022-04-27 15:27:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 928 transitions. [2022-04-27 15:27:24,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:24,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:24,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:24,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:24,395 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-27 15:27:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 928 transitions. [2022-04-27 15:27:24,415 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 928 transitions. Word has length 114 [2022-04-27 15:27:24,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:24,415 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 928 transitions. [2022-04-27 15:27:24,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:27:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 928 transitions. [2022-04-27 15:27:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:27:24,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:24,417 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 15:27:24,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:27:24,417 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash 977330790, now seen corresponding path program 1 times [2022-04-27 15:27:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:24,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586162724] [2022-04-27 15:27:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:27:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:27:24,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {40316#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40307#true} is VALID [2022-04-27 15:27:24,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {40307#true} assume true; {40307#true} is VALID [2022-04-27 15:27:24,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40307#true} {40307#true} #662#return; {40307#true} is VALID [2022-04-27 15:27:24,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {40307#true} call ULTIMATE.init(); {40316#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#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-27 15:27:24,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {40316#(and (= ~init~0 |old(~init~0)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~#SSLv3_server_data~0.base)| |~#SSLv3_server_data~0.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~#SSLv3_server_data~0.offset)| |~#SSLv3_server_data~0.offset|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_server_data~0.base, ~#SSLv3_server_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_server_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_server_data~0.base); {40307#true} is VALID [2022-04-27 15:27:24,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {40307#true} assume true; {40307#true} is VALID [2022-04-27 15:27:24,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40307#true} {40307#true} #662#return; {40307#true} is VALID [2022-04-27 15:27:24,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {40307#true} call #t~ret161 := main(); {40307#true} is VALID [2022-04-27 15:27:24,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {40307#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; {40307#true} is VALID [2022-04-27 15:27:24,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {40307#true} assume 0 != #t~nondet26;havoc #t~nondet26;call write~$Pointer$(0, 0, ~s~0.base, 136 + ~s~0.offset, 4); {40312#(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-27 15:27:24,901 INFO L272 TraceCheckUtils]: 7: Hoare triple {40312#(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); {40313#(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-27 15:27:24,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {40313#(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); {40314#(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-27 15:27:24,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {40314#(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; {40314#(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-27 15:27:24,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {40314#(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; {40314#(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-27 15:27:24,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {40314#(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)))); {40314#(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-27 15:27:24,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {40314#(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); {40315#(and (= |ssl3_accept_#t~mem45.base| 0) (= |ssl3_accept_#t~mem45.offset| 0))} is VALID [2022-04-27 15:27:24,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {40315#(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; {40308#false} is VALID [2022-04-27 15:27:24,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {40308#false} assume !false; {40308#false} is VALID [2022-04-27 15:27:24,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {40308#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {40308#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {40308#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {40308#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {40308#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {40308#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {40308#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {40308#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {40308#false} assume 8464 == #t~mem55;havoc #t~mem55; {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {40308#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; {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {40308#false} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {40308#false} is VALID [2022-04-27 15:27:24,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {40308#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {40308#false} ~skip~0 := 0; {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {40308#false} assume !false; {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {40308#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {40308#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {40308#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {40308#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {40308#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {40308#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,909 INFO L290 TraceCheckUtils]: 39: Hoare triple {40308#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {40308#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {40308#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {40308#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {40308#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {40308#false} assume 8496 == #t~mem58;havoc #t~mem58; {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 45: Hoare triple {40308#false} assume -2147483648 <= #t~nondet93 && #t~nondet93 <= 2147483647;~ret~0 := #t~nondet93;havoc #t~nondet93; {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 46: Hoare triple {40308#false} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 47: Hoare triple {40308#false} assume !(~ret~0 <= 0);call #t~mem94 := read~int(~s.base, 92 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 48: Hoare triple {40308#false} assume 0 != #t~mem94;havoc #t~mem94;call write~int(8656, ~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {40308#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {40308#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40308#false} is VALID [2022-04-27 15:27:24,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {40308#false} ~skip~0 := 0; {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {40308#false} assume !false; {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {40308#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {40308#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {40308#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {40308#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {40308#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 60: Hoare triple {40308#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 61: Hoare triple {40308#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {40308#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {40308#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {40308#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,911 INFO L290 TraceCheckUtils]: 65: Hoare triple {40308#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {40308#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 67: Hoare triple {40308#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 68: Hoare triple {40308#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 69: Hoare triple {40308#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {40308#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 71: Hoare triple {40308#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 72: Hoare triple {40308#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 73: Hoare triple {40308#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 74: Hoare triple {40308#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {40308#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 76: Hoare triple {40308#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,912 INFO L290 TraceCheckUtils]: 77: Hoare triple {40308#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {40308#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 79: Hoare triple {40308#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 80: Hoare triple {40308#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 81: Hoare triple {40308#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 82: Hoare triple {40308#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 83: Hoare triple {40308#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 84: Hoare triple {40308#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 85: Hoare triple {40308#false} assume 8656 == #t~mem77;havoc #t~mem77; {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 86: Hoare triple {40308#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; {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 87: Hoare triple {40308#false} assume !(0 == ~tmp___9~0);assume -2147483648 <= #t~nondet143 && #t~nondet143 <= 2147483647;~ret~0 := #t~nondet143;havoc #t~nondet143; {40308#false} is VALID [2022-04-27 15:27:24,913 INFO L290 TraceCheckUtils]: 88: Hoare triple {40308#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 89: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 90: Hoare triple {40308#false} assume !(0 == ~tmp___10~0); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 91: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 92: Hoare triple {40308#false} assume !(0 == #t~mem151);havoc #t~mem150.base, #t~mem150.offset;havoc #t~mem151; {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 93: Hoare triple {40308#false} ~skip~0 := 0; {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 94: Hoare triple {40308#false} assume !false; {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 95: Hoare triple {40308#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); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 96: Hoare triple {40308#false} assume !(12292 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 97: Hoare triple {40308#false} assume !(16384 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 98: Hoare triple {40308#false} assume !(8192 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 99: Hoare triple {40308#false} assume !(24576 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,914 INFO L290 TraceCheckUtils]: 100: Hoare triple {40308#false} assume !(8195 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 101: Hoare triple {40308#false} assume !(8480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 102: Hoare triple {40308#false} assume !(8481 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 103: Hoare triple {40308#false} assume !(8482 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 104: Hoare triple {40308#false} assume !(8464 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 105: Hoare triple {40308#false} assume !(8465 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 106: Hoare triple {40308#false} assume !(8466 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 107: Hoare triple {40308#false} assume !(8496 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 108: Hoare triple {40308#false} assume !(8497 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 109: Hoare triple {40308#false} assume !(8512 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 110: Hoare triple {40308#false} assume !(8513 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 111: Hoare triple {40308#false} assume !(8528 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,915 INFO L290 TraceCheckUtils]: 112: Hoare triple {40308#false} assume !(8529 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 113: Hoare triple {40308#false} assume !(8544 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 114: Hoare triple {40308#false} assume !(8545 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 115: Hoare triple {40308#false} assume !(8560 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 116: Hoare triple {40308#false} assume !(8561 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 117: Hoare triple {40308#false} assume !(8448 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 118: Hoare triple {40308#false} assume !(8576 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 119: Hoare triple {40308#false} assume !(8577 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 120: Hoare triple {40308#false} assume !(8592 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 121: Hoare triple {40308#false} assume !(8593 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 122: Hoare triple {40308#false} assume !(8608 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 123: Hoare triple {40308#false} assume !(8609 == #t~mem74);havoc #t~mem74;call #t~mem75 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 124: Hoare triple {40308#false} assume !(8640 == #t~mem75);havoc #t~mem75;call #t~mem76 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,916 INFO L290 TraceCheckUtils]: 125: Hoare triple {40308#false} assume !(8641 == #t~mem76);havoc #t~mem76;call #t~mem77 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,917 INFO L290 TraceCheckUtils]: 126: Hoare triple {40308#false} assume !(8656 == #t~mem77);havoc #t~mem77;call #t~mem78 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,917 INFO L290 TraceCheckUtils]: 127: Hoare triple {40308#false} assume !(8657 == #t~mem78);havoc #t~mem78;call #t~mem79 := read~int(~s.base, 52 + ~s.offset, 4); {40308#false} is VALID [2022-04-27 15:27:24,917 INFO L290 TraceCheckUtils]: 128: Hoare triple {40308#false} assume 8672 == #t~mem79;havoc #t~mem79; {40308#false} is VALID [2022-04-27 15:27:24,917 INFO L290 TraceCheckUtils]: 129: Hoare triple {40308#false} assume -2147483648 <= #t~nondet144 && #t~nondet144 <= 2147483647;~ret~0 := #t~nondet144;havoc #t~nondet144; {40308#false} is VALID [2022-04-27 15:27:24,917 INFO L290 TraceCheckUtils]: 130: Hoare triple {40308#false} assume 3 == ~blastFlag~0; {40308#false} is VALID [2022-04-27 15:27:24,917 INFO L290 TraceCheckUtils]: 131: Hoare triple {40308#false} assume !false; {40308#false} is VALID [2022-04-27 15:27:24,917 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-27 15:27:24,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:27:24,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586162724] [2022-04-27 15:27:24,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586162724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:27:24,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:27:24,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 15:27:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481123464] [2022-04-27 15:27:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:27:24,919 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-27 15:27:24,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:27:24,920 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-27 15:27:24,984 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-27 15:27:24,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:27:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:27:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:27:24,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:27:24,985 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-27 15:27:27,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-27 15:27:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:28,491 INFO L93 Difference]: Finished difference Result 1247 states and 1848 transitions. [2022-04-27 15:27:28,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:27:28,492 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-27 15:27:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:27:28,492 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-27 15:27:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-27 15:27:28,494 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-27 15:27:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2022-04-27 15:27:28,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 402 transitions. [2022-04-27 15:27:28,805 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-27 15:27:28,818 INFO L225 Difference]: With dead ends: 1247 [2022-04-27 15:27:28,818 INFO L226 Difference]: Without dead ends: 627 [2022-04-27 15:27:28,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:27:28,819 INFO L413 NwaCegarLoop]: 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-27 15:27:28,819 INFO L414 NwaCegarLoop]: 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-27 15:27:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-04-27 15:27:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2022-04-27 15:27:28,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:27:28,830 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-27 15:27:28,831 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-27 15:27:28,831 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-27 15:27:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:28,848 INFO L93 Difference]: Finished difference Result 627 states and 927 transitions. [2022-04-27 15:27:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2022-04-27 15:27:28,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:28,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:28,850 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-27 15:27:28,851 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-27 15:27:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:27:28,868 INFO L93 Difference]: Finished difference Result 627 states and 927 transitions. [2022-04-27 15:27:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2022-04-27 15:27:28,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:27:28,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:27:28,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:27:28,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:27:28,870 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-27 15:27:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 927 transitions. [2022-04-27 15:27:28,889 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 927 transitions. Word has length 132 [2022-04-27 15:27:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:27:28,889 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 927 transitions. [2022-04-27 15:27:28,890 INFO L496 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-27 15:27:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 927 transitions. [2022-04-27 15:27:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-27 15:27:28,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:27:28,891 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-27 15:27:28,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:27:28,891 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:27:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:27:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash 547672484, now seen corresponding path program 1 times [2022-04-27 15:27:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:27:28,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007958006] [2022-04-27 15:27:28,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:27:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:27:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:27:29,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:27:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:27:29,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:27:29,647 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:27:29,647 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:27:29,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:27:29,653 INFO L356 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-27 15:27:29,656 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:27:29,786 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:27:29,786 WARN L170 areAnnotationChecker]: SSLv3_server_methodENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-27 15:27:29,787 WARN L170 areAnnotationChecker]: ssl3_acceptENTRY has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: ssl3_get_server_methodENTRY has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1096 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1744 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1744 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1146 has no Hoare annotation [2022-04-27 15:27:29,788 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1063 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1096-2 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1744-1 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1146-2 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: ssl3_get_server_methodFINAL has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1063-1 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: SSLv3_server_methodFINAL has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: L1106 has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-27 15:27:29,789 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1152 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1065 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: SSLv3_server_methodEXIT has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1065-1 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: ssl3_acceptFINAL has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:27:29,790 WARN L170 areAnnotationChecker]: L1167-2 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: ssl3_acceptEXIT has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1724 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1168 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1728 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1728 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1728-2 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1171 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1285 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1285-2 has no Hoare annotation [2022-04-27 15:27:29,791 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1290 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1296 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1189 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1298 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1296-2 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1339 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1304 has no Hoare annotation [2022-04-27 15:27:29,792 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1321 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1322 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1693 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1201 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1694 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1693-1 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1356 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-27 15:27:29,793 WARN L170 areAnnotationChecker]: L1695 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1695 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1356-2 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1697 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1695-2 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1695-2 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1207 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1706 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1706 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1373 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1373-2 has no Hoare annotation [2022-04-27 15:27:29,794 WARN L170 areAnnotationChecker]: L1213 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1383 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1392 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1383-2 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1392-2 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1396 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1219 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1408-2 has no Hoare annotation [2022-04-27 15:27:29,795 WARN L170 areAnnotationChecker]: L1225 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1413 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1454 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1430 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1416 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1455 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1231 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1432 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:27:29,796 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1456 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1496 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1419-1 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1420 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1465 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1423 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 15:27:29,797 WARN L170 areAnnotationChecker]: L1466 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1474 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1509 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1506-1 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1477 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1524 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-27 15:27:29,798 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1533 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-27 15:27:29,799 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1556 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1254 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1258 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1257 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1567 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1260 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1567-2 has no Hoare annotation [2022-04-27 15:27:29,800 WARN L170 areAnnotationChecker]: L1567-2 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1264 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1263 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1577 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1577 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1587 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1587 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:27:29,801 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1577-2 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1594 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1594 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1270 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1269 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1594-2 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1594-2 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1616 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1272 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1606 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1606 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1617 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1621 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1273 has no Hoare annotation [2022-04-27 15:27:29,802 WARN L170 areAnnotationChecker]: L1276 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1627 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1627-2 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1641 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1641 has no Hoare annotation [2022-04-27 15:27:29,803 WARN L170 areAnnotationChecker]: L1637-1 has no Hoare annotation [2022-04-27 15:27:29,803 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-27 15:27:29,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:27:29 BoogieIcfgContainer [2022-04-27 15:27:29,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:27:29,807 INFO L158 Benchmark]: Toolchain (without parser) took 117570.35ms. Allocated memory was 207.6MB in the beginning and 299.9MB in the end (delta: 92.3MB). Free memory was 154.0MB in the beginning and 223.6MB in the end (delta: -69.6MB). Peak memory consumption was 159.5MB. Max. memory is 8.0GB. [2022-04-27 15:27:29,807 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory was 172.9MB in the beginning and 172.9MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:27:29,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.96ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 153.8MB in the beginning and 201.6MB in the end (delta: -47.8MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2022-04-27 15:27:29,809 INFO L158 Benchmark]: Boogie Preprocessor took 146.11ms. Allocated memory is still 249.6MB. Free memory was 201.6MB in the beginning and 191.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 15:27:29,809 INFO L158 Benchmark]: RCFGBuilder took 3425.53ms. Allocated memory is still 249.6MB. Free memory was 191.8MB in the beginning and 161.1MB in the end (delta: 30.7MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. [2022-04-27 15:27:29,810 INFO L158 Benchmark]: TraceAbstraction took 113322.79ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 160.6MB in the beginning and 223.6MB in the end (delta: -62.9MB). Peak memory consumption was 123.2MB. Max. memory is 8.0GB. [2022-04-27 15:27:29,816 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.13ms. Allocated memory is still 207.6MB. Free memory was 172.9MB in the beginning and 172.9MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 668.96ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 153.8MB in the beginning and 201.6MB in the end (delta: -47.8MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 146.11ms. Allocated memory is still 249.6MB. Free memory was 201.6MB in the beginning and 191.8MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * RCFGBuilder took 3425.53ms. Allocated memory is still 249.6MB. Free memory was 191.8MB in the beginning and 161.1MB in the end (delta: 30.7MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. * TraceAbstraction took 113322.79ms. Allocated memory was 249.6MB in the beginning and 299.9MB in the end (delta: 50.3MB). Free memory was 160.6MB in the beginning and 223.6MB in the end (delta: -62.9MB). Peak memory consumption was 123.2MB. 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: 1734]: 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)=4294967306, \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={-4294967306: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={-4294967306:0}, s={-4294967306:0}, s->info_callback={0:14}, 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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=0, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:14}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1388] s->init_num = 0 VAL [={0:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:14}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1606] COND FALSE !(! tmp___10) VAL [={0:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:14}, (s->s3)->tmp.reuse_message=4294967303, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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:14}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967306:0}, s={-4294967306: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 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:14}, blastFlag=3, got_new_session=1, init=1, ret=0, s={-4294967306:0}, s={-4294967306: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] [L1734] reach_error() VAL [={0:14}, blastFlag=3, got_new_session=1, init=1, ret=0, s={-4294967306:0}, s={-4294967306: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: 113.1s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 104.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30 mSolverCounterUnknown, 1747 SdHoareTripleChecker+Valid, 72.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 11593 SdHoareTripleChecker+Invalid, 72.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7129 mSDsCounter, 673 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10483 IncrementalHoareTripleChecker+Invalid, 11186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 673 mSolverCounterUnsat, 4464 mSDtfsCounter, 10483 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.6s 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: 1.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 1083 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2324 NumberOfCodeBlocks, 2324 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2166 ConstructedInterpolants, 0 QuantifiedInterpolants, 5602 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-27 15:27:29,862 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...